Daily Coding Problem: Get exceptionally good at coding interviews by solving one problem every day

I Data Structures
1 Arrays
1 1 Get product of all other elements
1 2 Locate smallest window to be sorted
1 3 Calculate maximum subarray sum
1 4 Find number of smaller elements to the right
2 Strings
2 1 Find anagram indices
2 2 Generate palindrome pairs
2 3 Print zigzag form
2 4 Determine smallest rotated string
3 Linked Lists
3 1 Reverse linked list
3 2 Add two linked lists that represent numbers
3 3 Rearrange a linked list to alternate high-low
3 4 Find intersecting nodes oflinked lists
4 Stacks and Qyeues
4 1 Implement a max stack
4 2 Determine whether brackets are balanced
4 3 Compute maximum ofk-length subarrays
4 4 Reconstruct array using+/- signs
5 Hash Tables
5 1 Implement an LRU cache
5 2 Cut brick wall
6 Trees
Implement a sparse array
Count unival trees
Reconstruct tree from pre-order and in-order traversals
Evaluate arithmetic tree
Get tree level with minimum sum
7 Binary Search Trees
7 1 Find floor and ceiling
7 2 Convert sorted array to BST
7 3 Construct all BSTs with n nodes
8 Tries
Implement autocomplete system
Create PrefixMapSum class
Find Maximum XOR of element pairs
9 Heaps
9 1 Compute the running median
9 2 Find most similar websites
9 3 Generate regular numbers
9 4 Build a Huffman tree
10 Graphs
10 1 Determine if a cycle exists
10 2 Remove edges to create even trees
10 3 Create stepword chain
10 4 Beat Snakes and Ladders
10 5 Topological sort
11 Advanced Data Structures
11 1 Fenwick tree
11 2 Disjoint-set data structure
11 3 Bloom filter
II Algorithms
12 Recursion
12 1 Tower of Hanoi
12 2 Implement regular expressions
12 3 Find array extremes efficiently
12 4 Play Nim
13 Dynamic Programming
13 1 Number ofways to climb a staircase
13 2 Number ofways to decode a string
13 3 Painting houses
14 Backtracking
14 1 Compute flight itinerary
14 2 Solve Sudoku
14 3 Count Android unlock combinations
15 Sorting and Searching
15 1 Dutch flag problem
15 2 Pancake sort
15 3 Efficiently sort a million integers
15 4 Find minimum element in rotated sorted array
16 Pathfinding
16 1 Dijkstra's algorithm
16 2 Bellman-Ford
16 3 Floyd-Warshall
17 Bit Manipulation
17 1 Find element that appears once in list
17 2 Implement division without / or * operators
17 3 Compute longest consecutive string of ones in binary
17 4 Find nth sevenish number
18 Randomized Algorithms
18 1 Pick random element from infinite stream
18 2 Shuffle deck of cards
18 3 Markov chain
19 Advanced Algorithms
19 1 Rabin-Karp
19 2 Hierholzer's algorithm
19 3 A* search
IIIApplications
20 Applications
20 1 Ghost
20 2 Connect
20 3 Cryptarithmetic
20 4 Cheapest itinerary
20 5 Alien dictionary
20 6 Prime numbers
20 7 Crossword puzzles
20 8 UTF-8 encodings
20 9 Blackjack
IV Design
21 Data Structure Design
21 1 Dictionary with time key
21 2 Qyeue with fixed-length array
21 3 Qyack
22 System Design
22 1 Crawl Wikipedia
22 2 Design a hit counter
22 3 What happens when you visit a URL?
Glossary