Learn / Coding and algorithms Go to Overview 1. Complexity and what n allows 2. Arrays, hashing, and two pointers, Pro 3. Sorting, selection, and binary search, Pro 4. Heaps, stacks, and streaming data, Pro 5. Dynamic programming, with a probability flavor, Pro 6. Simulation done right, Pro Flashcards, 0 of 16 reviewed Basic quiz Advanced quiz Terms Coding and algorithms
0 of 6 lessons
0 of 16 cards Complexity, hashing, two pointers, binary search, heaps, dynamic programming, and Monte Carlo. The patterns behind most research and developer coding rounds at trading firms.
B Basic3 lessons 1 Complexity and what n allows Before writing a line, read the input size. It tells you which complexity will pass, which tells you which algorithm to look for. 9 min 2 Arrays, hashing, and two pointers Most array problems become one pass once you store the right thing: a running sum, a map of what you have seen, or two indices that move toward each other. 11 min 3 Sorting, selection, and binary search Sorting is often the first step, and binary search works on far more than sorted lists: any yes or no question that flips once as a number grows. 10 min Q Basic quiz 10 questions, 80% passes