Daksh

Some text here

Daksh

#Useful Stuff

##Sugar Packages

• Install: sugar-install-bundle /run/media/<USB device name>/<filename.xo>
• Make an xo: zip -r YourActivityName.xo YourActivityName.activity

##GIT

Always remember, do not make changes directly in the master branch. All it takes is a command to make and switch to a new branch git checkout -b

Daksh

Useful Resources | Databases

Hactivity: Codecademy Learn SQL

Cheatsheets

• https://www.cheatography.com//guslong/cheat-sheets/essential-mysql/pdf/
• https://havel.mojeservery.cz/wp-content/uploads/2015/10/mysql-ref-card.pdf
• https://appletree.or.kr/quick_reference_cards/Databases-SQL-NoSQL/mysql-reference-sheet.pdf

Slides

Daksh

from collections import deque 
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def levelOrderBottom(self, root: TreeNode) -> List[List[int]]:
        if not root:

Daksh

class Solution:
    def arrangeCoins(self, n: int) -> int:
        i = 1
        while i*(i+1)/2<=n:
            i+=1
        return i-1
        

Daksh

class Solution:
    def prisonAfterNDays(self, cells: List[int], N: int) -> List[int]:
        memory = {}
        for it in range(N):
            ocells = cells[:]
            for i in range(1,7):
                if ocells[i-1]==ocells[i+1]:
                    cells[i] = 1
                else:
                    cells[i] = 0

Daksh

def isPalindrome(l,r):
    diff = {}
    for k in l.keys():
        diff[k] = r[k]-l[k]
    diff = list(diff.values())
    countOdd = 0
    for e in diff:
        if e%2==1:
            countOdd+=1
    if countOdd<=1: