epi

Covers all chapters and topics from the "Elements of Programming Interviews" book with their corresponding Leetcode problem links

Chapter 5: Arrays

Topic	Title	Leetcode
5.1	Dutch National Flag	Sort Colors
5.2	Increment an arbitrary precision integer	Plus One
5.3	Multiply two arbitrary precision integers	Multiply Strings
5.4	Advancing through an array	Jump Game
5.5	Delete duplicates from a sorted array	Remove Duplicates from Sorted Array
5.6	Buy and Sell a stock once	Best Time to Buy and Sell Stock
5.7	Buy and Sell a stock twice	Best Time to Buy and Sell Stock III
5.8	Computing an alternation	Wiggle Sort
5.9	Enumerate all primes to n	Count Primes
5.10	Permute the elements of an array	Permutations
5.11	Compute the next permutation	Next Permutation
5.17	The Sudoku checker problem	Valid Sudoku
5.18	Compute the spiral ordering of a 2D array	Spiral Matrix
5.19	Rotate a 2D array	Rotate Image
5.20	Compute rows in Pascal's Triangle	Pascal's Triangle

Chapter 6: Strings

Topic	Title	Leetcode
6.1	Interconvert strings and integers	String to Integer (atoi)
6.2	Base conversion	Convert a Number to Hexadecimal
6.3	Compute the spreadsheet column encoding	Excel Sheet Column Number
6.5	Test palindromicity	Valid Palindrome
6.6	Reverse all the words in a sentence	Reverse Words in a String
6.7	Compute all mnemonics for a phone number	Letter Combinations of a Phone Number
6.8	The look-and-say problem	Count and Say
6.9	Convert from Roman to decimal	Roman to Integer
6.10	Compute all valid IP addresses	Restore IP Addresses
6.11	Write a string sinusoidally	Zigzag Conversion
6.12	Implement run-length encoding	String Compression
6.13	Find the first occurrence of a substring	Implement strStr()

Chapter 7: Hash Tables

Topic	Title	Leetcode
7.1	Test for palindromic permutations	Palindrome Permutation
7.2	Is an anonymous letter constructible?	Ransom Note
7.3	Implement an ISBN cache	LRU Cache
7.4	Compute the LCA, optimizing for close ancestors	Lowest Common Ancestor of a Binary Tree III
7.5	Find the nearest repeated entries in an array	Shortest Word Distance II
7.6	Find the smallest subarray covering all values	Minimum Window Substring
7.7	Find smallest subarray sequentially covering all values	Minimum Window Subsequence
7.8	Find the longest subarray with distinct entries	Longest Substring Without Repeating Characters
7.9	Find the length of a longest contained interval	Longest Consecutive Sequence
7.10	Compute all string decompositions	Substring with Concatenation of All Words

Chapter 8: Stacks and Queues

Topic	Title	Leetcode
8.1	Implement a stack with max API	Max Stack
8.2	Evaluate RPN expressions	Evaluate Reverse Polish Notation
8.3	Test a string over "{,},(,),[,]" for well-formedness	Valid Parentheses
8.4	Normalize pathnames	Simplify Path
8.5	Compute buildings with a sunset view	Sliding Window Maximum
8.6	Compute binary tree nodes in order of increasing depth	Binary Tree Level Order Traversal
8.7	Implement a circular queue	Design Circular Queue
8.8	Implement a queue using stacks	Implement Queue using Stacks

Chapter 9: Binary Trees

Topic	Title	Leetcode
9.1	Test if a binary tree is height-balanced	Balanced Binary Tree
9.2	Test if a binary tree is symmetric	Symmetric Tree
9.3	Compute the lowest common ancestor in a binary tree	Lowest Common Ancestor of a Binary Tree
9.4	Compute the LCA when nodes have parent pointers	Lowest Common Ancestor of a Binary Tree III
9.5	Sum the root-to-leaf paths in a binary tree	Sum Root to Leaf Numbers
9.6	Find a root to leaf path with specified sum	Path Sum
9.7	Compute the kth node in an inorder traversal	Kth Smallest Element in a BST
9.8	Compute the successor	Inorder Successor in BST
9.9	Implement an inorder traversal without recursion	Binary Tree Inorder Traversal
9.10	Implement a preorder traversal without recursion	Binary Tree Preorder Traversal
9.11	Implement a postorder traversal without recursion	Binary Tree Postorder Traversal
9.12	Compute the right sibling tree	Populating Next Right Pointers in Each Node

Chapter 10: Heaps

Topic	Title	Leetcode
10.1	Merge sorted files	Merge k Sorted Lists
10.3	Sort an almost-sorted array	Find Median from Data Stream
10.4	Compute the k closest stars	K Closest Points to Origin
10.5	Compute the median of online data	Find Median from Data Stream
10.6	Compute the k largest elements in a max-heap	Kth Largest Element in an Array

Chapter 11: Searching

Topic	Title	Leetcode
11.1	Search a sorted array for first occurrence of k	Find First and Last Position of Element in Sorted Array
11.2	Search a sorted array for entry equal to its index	Fixed Point
11.3	Search a cyclically sorted array	Find Minimum in Rotated Sorted Array
11.4	Compute the integer square root	Sqrt(x)
11.6	Search in a 2D sorted array	Search a 2D Matrix II
11.8	Find the kth largest element	Kth Largest Element in an Array
11.10	Find the duplicate and missing elements	Set Mismatch

Chapter 13: Sorting

Topic	Title	Leetcode
13.1	Compute the intersection of two sorted arrays	Intersection of Two Arrays II