- Structures include: Adhoc, Complete Search, Partial Search (Backtracking, Backtracking + Prunining), Smart Search (Greedy, DP)
- How to timecomplexity
- Double weird behaiour
- General Logic
- Trailling Zeroes
- Sequence with Digits
- Two Sets
- Minimizing sums Greedy Logic
- Stick Lengths
- Subarray Divisibility
- Prefix XOR, Coordinate Compression
- Two pointers
- Scanline Thinking
- Monotonic Queue
- Nearest Smaller/Larger Values
- Sliding Window Max/Min
- Maximum Subarray Sum
- Area of a histogram
- Sets & Multisets are cool
- A gift from the Gods - Ordered Set
- Complete Search With Pruning
Created
June 14, 2020 12:29
-
-
Save ankitpriyarup/6870ed7f80c15e2ba6ca89fad679403d to your computer and use it in GitHub Desktop.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment