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

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

Awhile back, the *Harvard Business Review* published some great questions that Gilt Groupe CEO Kevin Ryan asks when he is checking references.

Ryan serves on the board of Yale Corporation, Human Rights Watch, and 173 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

Hiring was one of the hardest things to do when I worked in minor league baseball. At the winter meetings, you had only a few days to sort through the numerous job candidates while fighting 150 other teams for their services. 847 more words

Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).

For example:

Given binary tree… 242 more words

Question:

Linked List Cycle I: Given a linked list, determine if it has a cycle in it.

Linked List Cycle II: Given a linked list, return the node where the cycle begins. 361 more words