This goal will likely be within your ZPD if you...
- Are familiar with basic command line operations
- Are interested in learning about writing SQL queries
- Are interested in learning how to install postgres & use the
psqlcommand line tool.
See reference link for more details:
Reference - https://github.com/irenetrampoline/taylor-swift-lyrics
| ####CSV#### | |
| > Reading CSV | |
| from datetime import datetime | |
| import csv | |
| with open(filename, 'rb') as csvfile: | |
| monthlyBill = csv.reader(csvfile, delimiter = ',', quotechar='|') | |
| for i, row in enumerate(monthlyBill, start = 0): | |
| if(i > 0): | |
| du = DataUsage(row[0],row[1]+" "+row[2],row[3],row[4]); | |
| dataUsageList.append(du); |
| </div> | |
| =-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*= | |
| Final Fantasy III - Job Guide | |
| By: | |
| Penguin Knight, Seferaga and Egervari3 | |
| =-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*=-*= |
| </div> | |
| The last light of our last hope</p> | |
| ______________________________________________________________________________ | |
| | Final Fantasy III | | |
| | DS - CANADA Version | | |
| | 2.0 1/6/07 | | |
| | Not-Even-Pretending-to-be-Spoiler-Free Guide by E-JAE | | |
| ¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯ | |
| ________ |
| pragma solidity ^0.5.2; | |
| import "./IERC20.sol"; | |
| import "./SafeMath.sol"; | |
| /** | |
| * @title Standard ERC20 token | |
| * | |
| * @dev Implementation of the basic standard token. | |
| * https://github.com/ethereum/EIPs/blob/master/EIPS/eip-20.md |
| pragma solidity ^0.5.2; | |
| /** | |
| * Utility library of inline functions on addresses | |
| */ | |
| library Address { | |
| /** | |
| * Returns whether the target address is a contract | |
| * @dev This function will return false if invoked during the constructor of a contract, | |
| * as the code is not actually created until after the constructor finishes. |
| # DSA Question Bank | |
| ## Arrays, Hashing, Prefix/Suffix | |
| 1. Find the second largest element in one pass without extra space. | |
| 2. Find the k largest distinct elements without fully sorting the array. | |
| 3. Find the two numbers that appear once when every other number appears twice. | |
| 4. Find the majority element that appears more than n / 2 times. | |
| 5. Find all elements that appear more than n / 3 times. | |
| 6. Count inversions in an array. |