Algorithm and Data Structure
Introduction
Sort
Insert Sort
Bubble Sort
Merge Sort
Quick Sort
Heap Sort
Count Sort
Bucket Sort
Array
Two Sum
Three Sum
Three Sum Closest
Kth Largest Element in an Array
Median of Two Sorted Array
Median from Several Files
Find Median from Data Stream
Remove Duplicates from Sorted Array
Remove Duplicates from Sorted Array II
Plus One
Integer Multiply
Merge Sorted Array
Next Permutation
Permutation Sequence
Intersection of Two Sorted Arrays
Intersections of Two Arrays
Compute Rows In Pascal's Triangle
Array_Sort
Sort Colors
Merge Intervals
Insert Intervals
Render Calendar
Union of Intervals
Team Day Photo I
Smallest Nonconstructible Value
Compute Salary Threshold
SORT5
Array_Other
Product of Array Except Self
Trapping Rain Water
Gas Station
Candy
Majority Element
First Missing Positive
Shuffle an Array
Sample Offline
Sample Online
Non Uniform Random Number
Non Uniform Random Number II
Sliding Window Median
Sliding Window Maximum
Maximum Water Trapped by a Pair of Vertical Lines
Compute an Optimum Assignment of Tasks
The Interval Covering Problem
Rotate an Array
Find the Line Through the Most Points
The View from Above
Draw the Skyline
Array_DP
Maximum Size Subarray Sum Equals k
Minimum Size Subarray Sum Equals k
Minimum Size Subarray Sum
Longest Consecutive Sequence
Longest Increasing Subsequence
Maximum Sum Subarray
Maximum Product Subarray
Longest Common Substring
Longest Repeating Substring
Longest Substring Without Repeating Characters
Jump Game
Jump Game II
Frog Jump
Heap
Merge K Sorted Arrays
Vaccination Problem
Sort an Increasing-Decreasing Array
Sort an Almost-Sort Array
Compute the K Closest Stars
Compute the K Most Frequent Queries
Student With Top Three Scores
Find the Nearest Repeated Entries In an Array
Find the Smallest Subarray Covering All Values
Matrix
Spiral Matrix
Search a 2D Matrix
Set Matrix Zeros
Rotate Image
Game of Life
Maximal Square
Find the Maximum 2D Subarray
Search
Search for a Range
Search Insert Position
Search in Rotated Sorted Array
Search in Rotated Sorted Array II
Find Minimum in Rotated Sorted Array
Find Minimum in Rotated Sorted Array II
Find Maximum in Increasing and Decreasing Array
Sqrt(x) Integer
Sqrt(x) Float
Find the Min and Max Simultaneously
Search a Sorted Array of Unknown Length
Linked List
Reverse Linked List
Reverse Linked List II
Reverse Nodes in K group
Add Two Numbers
Plus One Linked List
Implement Even-odd Merge
Test for Overlapping Lists I
Remove Duplicate
Linked List Cycle
Linked List Cycle II
LRU Cache
Merge Two Sorted List
Merge K Sorted List
Sort List
Copy List with Random Pointer
Rotate List
Remove Nth Node from End of List
Swap Nodes in Pairs
Partition List
Reorder List
String
Interconvert Strings and Integers
String to Integer
Base Conversion
Reverse String
Reverse Words in a String
Reverse Words in a String II
Valid Palindrome
Implement strStr()
Add Binary
Longest Palindromic String
Group Anagrams
Count and Say
String Compress
Encoding and Decoding
Simplify Path
ZigZag Conversion
Wildcard Matching
Regular Expression I
Regular Expression II
Tree
Binary Tree Preorder Traversal
Binary Tree Inorder Traversal
Binary Tree Postorder Traversal
Binary Tree Level Order Traversal
Binary Tree Zigzag Level Order Traversal
Same Tree
Symmetric Tree
Balanced Binary Tree
Flatten Binary Tree to Linked List
Populating Next Right Pointers in Each Node II
Construct Binary Tree from Preorder and Inorder Traversal
Construct Binary Tree from Inorder and Postorder Traversal
Lowest Common Ancestor of a Binary Tree
Minimum Depth of Binary Tree
Maximum Depth of Binary Tree
Path Sum
Binary Tree Maximum Path Sum
Sum Root to Leaf Numbers
Binary Tree Upside Down
Delete Subtree
Form a Linked List from the Leaves of a Binary Tree
Print Tree In Vertical Order
Reconstruct a Binary Tree from Traversal Data
Implement Locking in a Binary Tree
Diameter of a Binary Tree
BST
Search for an Element in BST
Kth Smallest Element in BST
Lowest Common Ancestor of a BST
Validate Binary Search Tree
Convert Sorted Array to Binary Search Tree
Convert Sorted List to Binary Search Tree
Recover Binary Search Tree
Inorder Successor in BST
Inorder Predecessor in BST
Find the Closest Entries in Three Sorted Arrays
The Range Lookup Problem
Graph
Clone Graph
Dijkstra
Topology Sort
Compute a Shortest Path With Fewest Edges
Minimum Spanning Tree
Unique Path Graph I
Unique Path Graph II
Team Photo Day II
Road Network
Test if Arbitrage is Possible
Stack and Queue
Min Stack
Min Queue
Valid Parentheses
Longest Valid Parentheses
Evaluate Reverse Polish Notation
Convert to RPN
Queue Time Stamp
Largest Rectangle in Histogram
Implement Queue using Stacks
Implement Stack using Queues
Dynamic Programming
Cut Rod
Unique Path
Unique Path II
Minimum Path Sum
Coins in a Line
Coin Change
Coin Change II
One Edit Distance
Edit Distance
The Pretty Printing Problem
Best Time to Buy and Sell Stock
Best Time to Buy and Sell Stock III
Best Time to Buy and Sell Stock IV
0-1 Knapsack
Weighted Job Scheduling
Compute the Binomial Coefficients
Find the Minimum Weight Path in Triangle
Divide and Conquer
Pow(x, n)
DFS
Number of Island
Connected Cell in a Grid
Longest Increasing Path in a Matrix
Transform One String to Another
Deadlock Detection
Paint a Boolean Matrix
Find the Shortest Unique Prefix
Backtrack
Path Sum II
Word Search
Combination Sum
Combination Sum II
N Queens
N Queens II
Restore IP Addresses
Sudoku Solver
Validate Sudoku
Generate all Subsets of Size K
Generate Binary Trees
BFS
Surrounded Regions
Word Ladder
Word Ladder II
Primitive types
Greatest Common Divider
Enumerate all primes to n
Reverse Integer
Swap Bits
Reverse Bits
Rectangle Intersection
Count Bits of 1
Palindrome Number
Single Number
Single Number II
Poor Pigs
Power of Two
Power of Three
Power of Four
Others
String Chains
Friend Circles
Frog Jump Time
Length of the Longest Consecutive 1s
Docker Build Order
Docker Build Order II
The Painter's Partition Problem
Village and Post Office
Nuclear Rods
Circular Buffer Design
Union Find
Tokens Operations
Random Iterator Mod 5
Geometric
Convex Hull
Clockwise Check of Three Points
Check if Two Line Intersect
Check if a Point Inside a Polygon
Closest Pair of Points
Temporary
Design Pattern
Singleton
Factory Method
Factory Method II
Abstract Factory
Adapter
Decorator
Strategy
Observer
Powered by
GitBook
The Pretty Printing Problem
The Pretty Printing Problem
Description:
Example:
Note
Idea:
Code:
Code
results matching "
"
No results matching "
"