Quickselect Algorithm The quickselect algorithm seeks to find the kth smallest value or the kth largest value in an input array in linear time on … Read More
Buy and Sell Stock Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to comple… Read More
House Robber Problem You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed; the on… Read More
Understanding the Problem To solve the problem of climbing stairs, you can use a technique called dynamic programming. Dynamic programming is a me… Read More