Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.
For example, given the following triangle… 123 more words
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 complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit. 292 more words
Last month, I talked a bit about how to be like Loki and ace a job application by telling the truth. Using the Norse god of lies as a case study, we talked about what not to say in a job interview. 382 more words