Page Index - ALawliet/algorithms GitHub Wiki
1111 page(s) in this GitHub Wiki:
- Home
- Dynamic Programming
- Backtracking
- Trees
- Graphs
- **Combo Lists
- Please reload this page
- **Companies
- Please reload this page
- **Discipline
- Please reload this page
- **Pattern Map
- Please reload this page
- **Python
- Please reload this page
- **System Design
- Please reload this page
- **Templates
- Please reload this page
- *Binary Search
- Please reload this page
- *Cyclic Sort
- Please reload this page
- *Dynamic Programming
- Please reload this page
- *Merge Sort
- Please reload this page
- *Tree Traversals
- Please reload this page
- LC 0001 [E] Two Sum 2Sum
- Please reload this page
- LC 0002 [M] Add Two Numbers
- Please reload this page
- LC 0003 [M] Longest Substring Without Repeating Characters
- Please reload this page
- LC 0004 [H] Median of Two Sorted Arrays
- Please reload this page
- LC 0005 [M] Longest Palindromic Substring
- Please reload this page
- LC 0007 [M] Reverse Integer
- Please reload this page
- LC 0008 [M] String to Integer (atoi)
- Please reload this page
- LC 0009 [E] Palindrome Number
- Please reload this page
- LC 0010 [H] Regular Expression Matching
- Please reload this page
- LC 0011 [M] Container With Most Water
- Please reload this page
- LC 0013 [E] Roman to Integer
- Please reload this page
- LC 0014 [E] Longest Common Prefix
- Please reload this page
- LC 0015 [M] 3Sum
- Please reload this page
- LC 0016 [M] 3Sum Closest
- Please reload this page
- LC 0017 [M] Letter Combinations of a Phone Number
- Please reload this page
- LC 0018 [M] 4Sum
- Please reload this page
- LC 0019 [M] Remove Nth Node From End of List
- Please reload this page
- LC 0020 [E] Valid Parentheses
- Please reload this page
- LC 0021 [E] Merge Two Sorted Lists
- Please reload this page
- LC 0022 [M] Generate Parentheses
- Please reload this page
- LC 0023 [H] Merge k Sorted Lists
- Please reload this page
- LC 0024 [M] Swap Nodes in Pairs
- Please reload this page
- LC 0025 [H] Reverse Nodes in k Group
- Please reload this page
- LC 0026 [E] Remove Duplicates from Sorted Array
- Please reload this page
- LC 0027 [E] Remove Element
- Please reload this page
- LC 0028 [E] Implement strStr()
- Please reload this page
- LC 0029 [M] Divide Two Integers
- Please reload this page
- LC 0030 [H] Substring with Concatenation of All Words
- Please reload this page
- LC 0031 [M] Next Permutation
- Please reload this page
- LC 0032 [H] Longest Valid Parentheses
- Please reload this page
- LC 0033 [M] Search in Rotated Sorted Array
- Please reload this page
- LC 0034 [M] Find First and Last Position of Element in Sorted Array
- Please reload this page
- LC 0035 [E] Search Insert Position
- Please reload this page
- LC 0036 [M] Valid Sudoku
- Please reload this page
- LC 0037 [H] Sudoku Solver
- Please reload this page
- LC 0038 [M] Count and Say
- Please reload this page
- LC 0039 0040 0216 0377 [M] [M] [M] [M] Combination Sum (Subset Sum) I II III IV
- Please reload this page
- LC 0041 [H] First Missing Positive
- Please reload this page
- LC 0042 [H] Trapping Rain Water
- Please reload this page
- LC 0043 [M] Multiply Strings
- Please reload this page
- LC 0044 [H] Wildcard Matching
- Please reload this page
- LC 0045 [M] Jump Game II
- Please reload this page
- LC 0046 0047 [M] [M] Permutations I II
- Please reload this page
- LC 0048 [M] Rotate Image
- Please reload this page
- LC 0049 [M] Group Anagrams
- Please reload this page
- LC 0050 [M] Pow(x, n)
- Please reload this page
- LC 0051 [H] N Queens
- Please reload this page
- LC 0053 [E] Maximum Subarray
- Please reload this page
- LC 0054 [M] Spiral Matrix
- Please reload this page
- LC 0055 [M] Jump Game
- Please reload this page
- LC 0056 [M] Merge Intervals
- Please reload this page
- LC 0057 [M] Insert Interval
- Please reload this page
- LC 0059 [M] Spiral Matrix II
- Please reload this page
- LC 0061 [M] Rotate List
- Please reload this page
- LC 0062 [M] Unique Paths
- Please reload this page
- LC 0063 [M] Unique Paths II
- Please reload this page
- LC 0064 [M] Minimum Path Sum
- Please reload this page
- LC 0065 [H] Valid Number
- Please reload this page
- LC 0066 [E] Plus One
- Please reload this page
- LC 0067 [E] Add Binary
- Please reload this page
- LC 0068 [H] Text Justification
- Please reload this page
- LC 0069 [E] Sqrt(x)
- Please reload this page
- LC 0070 [E] Climbing Stairs
- Please reload this page
- LC 0071 [M] Simplify Path
- Please reload this page
- LC 0072 [H] Edit Distance (Levenshtein Distance)
- Please reload this page
- LC 0073 [M] Set Matrix Zeroes
- Please reload this page
- LC 0074 [M] Search a 2D Matrix
- Please reload this page
- LC 0075 [M] Sort Colors (Dutch National Flag Partition)
- Please reload this page
- LC 0076 [H] Minimum Window Substring
- Please reload this page
- LC 0077 [M] Combinations
- Please reload this page
- LC 0078 0090 [M] [M] Subsets I II
- Please reload this page
- LC 0079 [M] Word Search
- Please reload this page
- LC 0081 [M] Search in Rotated Sorted Array II
- Please reload this page
- LC 0082 [M] Remove Duplicates from Sorted List II
- Please reload this page
- LC 0083 [E] Remove Duplicates from Sorted List
- Please reload this page
- LC 0084 [H] Largest Rectangle in Histogram
- Please reload this page
- LC 0088 [E] Merge Sorted Array
- Please reload this page
- LC 0091 [M] Decode Ways
- Please reload this page
- LC 0092 [M] Reverse Linked List II
- Please reload this page
- LC 0093 [M] Restore IP Addresses
- Please reload this page
- LC 0095 [M] Unique Binary Search Trees II
- Please reload this page
- LC 0096 [M] Unique Binary Search Trees
- Please reload this page
- LC 0097 [M] Interleaving String
- Please reload this page
- LC 0098 [M] Validate Binary Search Tree
- Please reload this page
- LC 0100 [E] Same Tree
- Please reload this page
- LC 0101 [E] Symmetric Tree
- Please reload this page
- LC 0102 [M] Binary Tree Level Order Traversal
- Please reload this page
- LC 0103 [M] Binary Tree Zigzag Level Order Traversal
- Please reload this page
- LC 0104 [E] Maximum Depth of Binary Tree
- Please reload this page
- LC 0105 [M] Construct Binary Tree from Preorder and Inorder Traversal
- Please reload this page
- LC 0107 [E] Binary Tree Level Order Traversal II
- Please reload this page
- LC 0107 [M] Binary Tree Level Order Traversal II
- Please reload this page
- LC 0108 [E] Convert Sorted Array to Binary Search Tree
- Please reload this page
- LC 0109 [M] Convert Sorted List to Binary Search Tree
- Please reload this page
- LC 0110 [E] Balanced Binary Tree
- Please reload this page
- LC 0111 [E] Minimum Depth of Binary Tree
- Please reload this page
- LC 0112 [E] Path Sum
- Please reload this page
- LC 0113 [M] Path Sum II
- Please reload this page
- LC 0114 [M] Flatten Binary Tree to Linked List
- Please reload this page
- LC 0115 [H] Distinct Subsequences
- Please reload this page
- LC 0116 [M] Populating Next Right Pointers in Each Node
- Please reload this page
- LC 0117 [M] Populating Next Right Pointers in Each Node II
- Please reload this page
- LC 0121 0122 0714 0309 0123 0188 [E] [E] [M] [M] [H] [H] Best Time to Buy and Sell Stock I, II, Transaction Fee, Cooldown, III, IV
- Please reload this page
- LC 0124 [H] Binary Tree Maximum Path Sum
- Please reload this page
- LC 0125 0680 [E] [E] Valid Palindrome I II
- Please reload this page
- LC 0126 [H] Word Ladder II
- Please reload this page
- LC 0127 [H] Word Ladder
- Please reload this page
- LC 0128 [M] Longest Consecutive Sequence
- Please reload this page
- LC 0129 [M] Sum Root to Leaf Numbers
- Please reload this page
- LC 0130 [M] Surrounded Regions
- Please reload this page
- LC 0131 [M] Palindrome Partitioning
- Please reload this page
- LC 0133 [M] Clone Graph
- Please reload this page
- LC 0134 [M] Gas Station
- Please reload this page
- LC 0136 [E] Single Number
- Please reload this page
- LC 0138 [M] Copy List with Random Pointer
- Please reload this page
- LC 0139 [M] Word Break
- Please reload this page
- LC 0140 [H] Word Break II
- Please reload this page
- LC 0141 [E] Linked List Cycle
- Please reload this page
- LC 0142 [M] Linked List Cycle II
- Please reload this page
- LC 0143 [M] Reorder List
- Please reload this page
- LC 0144 [M] Binary Tree Preorder Traversal
- Please reload this page
- LC 0145 [H] Binary Tree Postorder Traversal
- Please reload this page
- LC 0146 [M] LRU Cache
- Please reload this page
- LC 0148 [M] Sort List
- Please reload this page
- LC 0150 [M] Evaluate Reverse Polish Notation
- Please reload this page
- LC 0151 [M] Reverse Words in a String
- Please reload this page
- LC 0152 [M] Maximum Product Subarray
- Please reload this page
- LC 0153 [M] Find Minimum in Rotated Sorted Array
- Please reload this page
- LC 0154 [H] Find Minimum in Rotated Sorted Array II
- Please reload this page
- LC 0155 [E] Min Stack
- Please reload this page
- LC 0157 [E] Read N Characters Given Read4
- Please reload this page
- LC 0158 [H] Read N Characters Given Read4 II Call multiple times
- Please reload this page
- LC 0159 [M] Longest Substring with At Most Two Distinct Characters
- Please reload this page
- LC 0160 [E] Intersection of Two Linked Lists
- Please reload this page
- LC 0161 [M] One Edit Distance
- Please reload this page
- LC 0162 [M] Find Peak Element
- Please reload this page
- LC 0163 [E] Missing Ranges
- Please reload this page
- LC 0164 [H] Maximum Gap
- Please reload this page
- LC 0166 [M] Fraction to Recurring Decimal
- Please reload this page
- LC 0167 [E] Two Sum 2Sum II Input array is sorted
- Please reload this page
- LC 0168 [E] Excel Sheet Column Title
- Please reload this page
- LC 0169 [E] Majority Element
- Please reload this page
- LC 0171 [E] Excel Sheet Column Number
- Please reload this page
- LC 0173 [M] Binary Search Tree Iterator
- Please reload this page
- LC 0174 [H] Dungeon Game
- Please reload this page
- LC 0179 [M] Largest Number
- Please reload this page
- LC 0189 [M] Rotate Array
- Please reload this page
- LC 0190 [E] Reverse Bits
- Please reload this page
- LC 0191 [E] Number of 1 Bits
- Please reload this page
- LC 0198 [E] House Robber
- Please reload this page
- LC 0199 [M] Binary Tree Right Side View
- Please reload this page
- LC 0200 [M] Number of Islands
- Please reload this page
- LC 0202 [E] Happy Number
- Please reload this page
- LC 0203 [E] Remove Linked List Elements
- Please reload this page
- LC 0206 [E] Reverse Linked List
- Please reload this page
- LC 0207 0210 [M] [M] Course Schedule I, II
- Please reload this page
- LC 0208 [M] Implement Trie (Prefix Tree)
- Please reload this page
- LC 0209 [M] Minimum Size Subarray Sum
- Please reload this page
- LC 0211 [M] Design Add and Search Words Data Structure
- Please reload this page
- LC 0212 [H] Word Search II
- Please reload this page
- LC 0213 [M] House Robber II
- Please reload this page
- LC 0215 [M] Kth Largest Element in an Array
- Please reload this page
- LC 0217 [E] Contains Duplicate
- Please reload this page
- LC 0219 [E] Contains Duplicate II
- Please reload this page
- LC 0221 [M] Maximal Square
- Please reload this page
- LC 0224 0227 0772 [H] [M] [H] Basic Calculator I II III
- Please reload this page
- LC 0226 [E] Invert Binary Tree
- Please reload this page
- LC 0228 [E] Summary Ranges
- Please reload this page
- LC 0230 [M] Kth Smallest Element in a BST
- Please reload this page
- LC 0232 [E] Implement Queue using Stacks
- Please reload this page
- LC 0235 [E] Lowest Common Ancestor of a Binary Search Tree
- Please reload this page
- LC 0236 [M] Lowest Common Ancestor of a Binary Tree (LCA)
- Please reload this page
- LC 0238 [M] Product of Array Except Self
- Please reload this page
- LC 0239 [H] Sliding Window Maximum
- Please reload this page
- LC 0240 [M] Search a 2D Matrix II
- Please reload this page
- LC 0241 [M] Different Ways to Add Parentheses
- Please reload this page
- LC 0242 [E] Valid Anagram
- Please reload this page
- LC 0243 [E] Shortest Word Distance
- Please reload this page
- LC 0246 [E] Strobogrammatic Number
- Please reload this page
- LC 0247 [M] Strobogrammatic Number II
- Please reload this page
- LC 0249 [M] Group Shifted Strings
- Please reload this page
- LC 0250 [M] Count Univalue Subtrees
- Please reload this page
- LC 0252 [E] Meeting Rooms
- Please reload this page
- LC 0253 [M] Meeting Rooms II
- Please reload this page
- LC 0257 [E] Binary Tree Paths
- Please reload this page
- LC 0259 [M] 3Sum Smaller
- Please reload this page
- LC 0261 [M] Graph Valid Tree
- Please reload this page
- LC 0263 [E] Ugly Number
- Please reload this page
- LC 0266 [E] Palindrome Permutation
- Please reload this page
- LC 0267 [M] Palindrome Permutation II
- Please reload this page
- LC 0268 [E] Missing Number
- Please reload this page
- LC 0269 [H] Alien Dictionary
- Please reload this page
- LC 0270 [E] Closest Binary Search Tree Value
- Please reload this page
- LC 0271 [M] Encode and Decode Strings
- Please reload this page
- LC 0273 [H] Integer to English Words
- Please reload this page
- LC 0274 [M] H Index
- Please reload this page
- LC 0277 [M] Find the Celebrity
- Please reload this page
- LC 0278 [E] First Bad Version
- Please reload this page
- LC 0279 [M] Perfect Squares
- Please reload this page
- LC 0282 [H] Expression Add Operators
- Please reload this page
- LC 0283 [E] Move Zeroes
- Please reload this page
- LC 0284 [M] Peeking Iterator
- Please reload this page
- LC 0285 [M] Inorder Successor in BST
- Please reload this page
- LC 0286 [M] Walls and Gates
- Please reload this page
- LC 0287 [M] Find the Duplicate Number
- Please reload this page
- LC 0295 [H] Find Median from Data Stream
- Please reload this page
- LC 0296 [H] Best Meeting Point
- Please reload this page
- LC 0297 [H] Serialize and Deserialize Binary Tree
- Please reload this page
- LC 0298 [M] Binary Tree Longest Consecutive Sequence
- Please reload this page
- LC 0299 [M] Bulls and Cows
- Please reload this page
- LC 0300 [M] Longest Increasing Subsequence (LIS)
- Please reload this page
- LC 0301 [H] Remove Invalid Parentheses
- Please reload this page
- LC 0303 [E] Range Sum Query Immutable
- Please reload this page
- LC 0304 [M] Range Sum Query 2D Immutable
- Please reload this page
- LC 0310 [M] Minimum Height Trees
- Please reload this page
- LC 0311 [M] Sparse Matrix Multiplication
- Please reload this page
- LC 0312 [H] Burst Balloons
- Please reload this page
- LC 0316 [M] Remove Duplicate Letters
- Please reload this page
- LC 0317 [H] Shortest Distance from All Buildings
- Please reload this page
- LC 0319 [M] Bulb Switcher
- Please reload this page
- LC 0320 [M] Generalized Abbreviation
- Please reload this page
- LC 0322 [M] Coin Change (min coins to make amount)
- Please reload this page
- LC 0323 [M] Number of Connected Components in an Undirected Graph
- Please reload this page
- LC 0325 [M] Maximum Size Subarray Sum Equals k
- Please reload this page
- LC 0327 [H] Count of Range Sum
- Please reload this page
- LC 0328 [M] Odd Even Linked List
- Please reload this page
- LC 0329 [H] Longest Increasing Path in a Matrix
- Please reload this page
- LC 0332 [H] Reconstruct Itinerary
- Please reload this page
- LC 0333 [M] Largest BST Subtree
- Please reload this page
- LC 0334 [M] Increasing Triplet Subsequence
- Please reload this page
- LC 0336 [H] Palindrome Pairs
- Please reload this page
- LC 0337 [M] House Robber III
- Please reload this page
- LC 0338 [E] Counting Bits
- Please reload this page
- LC 0339 [M] Nested List Weight Sum
- Please reload this page
- LC 0340 [M] Longest Substring with At Most K Distinct Characters
- Please reload this page
- LC 0341 [M] Flatten Nested List Iterator
- Please reload this page
- LC 0343 [M] Integer Break
- Please reload this page
- LC 0344 [E] Reverse String
- Please reload this page
- LC 0346 [E] Moving Average from Data Stream
- Please reload this page
- LC 0347 [M] Top K Frequent Elements
- Please reload this page
- LC 0348 [M] Design Tic Tac Toe
- Please reload this page
- LC 0349 [E] Intersection of Two Arrays
- Please reload this page
- LC 0350 [E] Intersection of Two Arrays II
- Please reload this page
- LC 0355 [M] Design Twitter
- Please reload this page
- LC 0358 [H] Rearrange String k Distance Apart
- Please reload this page
- LC 0362 [M] Design Hit Counter
- Please reload this page
- LC 0366 [M] Find Leaves of Binary Tree
- Please reload this page
- LC 0367 [E] Valid Perfect Square
- Please reload this page
- LC 0371 [M] Sum of Two Integers
- Please reload this page
- LC 0373 [M] Find K Pairs with Smallest Sums
- Please reload this page
- LC 0378 [M] Kth Smallest Element in a Sorted Matrix
- Please reload this page
- LC 0380 [M] Insert Delete GetRandom O(1)
- Please reload this page
- LC 0381 [H] Insert Delete GetRandom O(1) Duplicates allowed
- Please reload this page
- LC 0383 [E] Ransom Note
- Please reload this page
- LC 0384 [M] Shuffle an Array
- Please reload this page
- LC 0387 [E] First Unique Character in a String
- Please reload this page
- LC 0394 [M] Decode String
- Please reload this page
- LC 0398 [M] Random Pick Index
- Please reload this page
- LC 0399 [M] Evaluate Division
- Please reload this page
- LC 0402 [M] Remove K Digits
- Please reload this page
- LC 0406 [M] Queue Reconstruction by Height
- Please reload this page
- LC 0408 [E] Valid Word Abbreviation
- Please reload this page
- LC 0409 [E] Longest Palindrome
- Please reload this page
- LC 0410 [H] Split Array Largest Sum
- Please reload this page
- LC 0412 [E] Fizz Buzz
- Please reload this page
- LC 0415 [E] Add Strings
- Please reload this page
- LC 0416 [M] Partition Equal Subset Sum
- Please reload this page
- LC 0417 [M] Pacific Atlantic Water Flow
- Please reload this page
- LC 0419 [M] Battleships in a Board
- Please reload this page
- LC 0421 [M] Maximum XOR of Two Numbers in an Array
- Please reload this page
- LC 0424 [M] Longest Repeating Character Replacement
- Please reload this page
- LC 0425 [H] Word Squares
- Please reload this page
- LC 0426 [M] Convert Binary Search Tree to Sorted Doubly Linked List
- Please reload this page
- LC 0429 [M] N ary Tree Level Order Traversal
- Please reload this page
- LC 0435 [M] Non overlapping Intervals
- Please reload this page
- LC 0436 [M] Find Right Interval
- Please reload this page
- LC 0437 [M] Path Sum III
- Please reload this page
- LC 0438 [M] Find All Anagrams in a String
- Please reload this page
- LC 0442 [M] Find All Duplicates in an Array
- Please reload this page
- LC 0443 [M] String Compression
- Please reload this page
- LC 0444 [M] Sequence Reconstruction
- Please reload this page
- LC 0448 [M] Find All Numbers Disappeared in an Array
- Please reload this page
- LC 0450 [M] Delete Node in a BST
- Please reload this page
- LC 0451 [M] Sort Characters By Frequency
- Please reload this page
- LC 0452 [M] Minimum Number of Arrows to Burst Balloons
- Please reload this page
- LC 0454 [M] 4Sum II
- Please reload this page
- LC 0463 [E] Island Perimeter
- Please reload this page
- LC 0468 [M] Validate IP Address
- Please reload this page
- LC 0472 [H] Concatenated Words
- Please reload this page
- LC 0480 [H] Sliding Window Median
- Please reload this page
- LC 0489 [H] Robot Room Cleaner
- Please reload this page
- LC 0490 [M] The Maze
- Please reload this page
- LC 0494 [M] Target Sum
- Please reload this page
- LC 0496 [E] Next Greater Element I
- Please reload this page
- LC 0498 [M] Diagonal Traverse
- Please reload this page
- LC 0502 [H] IPO
- Please reload this page
- LC 0503 [M] Next Greater Element II
- Please reload this page
- LC 0509 [E] Fibonacci Number
- Please reload this page
- LC 0510 [M] Inorder Successor in BST II
- Please reload this page
- LC 0515 [M] Find Largest Value in Each Tree Row
- Please reload this page
- LC 0516 [M] Longest Palindromic Subsequence
- Please reload this page
- LC 0518 [M] Coin Change II 2 (num ways to make amount)
- Please reload this page
- LC 0523 [M] Continuous Subarray Sum
- Please reload this page
- LC 0525 [M] Contiguous Array
- Please reload this page
- LC 0528 [M] Random Pick with Weight
- Please reload this page
- LC 0529 [M] Minesweeper
- Please reload this page
- LC 0536 [M] Construct Binary Tree from String
- Please reload this page
- LC 0540 [M] Single Element in a Sorted Array
- Please reload this page
- LC 0542 [M] 01 Matrix
- Please reload this page
- LC 0543 [E] Diameter of Binary Tree
- Please reload this page
- LC 0545 [M] Boundary of Binary Tree
- Please reload this page
- LC 0556 [M] Next Greater Element III
- Please reload this page
- LC 0557 [E] Reverse Words in a String III
- Please reload this page
- LC 0560 [M] Subarray Sum Equals K
- Please reload this page
- LC 0567 [M] Permutation in String
- Please reload this page
- LC 0572 [E] Subtree of Another Tree
- Please reload this page
- LC 0581 [M] Shortest Unsorted Continuous Subarray
- Please reload this page
- LC 0583 [M] Delete Operation for Two Strings
- Please reload this page
- LC 0588 [H] Design In Memory File System
- Please reload this page
- LC 0597 [E] Friend Requests I: Overall Acceptance Rate
- Please reload this page
- LC 0605 [E] Can Place Flowers
- Please reload this page
- LC 0610 [E] Triangle Judgement
- Please reload this page
- LC 0616 [M] Add Bold Tag in String
- Please reload this page
- LC 0617 [E] Merge Two Binary Trees
- Please reload this page
- LC 0621 [M] Task Scheduler
- Please reload this page
- LC 0622 [M] Design Circular Queue
- Please reload this page
- LC 0630 [H] Course Schedule III
- Please reload this page
- LC 0632 [H] Smallest Range Covering Elements from K Lists
- Please reload this page
- LC 0636 [M] Exclusive Time of Functions
- Please reload this page
- LC 0637 [E] Average of Levels in Binary Tree
- Please reload this page
- LC 0642 [H] Design Search Autocomplete System
- Please reload this page
- LC 0643 [E] Maximum Average Subarray I
- Please reload this page
- LC 0645 [E] Set Mismatch
- Please reload this page
- LC 0647 [M] Palindromic Substrings
- Please reload this page
- LC 0648 [M] Replace Words
- Please reload this page
- LC 0654 [M] Maximum Binary Tree
- Please reload this page
- LC 0658 [M] Find K Closest Elements
- Please reload this page
- LC 0661 [E] Image Smoother
- Please reload this page
- LC 0662 [M] Maximum Width of Binary Tree
- Please reload this page
- LC 0669 [M] Trim a Binary Search Tree
- Please reload this page
- LC 0670 [M] Maximum Swap
- Please reload this page
- LC 0673 [M] Number of Longest Increasing Subsequence
- Please reload this page
- LC 0674 [E] Longest Continuous Increasing Subsequence
- Please reload this page
- LC 0676 [M] Implement Magic Dictionary
- Please reload this page
- LC 0678 [M] Valid Parenthesis String
- Please reload this page
- LC 0684 [M] Redundant Connection
- Please reload this page
- LC 0689 [H] Maximum Sum of 3 Non Overlapping Subarrays
- Please reload this page
- LC 0691 [H] Stickers to Spell Word
- Please reload this page
- LC 0692 [M] Top K Frequent Words
- Please reload this page
- LC 0694 [M] Number of Distinct Islands
- Please reload this page
- LC 0695 [M] Max Area of Island
- Please reload this page
- LC 0698 [M] Partition to K Equal Sum Subsets
- Please reload this page
- LC 0702 [M] Search in a Sorted Array of Unknown Size
- Please reload this page
- LC 0703 [E] Kth Largest Element in a Stream
- Please reload this page
- LC 0706 [E] Design HashMap
- Please reload this page
- LC 0708 [M] Insert into a Sorted Circular Linked List
- Please reload this page
- LC 0713 [M] Subarray Product Less Than K
- Please reload this page
- LC 0714 [E] Binary Search
- Please reload this page
- LC 0716 [E] Max Stack
- Please reload this page
- LC 0719 [H] Find K th Smallest Pair Distance
- Please reload this page
- LC 0720 [M] Longest Word in Dictionary
- Please reload this page
- LC 0721 [M] Accounts Merge
- Please reload this page
- LC 0723 [M] Candy Crush
- Please reload this page
- LC 0724 [M] Find Pivot Index
- Please reload this page
- LC 0730 [H] Count Different Palindromic Subsequences
- Please reload this page
- LC 0733 [E] Flood Fill
- Please reload this page
- LC 0735 [M] Asteroid Collision
- Please reload this page
- LC 0739 [M] Daily Temperatures
- Please reload this page
- LC 0740 [M] Delete and Earn
- Please reload this page
- LC 0742 [M] Closest Leaf in a Binary Tree
- Please reload this page
- LC 0743 [M] Network Delay Time
- Please reload this page
- LC 0744 [E] Find Smallest Letter Greater Than Target
- Please reload this page
- LC 0745 [H] Prefix and Suffix Search
- Please reload this page
- LC 0746 [E] Min Cost Climbing Stairs
- Please reload this page
- LC 0752 [M] Open the Lock
- Please reload this page
- LC 0759 [H] Employee Free Time
- Please reload this page
- LC 0763 [M] Partition Labels
- Please reload this page
- LC 0766 [E] Toeplitz Matrix
- Please reload this page
- LC 0767 [M] Reorganize String
- Please reload this page
- LC 0778 [H] Swim in Rising Water
- Please reload this page
- LC 0784 [M] Letter Case Permutation
- Please reload this page
- LC 0785 [M] Is Graph Bipartite?
- Please reload this page
- LC 0787 [M] Cheapest Flights Within K Stops
- Please reload this page
- LC 0788 [M] Rotated Digits
- Please reload this page
- LC 0791 [M] Custom Sort String
- Please reload this page
- LC 0814 [M] Binary Tree Pruning
- Please reload this page
- LC 0815 [H] Bus Routes
- Please reload this page
- LC 0824 [E] Goat Latin
- Please reload this page
- LC 0825 [M] Friends Of Appropriate Ages
- Please reload this page
- LC 0827 [H] Making A Large Island
- Please reload this page
- LC 0828 [H] Count Unique Characters of All Substrings of a Given String
- Please reload this page
- LC 0844 [E] Backspace String Compare
- Please reload this page
- LC 0846 [M] Hand of Straights
- Please reload this page
- LC 0852 [E] Peak Index in a Mountain Array
- Please reload this page
- LC 0853 [M] Car Fleet
- Please reload this page
- LC 0859 [E] Buddy Strings
- Please reload this page
- LC 0862 [H] Shortest Subarray with Sum at Least K
- Please reload this page
- LC 0863 [M] All Nodes Distance K in Binary Tree
- Please reload this page
- LC 0865 [M] Smallest Subtree with all the Deepest Nodes
- Please reload this page
- LC 0875 [M] Koko Eating Bananas
- Please reload this page
- LC 0876 [E] Middle of the Linked List
- Please reload this page
- LC 0886 [M] Possible Bipartition
- Please reload this page
- LC 0895 [H] Maximum Frequency Stack
- Please reload this page
- LC 0896 [E] Monotonic Array
- Please reload this page
- LC 0897 [E] Increasing Order Search Tree
- Please reload this page
- LC 0904 [M] Fruit Into Baskets
- Please reload this page
- LC 0909 [M] Snakes and Ladders
- Please reload this page
- LC 0919 [M] Complete Binary Tree Inserter
- Please reload this page
- LC 0921 [M] Minimum Add to Make Parentheses Valid
- Please reload this page
- LC 0932 [M] Beautiful Array
- Please reload this page
- LC 0934 [M] Shortest Bridge
- Please reload this page
- LC 0935 [M] Knight Dialer
- Please reload this page
- LC 0938 [E] Range Sum of BST
- Please reload this page
- LC 0939 [M] Minimum Area Rectangle
- Please reload this page
- LC 0951 [M] Flip Equivalent Binary Trees
- Please reload this page
- LC 0953 [E] Verifying an Alien Dictionary
- Please reload this page
- LC 0958 [M] Check Completeness of a Binary Tree
- Please reload this page
- LC 0963 [M] Minimum Area Rectangle II
- Please reload this page
- LC 0973 [M] K Closest Points to Origin
- Please reload this page
- LC 0974 [M] Subarray Sums Divisible by K
- Please reload this page
- LC 0977 [E] Squares of a Sorted Array
- Please reload this page
- LC 0979 [M] Distribute Coins in Binary Tree
- Please reload this page
- LC 0980 [H] Unique Paths III
- Please reload this page
- LC 0981 [M] Time Based Key Value Store
- Please reload this page
- LC 0983 [M] Minimum Cost For Tickets
- Please reload this page
- LC 0986 [M] Interval List Intersections
- Please reload this page
- LC 0987 0314 [H] [M] Vertical Order Traversal of a Binary Tree, Binary Tree Vertical Order Traversal
- Please reload this page
- LC 0989 [E] Add to Array Form of Integer
- Please reload this page
- LC 0993 [E] Cousins in Binary Tree
- Please reload this page
- LC 0994 [M] Rotting Oranges
- Please reload this page
- LC 0995 [H] Minimum Number of K Consecutive Bit Flips
- Please reload this page
- LC 1004 [M] Max Consecutive Ones III
- Please reload this page
- LC 1008 [M] Construct Binary Search Tree from Preorder Traversal
- Please reload this page
- LC 1011 [M] Capacity To Ship Packages Within D Days
- Please reload this page
- LC 1026 [M] Maximum Difference Between Node and Ancestor
- Please reload this page
- LC 1029 [M] Two City Scheduling
- Please reload this page
- LC 1034 [M] Coloring A Border
- Please reload this page
- LC 1038 0538 [M] [M] Binary Search Tree to Greater Sum Tree, Convert BST to Greater Tree
- Please reload this page
- LC 1046 [E] Last Stone Weight
- Please reload this page
- LC 1047 [E] Remove All Adjacent Duplicates In String
- Please reload this page
- LC 1048 [M] Longest String Chain
- Please reload this page
- LC 1053 [M] Previous Permutation With One Swap
- Please reload this page
- LC 1055 [M] Shortest Way to Form String
- Please reload this page
- LC 1060 [M] Missing Element in Sorted Array
- Please reload this page
- LC 1065 [E] Index Pairs of a String
- Please reload this page
- LC 1091 [M] Shortest Path in Binary Matrix
- Please reload this page
- LC 1094 [M] Car Pooling
- Please reload this page
- LC 1099 [E] Two Sum Less Than K
- Please reload this page
- LC 1102 [M] Path With Maximum Minimum Value
- Please reload this page
- LC 1104 [M] Path In Zigzag Labelled Binary Tree
- Please reload this page
- LC 1108 [E] Defanging an IP Address
- Please reload this page
- LC 1110 [M] Delete Nodes And Return Forest
- Please reload this page
- LC 1123 [M] Lowest Common Ancestor of Deepest Leaves
- Please reload this page
- LC 1141 [E] User Activity for the Past 30 Days I
- Please reload this page
- LC 1143 [M] Longest Common Subsequence
- Please reload this page
- LC 1161 [M] Maximum Level Sum of a Binary Tree
- Please reload this page
- LC 1192 [H] Critical Connections in a Network
- Please reload this page
- LC 1197 [M] Minimum Knight Moves
- Please reload this page
- LC 1203 [H] Sort Items by Groups Respecting Dependencies
- Please reload this page
- LC 1206 [H] Design Skiplist
- Please reload this page
- LC 1207 [E] Unique Number of Occurrences
- Please reload this page
- LC 1209 [M] Remove All Adjacent Duplicates in String II
- Please reload this page
- LC 1213 [E] Intersection of Three Sorted Arrays
- Please reload this page
- LC 1216 [H] Valid Palindrome III
- Please reload this page
- LC 1218 [M] Longest Arithmetic Subsequence of Given Difference
- Please reload this page
- LC 1233 [M] Remove Sub Folders from the Filesystem
- Please reload this page
- LC 1235 [H] Maximum Profit in Job Scheduling
- Please reload this page
- LC 1244 [M] Design A Leaderboard
- Please reload this page
- LC 1245 [M] Tree Diameter
- Please reload this page
- LC 1249 [M] Minimum Remove to Make Valid Parentheses
- Please reload this page
- LC 1265 [M] Print Immutable Linked List in Reverse
- Please reload this page
- LC 1268 [M] Search Suggestions System
- Please reload this page
- LC 1269 [H] Number of Ways to Stay in the Same Place After Some Steps
- Please reload this page
- LC 1275 [E] Find Winner on a Tic Tac Toe Game
- Please reload this page
- LC 1288 [M] Remove Covered Intervals
- Please reload this page
- LC 1293 [H] Shortest Path in a Grid with Obstacles Elimination
- Please reload this page
- LC 1299 [E] Replace Elements with Greatest Element on Right Side
- Please reload this page
- LC 1305 [M] All Elements in Two Binary Search Trees
- Please reload this page
- LC 1319 [M] Number of Operations to Make Network Connected
- Please reload this page
- LC 1326 [H] Minimum Number of Taps to Open to Water a Garden
- Please reload this page
- LC 1331 [E] Rank Transform of an Array
- Please reload this page
- LC 1340 [H] Jump Game V
- Please reload this page
- LC 1344 [M] Angle Between Hands of a Clock
- Please reload this page
- LC 1361 [M] Validate Binary Tree Nodes
- Please reload this page
- LC 1382 [M] Balance a Binary Search Tree
- Please reload this page
- LC 1395 [M] Count Number of Teams
- Please reload this page
- LC 1424 [M] Diagonal Traverse II
- Please reload this page
- LC 1428 [M] Leftmost Column with at Least a One
- Please reload this page
- LC 1429 [M] First Unique Number
- Please reload this page
- LC 1430 [M] Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
- Please reload this page
- LC 1443 [M] Minimum Time to Collect All Apples in a Tree
- Please reload this page
- LC 1448 [M] Count Good Nodes in Binary Tree
- Please reload this page
- LC 1460 [E] Make Two Arrays Equal by Reversing Sub arrays
- Please reload this page
- LC 1483 [H] Kth Ancestor of a Tree Node
- Please reload this page
- LC 1498 [M] Number of Subsequences That Satisfy the Given Sum Condition
- Please reload this page
- LC 1522 [M] Diameter of N Ary Tree
- Please reload this page
- LC 1539 [E] Kth Missing Positive Number
- Please reload this page
- LC 1541 [M] Minimum Insertions to Balance a Parentheses String
- Please reload this page
- LC 1554 [M] Strings Differ by One Character
- Please reload this page
- LC 1559 [M] Detect Cycles in 2D Grid
- Please reload this page
- LC 1570 [M] Dot Product of Two Sparse Vectors
- Please reload this page
- LC 1584 [M] Min Cost to Connect All Points
- Please reload this page
- LC 1588 [E] Sum of All Odd Length Subarrays
- Please reload this page
- LC 1614 [E] Maximum Nesting Depth of the Parentheses
- Please reload this page
- LC 1640 [E] Check Array Formation Through Concatenation
- Please reload this page
- LC 1644 [M] Lowest Common Ancestor of a Binary Tree II
- Please reload this page
- LC 1650 [M] Lowest Common Ancestor of a Binary Tree III
- Please reload this page
- LC 1721 [M] Swapping Nodes in a Linked List
- Please reload this page
- LC 1730 [M] Shortest Path to Get Food
- Please reload this page
- LC 1740 [M] Find Distance in a Binary Tree
- Please reload this page
- LC 1748 [E] Sum of Unique Elements
- Please reload this page
- LC 1762 [M] Buildings With an Ocean View
- Please reload this page
- LC 1789 [E] Primary Department for Each Employee
- Please reload this page
- LC 1832 [E] Check if the Sentence Is Pangram
- Please reload this page
- LC 1834 [M] Single Threaded CPU
- Please reload this page
- LC 1851 [H] Minimum Interval to Include Each Query
- Please reload this page
- LC 1865 [M] Finding Pairs With a Certain Sum
- Please reload this page
- LC 1868 [M] Product of Two Run Length Encoded Arrays
- Please reload this page
- LC 1891 [M] Cutting Ribbons
- Please reload this page
- LC 1899 [M] Merge Triplets to Form Target Triplet
- Please reload this page
- LC 1926 [M] Nearest Exit from Entrance in Maze
- Please reload this page
- LC 1944 [H] Number of Visible People in a Queue
- Please reload this page
- LC 1973 [M] Count Nodes Equal to Sum of Descendants
- Please reload this page
- LC 1985 [M] Find the Kth Largest Integer in the Array
- Please reload this page
- LC 1991 [E] Find the Middle Index in Array
- Please reload this page
- LC 2013 [M] Detect Squares
- Please reload this page
- LC 2019 [H] The Score of Students Solving Math Expression
- Please reload this page
- LC 2022 [E] Convert 1D Array Into 2D Array
- Please reload this page
- LC 2025 [H] Maximum Number of Ways to Partition an Array
- Please reload this page
- LC 2033 [M] Minimum Operations to Make a Uni Value Grid
- Please reload this page
- LC 2056 [H] Number of Valid Move Combinations On Chessboard
- Please reload this page
- LC 2060 [H] Check if an Original String Exists Given Two Encoded Strings
- Please reload this page
- LC 2071 [H] Maximum Number of Tasks You Can Assign
- Please reload this page
- LC 2076 [H] Process Restricted Friend Requests
- Please reload this page
- LC 2081 [H] Sum of k Mirror Numbers
- Please reload this page
- LC 2090 [M] K Radius Subarray Averages
- Please reload this page
- LC 2092 [H] Find All People With Secret
- Please reload this page
- LC 2096 [M] Step By Step Directions From a Binary Tree Node to Another
- Please reload this page
- LC [H] 1263 Minimum Moves to Move a Box to Their Target Location
- Please reload this page
- Palindrome Linked List
- Please reload this page
- Trie: Autocomplete
- Please reload this page