Advanced Algorithm
Introduction
Follow up in Code Interview
Kth Smallest Number in Sorted Matrix
Minimum Size Subarray Sum
Longest Substring Without Repeating Characters
Longest Substring with At Most K Distinct Characters
Kth Smallest Sum In Two Sorted Arrays
Kth Largest in N Arrays
Two Sum - Less than or equal to target
Kth Smallest Numbers in Unsorted Array
Triangle Count
Minimum Window Substring
Kth Largest Element
Connecting Graph
2 - Data Structure I
Number of Islands
Connecting Graph III
Connecting Graph II
Connecting Graph
Graph Valid Tree
Add and Search Word
Implement Trie
Kth Smallest Sum In Two Sorted Arrays
Find the Weak Connected Component in the Directed Graph
Connected Component in Undirected Graph
Word Search
Number of Islands II
Word Search II
Surrounded Regions
Boggle Game
Word Squares
Kth Smallest Sum In Two Sorted Arrays
Count of Smaller Number before itself
Interval Sum II
3 - Data Structure II
Expression Expand
Trapping Rain Water
Implement Queue by Two Stacks
Min Stack
Sliding Window Median
Trapping Rain Water II
Maximal Rectangle
Max Tree
Largest Rectangle in Histogram
Data Stream Median
Sliding Window Maximum
Binary Tree Maximum Path Sum II
Heapify
K Edit Distance
Expression Tree Build
Convert Expression to Reverse Polish Notation
Convert Expression to Polish Notation
Expression Evaluation
Building Outline
4 - Binary Search + Sweep Line
Sqrt(x)
Maximum Average Subarray
Sqrt(x) II
Number of Airplanes in the Sky
Divide Two Integers
Find Peak Element
First Bad Version
Copy Books
Find Peak Element II
Wood Cut
Find the Duplicate Number
Smallest Rectangle Enclosing Black Pixels
5 - Dynamic Problem I
Longest Increasing Continuous Subsequence
Maximum Subarray
Maximal Square
Longest Palindromic Substring
Coins in a Line II
Coins in a Line
House Robber
Maximum Product Subarray
Longest Increasing Subsequence
Longest Increasing Continuous subsequence II
Maximal Square II
Longest Repeating Subsequence
Copy Books II
Post Office Problem
Coins in a Line III
Best Time to Buy and Sell Stock IV
6 - Dynamic Problem II
Stone Game II
Stone Game
Edit Distance
Backpack
Longest Common Subsequence
K Edit Distance
Scramble String
Coins in a Line III
Backpack VI
Backpack V
Backpack IV
Backpack II
Distinct Subsequences
Minimum Adjustment Cost
Interleaving String
Burst Balloons
Backpack III
Best Time to Buy and Sell Stock IV
k Sum
7 - Follow Up
Flatten Binary Tree to Linked List
Flatten List
Subarray Sum
Subarray Sum II
Flatten Nested List Iterator
Submatrix Sum
Continuous Subarray Sum
Continuous Subarray Sum II
Kth Smallest Number in Sorted Matrix
Minimum Size Subarray Sum
Subarray Sum Closest
Find Peak Element
Maximum Gap
Nested List Weight Sum
Flatten 2D Vector
Bomb Enemy
Zigzag Iterator II
Zigzag Iterator
Build Post Office
Build Post Office II
Find Peak Element II
Powered by
GitBook
Follow up in Code Interview
Follow up in Code Interview
results matching "
"
No results matching "
"