finally starting a new challenge where I will do one of three things in a day for the next 50 days.
1. do some amount of DSA , WEB DEV and GATE prep (prob most common)
2. do one of DSA , GATE or DEV for a very long duration
3. do two of DSA , GATE and DEV for good enough time
1
18
Day 100 of #100DaysOfCode
did a priority queue question.
Alright so 100 days finally done couldn't get a lot done in the last few days because of internals in college but was a fun thing to do honestly ill take a few days before starting something similar very soon.
1
9
Day 96 of #100DaysOfCode
again could only do 1 leetcode problem as internals are today
1
14
Day 95 of #100DaysOfCode
as internal exams are around the corner can't do much so only did one leetcode qn
2
25
Day 93 of #100DaysOfCode
did nearly sorted/k sorted problem , k most frequent elements , sort array by increasing frequency and k closest points to origin all using priority queues(heaps)
2
20
Day 90 of #100DaysOfCode
started heaps (priority queues) did kth largest element in an unsorted array and kth smallest element in an unsorted array
1
13
Day 89 of #100DaysOfCode
did palindrome partitioning , N queens I and II and sudoko solver using recursion and backtracking and a few questions on binary search trees
1
13
Day 88 of #100DaysOfCode
could only do one leetcode problem. Will try to do more in the last leg of this challenge
2
43
Day 86 of #100DaysOfCode
did combination sum 3 , subset sum 1 and 2 using recursion
1
12
Day 85 of #100DaysOfCode
did printing all subsequences of an array , count all subsequences with sum k and combination sum 1 and 2
1
12
Day 84 of #100DaysOfCode
did few more basic recursion questions on functional recursion
1
10
Day 83 of #100DaysOfCode
started recursion and did basic recursion question liking printing nos from 1 to n , factorial and Fibonacci sequence
11
Day 82 of #100DaysOfCode
did delete a node from a BST , find kth smallest element in a BST, check if a tree is BST or BT , LCA in a BST , construct a BST using preorder traversal , Inorder successor in a BST , design question on BST iterator , two sum in BST and recover BST
2
22