Skip to content

PrinceofChum/100-Days-Of-Code

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

My 100-Days-Of-Code

Why

I became bored of trying random things and having low self-esteem. Here, I have started to try on a progress. I hope It may be helpful to someone too who is this now.

Schedule / What I did

Day 1: Learnt the time complexity with Big O notation.

Day 1 Notes

Day 2: Learnt about "Array/List"

    -Introduction to Array/List
    -How to use lists
    -List Comprehension

Day 2 Notes

Day 3: Learnt about "Stacks"

    -Introduction to Stack
    -Implementation of Stacks using list
    -Applications of Stack

Day 3 Notes

Day 4: Learnt "Infix to Postfixt using stack"

Day 4 Notes

Day 5 Learnt about "Queue"

    -Introduction to Queue
    -Implementation of Queue
    -Applications of Queue

Day 5 Notes

Day 6 Learnt about "Priority Queue"

    -Introduction to Priority Queue
    -Implementation of Priority Queue
    -Applications of Priority Queue

Day 6 Notes

Day 7 Learnt "Linked List"

    -Introduction to Linked List
    -Implementation of Singly & Doubly Linked List
    -Advantages & Disadvantages of DLL over SLL

Day 7 Notes

Day 8

    -Introduction to Circular Linked List
    -Applications of Circular Linked List
    -Implementation of Circular Singly Linked List

Day 8 Notes

Day 9

    -Introduction to Tree and Binary Tree
    -Implementation of Binary Tree

Day 9 Notes

Day 10

    -Introduction to Trie
    -Implementation of Trie
    -How Tries are used

Day 10 Notes

Day 11

    -Modules and Packages

Day 11 Notes

Day 12

    -Improving Naive
    -Eucldin's Algo for gcd.

Day 12 Notes

Day 13 Learnt Graph.

    -Introduction to Graph
    -Simple Implementation of Graph
    -Application of Graph

Day 13 Notes

Day 14

    -Overview on Heapq
    -Application of Heapq

Day 14 Notes

Day 15 Graph Traversal.

    -BFS Algo and Implementation
    -DFS Algo and Implementation

Day 15 Notes

Day 16

    -Intro to Min Heap vs Max Heap.

Day 16 Notes

Day 17

    -Min Heap Implementation
    -Max Heap Algorithm

Day 17 Notes

Day 18 Pickle in Python.

    -Intro to Pickling and Unpickling
    -Application of Pickling
    -Implementation of Pickling and Unpickling

Day 18 Notes

Day 19 Sorting Algorithms.

    -Intro to Sorting Algorithms
    -Implementation of QuickSort Algo

Day 19 Notes

Day 20 Sorting Algorithms.

    -Why MergeSort to Linked List.
    -Implementation of MergeSort Algo.

Day 20 Notes

Day 21 Searching Algorithms

    -Intro to Searching Algos
    -Implementation of Linear Search
    -Implementation of Binary Search

Day 21 Notes

Day 22

    -FLAMES

Day 22 Notes

Day 23

    -Check Balanced Brackets

Day 23 Notes

Day 24

    -Stack with Max (Naive)

Day 24 Notes

Day 25

    -Love Calculator

Day 25 Notes

Day 26

    -Merge Two Sorted Arrays
    -Find Subarray with given sum

Day 26 Notes

Day 27

    -Find duplicates
    -Find missing number
    -Array Rotation

Day 27 Notes

Day 28 Detect Loop in Linked List

    -without hash map
    -Floyd's cycle - finding algorithm

Day 28 Notes

Day 29

    -Rotate a linked list
    -Merge two sorted linked lists

Day 29 Notes

Day 30

    -Search Element in a linked list
            -Iterative Solution
            -Reursive solution
    -Find middle of a linked list
            -Traverse a whole list
            -Using fast and slow poiters
            -Using extra space

Day 30 Notes

Day 31 Stack Problems

    -Sort a stack using recursion
    -Implement k stacks in a single list

Day 31 Notes

Day 32 Tree Problems

    -Minimum Value in BST
    -Height of a binary tree

Day 32 Notes

Day 33

    -Find k'th largest element in BST

Day 33 Notes

Day 34 Array Problems

    -Count inversions
    -Sliding window maximum

Day 34 Notes

Day 35 Array Problems

    -Treapping Rain Water
    -Longest sum contiguous subarray

Day 35 Notes

Day 36

    -Disign a data structure for LRU Cache

Day 36 Notes

Day 37

    - Clone a linked list with with next and random pointer.

Day 37 Notes

Day 38 Notes

    -Finding interaction point of two linked lists.

Day 38 Notes

Day 39 Notes

    - Stack -- getmin() with O(1) time and O(1) extra space

Day 39 Notes

Day 40

    -Queue using Stack

Day 40 Notes

Day 41

    -Check for BST
    -Vertical traversal of binary tree

Day 41 Notes

Day 42

    -Boundary traversal of binary tree

Day 42 Notes

Day 43

    -Delete node in BST

Day 43 Notes

Day 44

    - Feet to Meter converter

Day 44 Notes

Day 45

    - Detect Cycle in Graph

Day 45 Notes

Day 46 graph problem.

    - Find number of islands.

Day 46 Notes

Day 47 Graph problem.

    - Implementing Dijkstra Algorithm

Day 47 Notes

Day 48 HckerRank Problem in Trie.

    -Contacts

Day 48 Notes

Day 49 HackerRank Problem

    -Simple Text Editor

Day 49 Notes

Day 50 HackerRAnk Problem

    -Castle on the grid

Day 50 Notes

Day 51 Notes HackerRank Problem

    -Waiter

Day 51 Notes

Day 52 HackerRank Problem - Jim and the Skyscrapers

    - Using List and Dictionary
    - USing Stack

Day 52 Notes

Day 53 HackerRank Problem

    - Largest Rectangle

Day 53 Notes

Day 54

    - Currency Converter

Day 54 Notes

Day 55 Regex Problems

    - Find word
    - Detect HTML links

Day 55 Notes

Day 56 & 57

    - Loan Calculator App

Day 56 & 57 NOtes

Day 58 & 59

    - Tip Calculator

Day 58 & 59 Notes

Day 60

    - ATM.
    - Second Largest Number.
    - Add two numbers.
    - Puppy and Sum    

Day 60 NOtes

Day 61

    -Enormous Input Test
    - Find Reminder
    - Sum of digits

Day 61 Notes

Day 62

    -Play music using Python

Day 62 Notes

Day 63 Beginner Codechef

    -First and last digit
    -Small FActorial
    -Turbo set

Day 63 Notes

Day 64 Codechef's DSA Learning Series

    -Buy please
    -Is both or not

Day 64 Notes

Day 65 Codechef's DSA Learning Series

    -Factors Finding
    -Finding Second Largest

Day 65 Notes

Day 66 Codechef's DSA Learning Series

    -Range odd
    -Raju and Trip
    -Find Me

Day 66 Notes

Day 67 & 68 Codechef's DSA Learning Series

    -Range odd
    -Raju and Trip
    -Find Me

Day 67 & 68 Notes

Day 69 & 70 Codechef's DSA Learning Series

    -Life, the universe, and everything
    -Reverse the number
    -Lapindromes

Day 69 & 70 Notes

Day 71 Codechef's DSA Learning Series

    -Smart Phone

Day 71 Notes

Day 72 Codechef's DSA Learning Series

    -Carvans

Day 72 Notes

Day 73 Codechef's DSA Learning Series

    -Coin Flip

Day 73 Notes

About

Here, I have started to work on a progress.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages