Algorithms Approximate algorithms for NP problems We have covered Idea of Approximate algorithms for NP problems. NP problems are tough but Approximate algorithms are considered to be a good approach as we get a answer close to the real answer in reasonable time. We have covered the basics with examples of problems like Bin Packing.
Algorithms Shortest Subarray with at least K as sum In this problem, we find the length of the Shortest Subarray with at least K as sum. This can be solved in O(N) time complexity. This brings in the ideas of Monotonic Queue and Sliding Window.
Algorithms How to approach Dynamic Programming problems? (with example) We have explained How to approach a Dynamic Programming problem with an example. The approach depends on the constraints of the problem at hand.