These\'re the posts that I\'m using for concept revision and for improving on struggling concepts. The links are given in a more or less relevantly sorted order.\n\n**Binary Search**\nhttps://leetcode.com/discuss/study-guide/786126/Python-Powerful-Ultimate-Binary-Search-Template.-Solved-many-problems\n\n**Two Pointers**\nhttps://leetcode.com/problems/subarray-sum-equals-k/discuss/301242/General-summary-of-what-kind-of-problem-can-cannot-solved-by-Two-Pointers\n\n**2,3,k-sums**\nhttps://leetcode.com/problems/two-sum/discuss/737092/Sum-MegaPost-Python3-Solution-with-a-detailed-explanation\n\n**Monotic queue and stacks**\nhttps://leetcode.com/problems/shortest-subarray-with-sum-at-least-k/discuss/204290/Monotonic-Queue-Summary\nhttps://leetcode.com/problems/sum-of-subarray-minimums/discuss/178876/stack-solution-with-very-detailed-explanation-step-by-step\n\n**K-th smallest**\nhttps://leetcode.com/problems/k-th-smallest-prime-fraction/discuss/115819/summary-of-solutions-for-problems-reducible-to-leetcode-378\n\n**Prefix Sum**\nhttps://leetcode.com/discuss/general-discussion/563022/prefix-sum-problems\n\n**Bit Manipulation**\nhttps://leetcode.com/problems/sum-of-two-integers/discuss/84278/A-summary%3A-how-to-use-bit-manipulation-to-solve-problems-easily-and-efficiently\n\n**Greedy**\nhttps://leetcode.com/discuss/general-discussion/1061059/ABCs-of-Greedy\n\n**Backtracking**\nhttps://leetcode.com/problems/permutations/discuss/18284/Backtrack-Summary:-General-Solution-for-10-Questionsh\n\n**DP**\nhttps://leetcode.com/discuss/general-discussion/458695/dynamic-programming-patterns\n\n**Buy & Sell Stock**\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/discuss/108870/Most-consistent-ways-of-dealing-with-the-series-of-stock-problems\n\n**Graph Algorithms in Python**\nhttps://leetcode.com/discuss/general-discussion/971272/Python-Graph-Algorithms-One-Place-for-quick-revision\n\n\n

These\'re the posts that I\'m using for concept revision and for improving on struggling concepts. The links are given in a more or less relevantly sorted order