nidarshn / algobloom

Many of the problems have been provided with different methods and also explanation at tricky places.

AlgoBloom

This is the storehouse for all the problems I've done till now and resources that can be referred while stuck or practicing.

How Not to Interview :p

https://docs.google.com/document/d/1JH4ElSvgyi-12AVNyia6GESgFX0DQ7xTYP6IY8oSBy4/edit?usp=sharing

• Compilation of my interview fails ! Made many silly mistakes in many interviews.

Resources for Interview Prep:

https://docs.google.com/document/d/1dLRl5DEgOShx8uR3lUIcHzGyk5vwF_KjVoSVO19cx7k/edit?usp=sharing

• IF beginner study data structures from pepcoding youtube videos and code simultaneously. Then code all standard questions present in gfg . Then practice the harder,medium questions and keep on revising daily . Take advantage of contests held on codechef,codeforces and leetcode. Upsolve questions , never aim for less. Mediocrity makes you blunt .Solve each question using multiple approaches , use discuss sections of leetcode and youtube. Write everything you dont understand in a book and revise it daily. You may be late or learning slow , but with consistent practice and revision you will beat anyone ! Take advantage of learning sprints by codechef which has different levels.

System Design

https://docs.google.com/document/d/16wtG6ZsThlu_YkloeyX8pp2OEjVebure/edit?usp=sharing&ouid=113613682628618957229&rtpof=true&sd=true

Todo problems in following topics:

Water ,stack problems:

https://leetcode.com/problemset/all/?search=water%20

Heaps:

comparator problems

Trees

1. vertical traversal
2. views: top-view ,side -view, bottom view
3. Construct BT given it's preorder ,postorder traversal.
4. Level order traversal questions.
5. Iterative postorder,preorder,inorder traversals

Arrays:

1. string related
2. palindrome
3. Backtracking

DP:

1. LCS
2. LIS
3. Knapsack
4. grid
5. Matrix chain
6. string - palindrome ,substring ,subsequence ,subset
7. Subset

Resources

1. https://www.codechef.com/certification/data-structures-and-algorithms/prepare#foundation
2. https://www.codechef.com/certification/data-structures-and-algorithms/prepare#advanced
3. https://leetcode.com/discuss/general-discussion/665604/Important-and-Useful-links-from-all-over-the-LeetCode

DP:

1. https://leetcode.com/discuss/general-discussion/1050391/must-do-dynamic-programming-problems-category-wise
2. https://www.geeksforgeeks.org/dynamic-programming/
3. https://leetcode.com/discuss/general-discussion/458695/Dynamic-Programming-Patterns
4. https://leetcode.com/problems/house-robber/discuss/156523/From-good-to-great.-How-to-approach-most-of-DP-problems

Backtracking:

1. https://leetcode.com/problems/permutations/discuss/18239/A-general-approach-to-backtracking-questions-in-Java-(Subsets-Permutations-Combination-Sum-Palindrome-Partioning)
2. https://www.geeksforgeeks.org/backtracking-algorithms/

Heaps:

1. https://www.geeksforgeeks.org/heap-data-structure/
2. https://www.cs.purdue.edu/cgvlab/courses/251/lectures/slides/02.16-Heap.pdf
3. https://courses.cs.washington.edu/courses/cse373/13wi/lectures/02-08/14-heaps-comparators.pdf

Bit manip:

1.https://leetcode.com/discuss/general-discussion/1073221/All-about-Bitwise-Operations-Beginner-Intermediate 2.https://leetcode.com/discuss/general-discussion/1080312/Bit-Manipulation-All-that-you-must-know! 3.

Graphs:

1. https://leetcode.com/discuss/general-discussion/1079048/graph-traversals-and-number-of-connected-components-for-beginners
2. https://leetcode.com/discuss/general-discussion/1078072/Introduction-to-Topological-Sort
3. https://www.geeksforgeeks.org/graph-data-structure-and-algorithms/

Prefix sum problems:

• https://leetcode.com/problems/subarray-sum-equals-k/
• https://leetcode.com/problems/make-sum-divisible-by-p/
• https://leetcode.com/problems/continuous-subarray-sum/
• https://leetcode.com/problems/contiguous-array/
• https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/

Sliding window:

* Number of Substrings Containing All Three Characters
* Count Number of Nice Subarrays
* Replace the Substring for Balanced String
* Max Consecutive Ones III
* Binary Subarrays With Sum
* Subarrays with K Different Integers
* Fruit Into Baskets
* Shortest Subarray with Sum at Least K
* Minimum Size Subarray Sum
* https://www.geeksforgeeks.org/window-sliding-technique/

Trees Q/A to do:

Morris traversal

• https://leetcode.com/problems/binary-tree-level-order-traversal/
• https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/solution/
• https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/
• https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/
• https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/
• https://www.hackerrank.com/challenges/tree-top-view/problem
• https://leetcode.com/problems/balanced-binary-tree/
• https://leetcode.com/problems/delete-node-in-a-bst/
• https://leetcode.com/problems/binary-tree-tilt/

Practice , revise from coding ninjas , geeksforgeeks

DP todo:

Hard- https://www.hackerrank.com/domains/algorithms?filters%5Bsubdomains%5D%5B%5D=dynamic-programming&filters%5Bdifficulty%5D%5B%5D=hard

• https://leetcode.com/problems/make-sum-divisible-by-p/

• https://leetcode.com/problems/longest-palindromic-subsequence/

• https://leetcode.com/problems/maximum-product-subarray/

• Sunday todo:Search in Rotated Sorted Array II

• https://leetcode.com/problemset/all/?search=subarray

• https://leetcode.com/problemset/all/?search=subset

• https://leetcode.com/problemset/all/?search=maximum

Data structures:

• Trees - traversals, subtree , lca, diameter, path sum , traversal construction etc
• Linked list - sum, reverse, double , numbers, merge ,reverse k-group etc
• Heaps - median , k-largest ,priority
• Graph - connected ,topological , algorithms-prim,kruskal etc
• Stacks - parentheses ,rainwater etc
• DP - standard problems , gfg ,leetcode ,HackerRank -2d,1d,lcs,lis,maze,max,min,longest etc
• Divide conquer
• Sorting algos
• Time complexity
• Merge lists ,binary search