gitextract_k9u05cp_/

├── .gitignore
├── LICENSE
├── README.md
├── Solve the Equation.cpp
├── TODO
├── cpp/
│   ├── 001-010/
│   │   ├── Add Two Numbers.cpp
│   │   ├── Longest Palindromic Substring.cpp
│   │   ├── Longest Substring Without Repeating Characters.cpp
│   │   ├── Median of Two Sorted Arrays.cpp
│   │   ├── Palindrome Number.cpp
│   │   ├── Regular Expression Matching.cpp
│   │   ├── Reverse Integer.cpp
│   │   ├── String to Integer (atoi).cpp
│   │   ├── Two Sum.cpp
│   │   └── ZigZag Conversion.cpp
│   ├── 011-020/
│   │   ├── 3Sum Closest.cpp
│   │   ├── 3Sum.cpp
│   │   ├── 4Sum.cpp
│   │   ├── Container With Most Water.cpp
│   │   ├── Integer to Roman.cpp
│   │   ├── Letter Combinations of a Phone Number.cpp
│   │   ├── Longest Common Prefix.cpp
│   │   ├── Remove Nth Node From End of List.cpp
│   │   ├── Roman to Integer.cpp
│   │   └── Valid Parentheses.cpp
│   ├── 021-030/
│   │   ├── Divide Two Integers.cpp
│   │   ├── Generate Parentheses.cpp
│   │   ├── Implement strStr().cpp
│   │   ├── Merge Two Sorted Lists.cpp
│   │   ├── Merge k Sorted Lists.cpp
│   │   ├── Remove Duplicates from Sorted Array.cpp
│   │   ├── Remove Element.cpp
│   │   ├── Reverse Nodes in k-Group.cpp
│   │   ├── Substring with Concatenation of All Words.cpp
│   │   └── Swap Nodes in Pairs.cpp
│   ├── 031-040/
│   │   ├── Combination Sum II.cpp
│   │   ├── Combination Sum.cpp
│   │   ├── Count and Say.cpp
│   │   ├── Longest Valid Parentheses.cpp
│   │   ├── Next Permutation.cpp
│   │   ├── Search Insert Position.cpp
│   │   ├── Search for a Range.cpp
│   │   ├── Search in Rotated Sorted Array.cpp
│   │   ├── Sudoku Solver.cpp
│   │   └── Valid Sudoku.cpp
│   ├── 041-050/
│   │   ├── First Missing Positive.cpp
│   │   ├── Group Anagrams.cpp
│   │   ├── Jump Game II.cpp
│   │   ├── Multiply Strings.cpp
│   │   ├── Permutations II.cpp
│   │   ├── Permutations.cpp
│   │   ├── Pow.cpp
│   │   ├── Rotate Image.cpp
│   │   ├── Trapping Rain Water.cpp
│   │   └── Wildcard Matching.cpp
│   ├── 051-060/
│   │   ├── Insert Interval.cpp
│   │   ├── Jump Game.cpp
│   │   ├── Length of Last Word.cpp
│   │   ├── Maximum_Subarray.cpp
│   │   ├── Merge Intervals.cpp
│   │   ├── N-Queens II.cpp
│   │   ├── N-Queens.cpp
│   │   ├── Permutation Sequence.cpp
│   │   ├── Spiral Matrix II.cpp
│   │   └── Spiral Matrix.cpp
│   ├── 061-070/
│   │   ├── Add Binary.cpp
│   │   ├── Climbing Stairs.cpp
│   │   ├── Minimum Path Sum .cpp
│   │   ├── Plus One.cpp
│   │   ├── Rotate List.cpp
│   │   ├── Sqrt.cpp
│   │   ├── Text Justification.cpp
│   │   ├── Unique Paths II .cpp
│   │   ├── Unique Paths.cpp
│   │   └── Valid Number.cpp
│   ├── 071-080/
│   │   ├── Combinations.cpp
│   │   ├── Edit Distance.cpp
│   │   ├── Minimum Window Substring.cpp
│   │   ├── Remove Duplicates from Sorted Array II.cpp
│   │   ├── Search a 2D Matrix.cpp
│   │   ├── Set Matrix Zeroes.cpp
│   │   ├── Simplify Path.cpp
│   │   ├── Sort Colors.cpp
│   │   ├── Subsets.cpp
│   │   └── Word Search.cpp
│   ├── 081-090/
│   │   ├── Gray Code.cpp
│   │   ├── Largest Rectangle in Histogram.cpp
│   │   ├── Maximal Rectangle.cpp
│   │   ├── Merge Sorted Array.cpp
│   │   ├── Partition List.cpp
│   │   ├── Remove Duplicates from Sorted List II.cpp
│   │   ├── Remove Duplicates from Sorted List.cpp
│   │   ├── Scramble String.cpp
│   │   ├── Search in Rotated Sorted Array II.cpp
│   │   └── Subsets II.cpp
│   ├── 091-100/
│   │   ├── Binary Tree Inorder Traversal.cpp
│   │   ├── Decode Ways.cpp
│   │   ├── Interleaving String.cpp
│   │   ├── Recover Binary Search Tree.cpp
│   │   ├── Restore IP Addresses.cpp
│   │   ├── Reverse Linked List II.cpp
│   │   ├── Same Tree.cpp
│   │   ├── Unique Binary Search Trees II.cpp
│   │   ├── Unique Binary Search Trees.cpp
│   │   └── Validate Binary Search Tree.cpp
│   ├── 1001-10000/
│   │   ├── 1001-1010/
│   │   │   └── Construct Binary Search Tree from Preorder Traversal.cpp
│   │   ├── 1011-1020/
│   │   │   ├── Best Sightseeing Pair.cpp
│   │   │   ├── Binary Prefix Divisible By 5.cpp
│   │   │   ├── Binary String With Substrings Representing 1 To N.cpp
│   │   │   ├── Convert to Base -2.cpp
│   │   │   ├── Next Greater Node In Linked List.cpp
│   │   │   ├── Number of Enclaves.cpp
│   │   │   └── Partition Array Into Three Parts With Equal Sum.cpp
│   │   ├── 1021-1030/
│   │   │   ├── Camelcase Matching.cpp
│   │   │   ├── Divisor Game.cpp
│   │   │   ├── Longest Arithmetic Sequence.cpp
│   │   │   ├── Matrix Cells in Distance Order.cpp
│   │   │   ├── Maximum Difference Between Node and Ancestor.cpp
│   │   │   ├── Recover a Tree From Preorder Traversal.cpp
│   │   │   ├── Remove Outermost Parentheses.cpp
│   │   │   ├── Sum of Root To Leaf Binary Numbers.cpp
│   │   │   ├── Two City Scheduling.cpp
│   │   │   └── Video Stitching.cpp
│   │   ├── 1031-1040/
│   │   │   ├── Binary Search Tree to Greater Sum Tree.cpp
│   │   │   ├── Coloring A Border.cpp
│   │   │   ├── Escape a Large Maze.cpp
│   │   │   ├── Maximum Sum of Two Non-Overlapping Subarrays.cpp
│   │   │   ├── Minimum Score Triangulation of Polygon.cpp
│   │   │   ├── Moving Stones Until Consecutive.cpp
│   │   │   ├── Stream of Characters.cpp
│   │   │   ├── Uncrossed Lines.cpp
│   │   │   └── Valid Boomerang.cpp
│   │   ├── 1041-1050/
│   │   │   ├── Flower Planting With No Adjacent.cpp
│   │   │   ├── Last Stone Weight II.cpp
│   │   │   ├── Last Stone Weight.cpp
│   │   │   ├── Longest String Chain.cpp
│   │   │   ├── Partition Array for Maximum Sum.cpp
│   │   │   ├── Remove All Adjacent Duplicates In String.cpp
│   │   │   └── Robot Bounded In Circle.cpp
│   │   ├── 1051-1060/
│   │   │   ├── Distant Barcodes.cpp
│   │   │   ├── Grumpy Bookstore Owner.cpp
│   │   │   ├── Height Checker.cpp
│   │   │   └── Previous Permutation With One Swap.cpp
│   │   ├── 1071-1080/
│   │   │   ├── Adding Two Negabinary Numbers.cpp
│   │   │   ├── Flip Columns For Maximum Number of Equal Rows.cpp
│   │   │   ├── Greatest Common Divisor of Strings.cpp
│   │   │   ├── Insufficient Nodes in Root to Leaf Paths.cpp
│   │   │   ├── Letter Tile Possibilities.cpp
│   │   │   ├── Number of Submatrices That Sum to Target.cpp
│   │   │   └── Occurrences After Bigram.cpp
│   │   ├── 1081-1090/
│   │   │   ├── Duplicate Zeros.cpp
│   │   │   ├── Largest Values From Labels.cpp
│   │   │   └── Smallest Subsequence of Distinct Characters.cpp
│   │   ├── 1091-1100/
│   │   │   ├── Brace Expansion II.cpp
│   │   │   ├── Car Pooling.cpp
│   │   │   ├── Find in Mountain Array.cpp
│   │   │   ├── Shortest Common Supersequence.cpp
│   │   │   ├── Shortest Path in Binary Matrix.cpp
│   │   │   ├── Statistics from a Large Sample.cpp
│   │   │   └── Two Sum Less Than K.cpp
│   │   ├── 1101-1110/
│   │   │   ├── Corporate Flight Bookings.cpp
│   │   │   ├── Defanging an IP Address.cpp
│   │   │   ├── Delete Nodes And Return Forest.cpp
│   │   │   ├── Distribute Candies to People.cpp
│   │   │   ├── Filling Bookcase Shelves.cpp
│   │   │   ├── Parsing A Boolean Expression.cpp
│   │   │   └── Path In Zigzag Labelled Binary Tree.cpp
│   │   ├── 1111-1120/
│   │   │   ├── Maximum Nesting Depth of Two Valid Parentheses Strings.cpp
│   │   │   ├── Print FooBar Alternately.cpp
│   │   │   └── Print in Order.cpp
│   │   ├── 1121-1130/
│   │   │   ├── Lowest Common Ancestor of Deepest Leaves.cpp
│   │   │   ├── Minimum Cost Tree From Leaf Values.cpp
│   │   │   ├── Number of Equivalent Domino Pairs.cpp
│   │   │   ├── Relative Sort Array.cpp
│   │   │   └── Smallest Sufficient Team.cpp
│   │   ├── 1131-1140/
│   │   │   └── N-th Tribonacci Number.cpp
│   │   ├── 1141-1150/
│   │   │   ├── Binary Tree Coloring Game.cpp
│   │   │   ├── Decrease Elements To Make Array Zigzag.cpp
│   │   │   ├── Longest Chunked Palindrome Decomposition.cpp
│   │   │   ├── Longest Common Subsequence.cpp
│   │   │   └── Snapshot Array.cpp
│   │   ├── 1151-1160/
│   │   │   ├── Day of the Year.cpp
│   │   │   ├── Find Words That Can Be Formed by Characters.cpp
│   │   │   └── Number of Dice Rolls With Target Sum.cpp
│   │   ├── 1161-1170/
│   │   │   ├── As Far from Land as Possible.cpp
│   │   │   ├── Compare Strings by Frequency of the Smallest Character.cpp
│   │   │   ├── Design File System.cpp
│   │   │   ├── Invalid Transactions.cpp
│   │   │   ├── Maximum Level Sum of a Binary Tree.cpp
│   │   │   ├── Minimum Cost to Connect Sticks.cpp
│   │   │   ├── Optimize Water Distribution in a Village.cpp
│   │   │   └── Single-Row Keyboard.cpp
│   │   ├── 1171-1180/
│   │   │   ├── Can Make Palindrome from Substring.cpp
│   │   │   ├── Count Substrings with Only One Distinct Letter.cpp
│   │   │   ├── Diet Plan Performance.cpp
│   │   │   ├── Dinner Plate Stacks.cpp
│   │   │   ├── Prime Arrangements.cpp
│   │   │   └── Remove Zero Sum Consecutive Nodes from Linked List.cpp
│   │   ├── 1181-1190/
│   │   │   ├── Before and After Puzzle.cpp
│   │   │   ├── Day of the Week.cpp
│   │   │   ├── Design Bounded Blocking Queue.cpp
│   │   │   ├── Distance Between Bus Stops.cpp
│   │   │   ├── Make Array Strictly Increasing.cpp
│   │   │   ├── Maximum Subarray Sum with One Deletion.cpp
│   │   │   └── Shortest Distance to Target Color.cpp
│   │   ├── 1191-1200/
│   │   │   └── Minimum Knight Moves.cpp
│   │   ├── 1201-1210/
│   │   │   ├── Design Skiplist.cpp
│   │   │   └── Smallest String With Swaps.cpp
│   │   ├── 1221-1230/
│   │   │   ├── Dice Roll Simulation.cpp
│   │   │   ├── Queens That Can Attack the King.cpp
│   │   │   └── Split a String in Balanced Strings.cpp
│   │   ├── 1231-1240/
│   │   │   ├── Maximum Profit in Job Scheduling.cpp
│   │   │   └── Replace the Substring for Balanced String.cpp
│   │   ├── 1241-1250/
│   │   │   ├── Minimum Remove to Make Valid Parentheses.cpp
│   │   │   └── Web Crawler Multithreaded.cpp
│   │   ├── 1261-1270/
│   │   │   └── Greatest Sum Divisible by Three.cpp
│   │   ├── 1281-1290/
│   │   │   ├── Convert Binary Number in a Linked List to Integer.cpp
│   │   │   ├── Element Appearing More Than 25% In Sorted Array.cpp
│   │   │   └── Remove Covered Intervals.cpp
│   │   ├── 1291-1300/
│   │   │   ├── Maximum Side Length of a Square with Sum Less than or Equal to Threshold.cpp
│   │   │   └── Sequential Digits.cpp
│   │   ├── 1311-1320/
│   │   │   └── Minimum Distance to Type a Word Using Two Fingers.cpp
│   │   ├── 1411-1420/
│   │   │   └── Minimum Value to Get Positive Step by Step Sum.cpp
│   │   ├── 1421-1430/
│   │   │   └── Leftmost Column with at Least a One.cpp
│   │   ├── 1481-1490/
│   │   │   ├── Avoid Flood in The City.cpp
│   │   │   ├── Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree.cpp
│   │   │   ├── Making File Names Unique.cpp
│   │   │   └── XOR Operation in an Array.cpp
│   │   ├── 1501-1510/
│   │   │   └── Stone Game IV.cpp
│   │   ├── 1541-1550/
│   │   │   └── Minimum Insertions to Balance a Parentheses String.cpp
│   │   ├── 1561-1570/
│   │   │   └── Dot Product of Two Sparse Vectors.cpp
│   │   ├── 1621-1630/
│   │   │   ├── Arithmetic Subarrays.cpp
│   │   │   └── Slowest Key.cpp
│   │   ├── 1631-1640/
│   │   │   ├── Check Array Formation Through Concatenation.cpp
│   │   │   ├── Number of Ways to Form a Target String Given a Dictionary.cpp
│   │   │   ├── Path With Minimum Effort.cpp
│   │   │   └── Rank Transform of a Matrix.cpp
│   │   ├── 1641-1650/
│   │   │   ├── Count Sorted Vowel Strings.cpp
│   │   │   ├── Create Sorted Array through Instructions.cpp
│   │   │   ├── Furthest Building You Can Reach.cpp
│   │   │   ├── Get Maximum in Generated Array.cpp
│   │   │   ├── Kth Smallest Instructions.cpp
│   │   │   ├── Lowest Common Ancestor of a Binary Tree II.cpp
│   │   │   ├── Lowest Common Ancestor of a Binary Tree III.cpp
│   │   │   ├── Minimum Deletions to Make Character Frequencies Unique.cpp
│   │   │   └── Sell Diminishing-Valued Colored Balls.cpp
│   │   ├── 1671-1680/
│   │   │   ├── Lowest Common Ancestor of a Binary Tree IV.cpp
│   │   │   └── Minimum Moves to Make Array Complementary.cpp
│   │   ├── 1681-1690/
│   │   │   ├── Delivering Boxes from Storage to Ports.cpp
│   │   │   ├── Stone Game VI.cpp
│   │   │   └── Sum of Absolute Differences in a Sorted Array.cpp
│   │   ├── 1701-1710/
│   │   │   ├── Determine if String Halves Are Alike.cpp
│   │   │   ├── Maximum Number of Eaten Apples.cpp
│   │   │   ├── Maximum Units on a Truck.cpp
│   │   │   ├── Maximum XOR With an Element From Array.cpp
│   │   │   └── Where Will the Ball Fall.cpp
│   │   ├── 1711-1720/
│   │   │   ├── Count Good Meals.cpp
│   │   │   ├── Decode XORed Array.cpp
│   │   │   ├── Minimum Operations to Make a Subsequence.cpp
│   │   │   └── Ways to Split Array Into Three Subarrays.cpp
│   │   ├── 1721-1730/
│   │   │   ├── Find Minimum Time to Finish All Jobs.cpp
│   │   │   ├── Largest Submatrix With Rearrangements.cpp
│   │   │   ├── Minimize Hamming Distance After Swap Operations.cpp
│   │   │   ├── Number Of Rectangles That Can Form The Largest Square.cpp
│   │   │   ├── Swapping Nodes in a Linked List.cpp
│   │   │   └── Tuple with Same Product.cpp
│   │   ├── 1731-1740/
│   │   │   └── Building Boxes.cpp
│   │   ├── 1751-1760/
│   │   │   ├── Closest Subsequence Sum.cpp
│   │   │   ├── Largest Merge Of Two Strings.cpp
│   │   │   ├── Maximum Number of Events That Can Be Attended II.cpp
│   │   │   └── Minimum Limit of Balls in a Bag.cpp
│   │   ├── 1761-1770/
│   │   │   ├── Form Array by Concatenating Subarrays of Another Array.cpp
│   │   │   ├── Map of Highest Peak.cpp
│   │   │   ├── Maximum Score from Performing Multiplication Operations.cpp
│   │   │   ├── Minimum Degree of a Connected Trio in a Graph.cpp
│   │   │   └── Tree of Coprimes.cpp
│   │   ├── 1771-1780/
│   │   │   ├── Car Fleet II.cpp
│   │   │   ├── Check if Number is a Sum of Powers of Three.cpp
│   │   │   ├── Closest Dessert Cost.cpp
│   │   │   ├── Equal Sum Arrays With Minimum Number of Operations.cpp
│   │   │   ├── Find Nearest Point That Has the Same X or Y Coordinate.cpp
│   │   │   ├── Maximize Palindrome Length From Subsequences.cpp
│   │   │   └── Shortest Path in a Hidden Grid.cpp
│   │   ├── 1781-1790/
│   │   │   ├── Check if Binary String Has at Most One Segment of Ones.cpp
│   │   │   ├── Check if One String Swap Can Make Strings Equal.cpp
│   │   │   ├── Count Pairs Of Nodes.cpp
│   │   │   ├── Make the XOR of All Segments Equal to Zero.cpp
│   │   │   ├── Maximize the Beauty of the Garden.cpp
│   │   │   ├── Minimum Elements to Add to Form a Given Sum.cpp
│   │   │   ├── Number of Restricted Paths From First to Last Node.cpp
│   │   │   └── Sum of Beauty of All Substrings.cpp
│   │   ├── 1791-1800/
│   │   │   ├── Count Pairs of Equal Substrings With Minimum Difference.cpp
│   │   │   ├── Design Authentication Manager.cpp
│   │   │   ├── Find Center of Star Graph.cpp
│   │   │   ├── Maximize Score After N Operations.cpp
│   │   │   ├── Maximum Ascending Subarray Sum.cpp
│   │   │   ├── Maximum Average Pass Ratio.cpp
│   │   │   ├── Maximum Number of Consecutive Values You Can Make.cpp
│   │   │   ├── Maximum Score of a Good Subarray.cpp
│   │   │   └── Second Largest Digit in a String.cpp
│   │   ├── 1801-1810/
│   │   │   ├── Count Pairs With XOR in a Range.cpp
│   │   │   ├── Evaluate the Bracket Pairs of a String.cpp
│   │   │   ├── Implement Trie II (Prefix Tree).cpp
│   │   │   ├── Maximize Number of Nice Divisors.cpp
│   │   │   ├── Maximum Value at a Given Index in a Bounded Array.cpp
│   │   │   ├── Minimum Path Cost in a Hidden Grid.cpp
│   │   │   ├── Number of Different Integers in a String.cpp
│   │   │   └── Number of Orders in the Backlog.cpp
│   │   ├── 1811-1820/
│   │   │   ├── Count Nice Pairs in an Array.cpp
│   │   │   ├── Determine Color of a Chessboard Square.cpp
│   │   │   ├── Finding the Users Active Minutes.cpp
│   │   │   ├── Maximum Number of Accepted Invitations.cpp
│   │   │   ├── Maximum Number of Groups Getting Fresh Donuts.cpp
│   │   │   ├── Minimum Absolute Sum Difference.cpp
│   │   │   ├── Number of Different Subsequences GCDs.cpp
│   │   │   ├── Sentence Similarity III.cpp
│   │   │   └── Truncate Sentence.cpp
│   │   ├── 1821-1830/
│   │   │   ├── Faulty Sensor.cpp
│   │   │   ├── Finding MK Average.cpp
│   │   │   ├── Maximum XOR for Each Query.cpp
│   │   │   ├── Minimum Number of Operations to Make String Sorted.cpp
│   │   │   ├── Minimum Operations to Make the Array Increasing.cpp
│   │   │   ├── Minimum Sideway Jumps.cpp
│   │   │   ├── Queries on Number of Points Inside a Circle.cpp
│   │   │   └── Sign of the Product of an Array.cpp
│   │   ├── 1831-1840/
│   │   │   ├── Check if the Sentence Is Pangram.cpp
│   │   │   ├── Find XOR Sum of All Pairs Bitwise AND.cpp
│   │   │   ├── Longest Substring Of All Vowels in Order.cpp
│   │   │   ├── Maximum Building Height.cpp
│   │   │   ├── Maximum Ice Cream Bars.cpp
│   │   │   ├── Remove Duplicates From an Unsorted Linked List.cpp
│   │   │   ├── Single-Threaded CPU.cpp
│   │   │   └── Sum of Digits in Base K.cpp
│   │   ├── 1841-1850/
│   │   │   ├── Closest Room.cpp
│   │   │   └── Minimum Adjacent Swaps to Reach the Kth Smallest Number.cpp
│   │   └── 1851-1860/
│   │       └── Minimum Interval to Include Each Query.cpp
│   ├── 101-110/
│   │   ├── Balanced Binary Tree.cpp
│   │   ├── Binary Tree Level Order Traversal II.cpp
│   │   ├── Binary Tree Level Order Traversal.cpp
│   │   ├── Binary Tree Zigzag Level Order Traversal.cpp
│   │   ├── Construct Binary Tree from Inorder and Postorder Traversal.cpp
│   │   ├── Construct Binary Tree from Preorder and Inorder Traversal.cpp
│   │   ├── Convert Sorted Array to Binary Search Tree.cpp
│   │   ├── Convert Sorted List to Binary Search Tree.cpp
│   │   ├── Maximum Depth of Binary Tree.cpp
│   │   └── Symmetric Tree.cpp
│   ├── 111-120/
│   │   ├── Distinct Subsequences.cpp
│   │   ├── Flatten Binary Tree to Linked List.cpp
│   │   ├── Minimum Depth of Binary Tree.cpp
│   │   ├── Pascal's Triangle II.cpp
│   │   ├── Pascal's Triangle.cpp
│   │   ├── Path Sum II.cpp
│   │   ├── Path Sum.cpp
│   │   ├── Populating Next Right Pointers in Each Node II.cpp
│   │   ├── Populating Next Right Pointers in Each Node.cpp
│   │   └── Triangle.cpp
│   ├── 121-130/
│   │   ├── Best Time to Buy and Sell Stock II.cpp
│   │   ├── Best Time to Buy and Sell Stock III.cpp
│   │   ├── Best Time to Buy and Sell Stock.cpp
│   │   ├── Binary Tree Maximum Path Sum.cpp
│   │   ├── Longest Consecutive Sequence.cpp
│   │   ├── Sum Root to Leaf Numbers.cpp
│   │   ├── Surrounded Regions.cpp
│   │   ├── Valid Palindrome.cpp
│   │   ├── Word Ladder II.cpp
│   │   └── Word Ladder.cpp
│   ├── 131-140/
│   │   ├── Candy.cpp
│   │   ├── Clone Graph.cpp
│   │   ├── Copy List with Random Pointer.cpp
│   │   ├── Gas Station.cpp
│   │   ├── Palindrome Partitioning II.cpp
│   │   ├── Palindrome Partitioning.cpp
│   │   ├── Single Number II.cpp
│   │   ├── Single Number.cpp
│   │   ├── Word Break II.cpp
│   │   └── Word Break.cpp
│   ├── 141-150/
│   │   ├── Binary Tree Postorder Traversal.cpp
│   │   ├── Evaluate Reverse Polish Notation.cpp
│   │   ├── Insertion Sort List.cpp
│   │   ├── LRU Cache.cpp
│   │   ├── Linked List Cycle II.cpp
│   │   ├── Linked List Cycle.cpp
│   │   ├── Max Points on a Line.cpp
│   │   ├── Reorder List.cpp
│   │   ├── Sort List.cpp
│   │   └── Tree Preorder Traversal.cpp
│   ├── 151-160/
│   │   ├── Binary Tree Upside Down.cpp
│   │   ├── Find Minimum in Rotated Sorted Array II.cpp
│   │   ├── Find Minimum in Rotated Sorted Array.cpp
│   │   ├── Intersection of Two Linked Lists.cpp
│   │   ├── Longest Substring with At Most Two Distinct Characters.cpp
│   │   ├── Maximum Product Subarray.cpp
│   │   ├── Min Stack.cpp
│   │   ├── Read N Characters Given Read4 II - Call multiple times.cpp
│   │   ├── Read N Characters Given Read4.cpp
│   │   └── Reverse Words in a String.cpp
│   ├── 161-170/
│   │   ├── Compare Version Numbers.cpp
│   │   ├── Excel Sheet Column Title.cpp
│   │   ├── Find Peak Element.cpp
│   │   ├── Fraction to Recurring Decimal.cpp
│   │   ├── Majority Element.cpp
│   │   ├── Maximum Gap.cpp
│   │   ├── Missing Ranges.cpp
│   │   ├── One Edit Distance.cpp
│   │   ├── Two Sum II - Input array is sorted.cpp
│   │   └── Two Sum III - Data structure design.cpp
│   ├── 171-180/
│   │   ├── Binary Search Tree Iterator.cpp
│   │   ├── Dungeon Game.cpp
│   │   ├── Excel Sheet Column Number.cpp
│   │   ├── Factorial Trailing Zeroes.cpp
│   │   └── Largest Number.cpp
│   ├── 181-190/
│   │   ├── Best Time to Buy and Sell Stock IV.cpp
│   │   ├── Repeated DNA Sequences.cpp
│   │   ├── Reverse Bits.cpp
│   │   ├── Reverse Words in a String II.cpp
│   │   └── Rotate Array.cpp
│   ├── 191-200/
│   │   ├── Binary Tree Right Side View.cpp
│   │   ├── House Robber.cpp
│   │   ├── Number of 1 Bits.cpp
│   │   ├── Number of Islands.cpp
│   │   └── Reverse Bits.cpp
│   ├── 201-210/
│   │   ├── Bitwise AND of Numbers Range.cpp
│   │   ├── Count Primes.cpp
│   │   ├── Course Schedule II.cpp
│   │   ├── Course Schedule.cpp
│   │   ├── Happy Number.cpp
│   │   ├── Implement Trie (Prefix Tree).cpp
│   │   ├── Isomorphic Strings.cpp
│   │   ├── Minimum Size Subarray Sum.cpp
│   │   ├── Remove Linked List Elements.cpp
│   │   └── Reverse Linked List.cpp
│   ├── 211-220/
│   │   ├── Add and Search Word - Data structure design.cpp
│   │   ├── Combination Sum III.cpp
│   │   ├── Contains Duplicate II.cpp
│   │   ├── Contains Duplicate III.cpp
│   │   ├── Contains Duplicate.cpp
│   │   ├── House Robber II.cpp
│   │   ├── Kth Largest Element in an Array.cpp
│   │   ├── Shortest Palindrome.cpp
│   │   ├── The Skyline Problem.cpp
│   │   └── Word Search II.cpp
│   ├── 221-230/
│   │   ├── Basic Calculator II.cpp
│   │   ├── Basic Calculator.cpp
│   │   ├── Count Complete Tree Nodes.cpp
│   │   ├── Implement Stack using Queues.cpp
│   │   ├── Invert Binary Tree.cpp
│   │   ├── Kth Smallest Element in a BST.cpp
│   │   ├── Majority Element II.cpp
│   │   ├── Maximal Square.cpp
│   │   ├── Rectangle Area.cpp
│   │   └── Summary Ranges.cpp
│   ├── 231-240/
│   │   ├── Delete Node in a Linked List.cpp
│   │   ├── Implement Queue using Stacks.cpp
│   │   ├── Lowest Common Ancestor of a Binary Search Tree.cpp
│   │   ├── Lowest Common Ancestor of a Binary Tree.cpp
│   │   ├── Number of Digit One.cpp
│   │   ├── Palindrome Linked List.cpp
│   │   ├── Power of Two.cpp
│   │   ├── Product of Array Except Self.cpp
│   │   ├── Search a 2D Matrix II.cpp
│   │   └── Sliding Window Maximum.cpp
│   ├── 241-250/
│   │   ├── Count Univalue Subtrees.cpp
│   │   ├── Different Ways to Add Parentheses.cpp
│   │   ├── Group Shifted Strings.cpp
│   │   ├── Shortest Word Distance II.cpp
│   │   ├── Shortest Word Distance III.cpp
│   │   ├── Shortest Word Distance.cpp
│   │   ├── Strobogrammatic Number II.cpp
│   │   ├── Strobogrammatic Number III.cpp
│   │   ├── Strobogrammatic Number.cpp
│   │   └── Valid Anagram.cpp
│   ├── 251-260/
│   │   ├── 3Sum Smaller.cpp
│   │   ├── Add Digits.cpp
│   │   ├── Binary Tree Paths.cpp
│   │   ├── Factor Combinations.cpp
│   │   ├── Flatten 2D Vector.cpp
│   │   ├── Meeting Rooms II.cpp
│   │   ├── Meeting Rooms.cpp
│   │   ├── Paint House.cpp
│   │   ├── Single Number III.cpp
│   │   └── Verify Preorder Sequence in Binary Search Tree.cpp
│   ├── 261-270/
│   │   ├── Alien Dictionary.cpp
│   │   ├── Closest Binary Search Tree Value.cpp
│   │   ├── Factor Combinations.cpp
│   │   ├── Graph Valid Tree.cpp
│   │   ├── Missing Number.cpp
│   │   ├── Paint House II.cpp
│   │   ├── Palindrome Permutation II.cpp
│   │   ├── Palindrome Permutation.cpp
│   │   ├── Ugly Number II.cpp
│   │   └── Ugly Number.cpp
│   ├── 271-280/
│   │   ├── Closest Binary Search Tree Value II.cpp
│   │   ├── Encode and Decode Strings.cpp
│   │   ├── Find the Celebrity.cpp
│   │   ├── First Bad Version.cpp
│   │   ├── H-Index II.cpp
│   │   ├── H-Index.cpp
│   │   ├── Integer to English Words.cpp
│   │   ├── Paint Fence.cpp
│   │   ├── Perfect Squares.cpp
│   │   └── Wiggle Sort.cpp
│   ├── 281-290/
│   │   ├── Expression Add Operators.cpp
│   │   ├── Find the Duplicate Number.cpp
│   │   ├── Game of Life.cpp
│   │   ├── Inorder Successor in BST.cpp
│   │   ├── Move Zeroes.cpp
│   │   ├── Peeking Iterator.cpp
│   │   ├── Unique Word Abbreviation.cpp
│   │   ├── Walls and Gates.cpp
│   │   ├── Word Pattern.cpp
│   │   └── Zigzag Iterator.cpp
│   ├── 291-300/
│   │   ├── Best Meeting Point.cpp
│   │   ├── Binary Tree Longest Consecutive Sequence.cpp
│   │   ├── Bulls and Cows.cpp
│   │   ├── Find Median from Data Stream.cpp
│   │   ├── Flip Game II.cpp
│   │   ├── Flip Game.cpp
│   │   ├── Longest Increasing Subsequence.cpp
│   │   ├── Nim Game.cpp
│   │   ├── Serialize and Deserialize Binary Tree.cpp
│   │   └── Word Pattern II.cpp
│   ├── 301-310/
│   │   ├── Additive Number.cpp
│   │   ├── Best Time to Buy and Sell Stock with Cooldown.cpp
│   │   ├── Minimum Height Trees.cpp
│   │   ├── Number of Islands II.cpp
│   │   ├── Range Sum Query - Immutable.cpp
│   │   ├── Range Sum Query - Mutable.cpp
│   │   ├── Range Sum Query 2D - Immutable.cpp
│   │   ├── Range Sum Query 2D - Mutable.cpp
│   │   ├── Remove Invalid Parentheses.cpp
│   │   └── Smallest Rectangle Enclosing Black Pixels.cpp
│   ├── 311-320/
│   │   ├── Binary Tree Vertical Order Traversal.cpp
│   │   ├── Bulb Switcher.cpp
│   │   ├── Burst Balloons.cpp
│   │   ├── Count of Smaller Numbers After Self.cpp
│   │   ├── Generalized Abbreviation.cpp
│   │   ├── Maximum Product of Word Lengths.cpp
│   │   ├── Remove Duplicate Letters.cpp
│   │   ├── Shortest Distance from All Buildings.cpp
│   │   ├── Sparse Matrix Multiplication.cpp
│   │   └── Super Ugly Number.cpp
│   ├── 321-330/
│   │   ├── Coin Change.cpp
│   │   ├── Count of Range Sum.cpp
│   │   ├── Create Maximum Number.cpp
│   │   ├── Longest Increasing Path in a Matrix.cpp
│   │   ├── Maximum Size Subarray Sum Equals k.cpp
│   │   ├── Number of Connected Components in an Undirected Graph.cpp
│   │   ├── Odd Even Linked List.cpp
│   │   ├── Patching Array.cpp
│   │   ├── Power of Three.cpp
│   │   └── Wiggle Sort II.cpp
│   ├── 331-340/
│   │   ├── Counting Bits.cpp
│   │   ├── House Robber III.cpp
│   │   ├── Increasing Triplet Subsequence.cpp
│   │   ├── Largest BST Subtree.cpp
│   │   ├── Longest Substring with At Most K Distinct Characters.cpp
│   │   ├── Nested List Weight Sum.cpp
│   │   ├── Palindrome Pairs.cpp
│   │   ├── Reconstruct Itinerary.cpp
│   │   ├── Self Crossing.cpp
│   │   └── Verify Preorder Serialization of a Binary Tree.cpp
│   ├── 341-350/
│   │   ├── Design Tic-Tac-Toe.cpp
│   │   ├── Flatten Nested List Iterator.cpp
│   │   ├── Integer Break.cpp
│   │   ├── Intersection of Two Arrays II.cpp
│   │   ├── Intersection of Two Arrays.cpp
│   │   ├── Moving Average from Data Stream.cpp
│   │   ├── Power of Four.cpp
│   │   ├── Reverse String.cpp
│   │   ├── Reverse Vowels of a String.cpp
│   │   └── Top K Frequent Elements.cpp
│   ├── 351-360/
│   │   ├── Android Unlock Patterns.cpp
│   │   ├── Count Numbers with Unique Digits.cpp
│   │   ├── Data Stream as Disjoint Intervals.cpp
│   │   ├── Design Snake Game.cpp
│   │   ├── Design Twitter.cpp
│   │   ├── Line Reflection.cpp
│   │   ├── Logger Rate Limiter.cpp
│   │   ├── Rearrange String k Distance Apart.cpp
│   │   ├── Russian Doll Envelopes.cpp
│   │   └── Sort Transformed Array.cpp
│   ├── 361-370/
│   │   ├── Bomb Enemy.cpp
│   │   ├── Design Hit Counter.cpp
│   │   ├── Find Leaves of Binary Tree.cpp
│   │   ├── Largest Divisible Subset.cpp
│   │   ├── Max Sum of Rectangle No Larger Than K.cpp
│   │   ├── Nested List Weight Sum II.cpp
│   │   ├── Plus One Linked List.cpp
│   │   ├── Range Addition.cpp
│   │   ├── Valid Perfect Square.cpp
│   │   └── Water and Jug Problem.cpp
│   ├── 371-380/
│   │   ├── Combination Sum IV.cpp
│   │   ├── Design Phone Directory.cpp
│   │   ├── Find K Pairs with Smallest Sums.cpp
│   │   ├── Guess Number Higher or Lower II.cpp
│   │   ├── Guess Number Higher or Lower.cpp
│   │   ├── Insert Delete GetRandom O(1).cpp
│   │   ├── Kth Smallest Element in a Sorted Matrix.cpp
│   │   ├── Sum of Two Integers.cpp
│   │   ├── Super Pow.cpp
│   │   └── Wiggle Subsequence.cpp
│   ├── 381-390/
│   │   ├── Elimination Game.cpp
│   │   ├── Find the Difference.cpp
│   │   ├── First Unique Character in a String.cpp
│   │   ├── Insert Delete GetRandom O(1) - Duplicates allowed.cpp
│   │   ├── Lexicographical Numbers.cpp
│   │   ├── Linked List Random Node.cpp
│   │   ├── Longest Absolute File Path.cpp
│   │   ├── Mini Parser.cpp
│   │   ├── Ransom Note.cpp
│   │   └── Shuffle an Array.cpp
│   ├── 391-400/
│   │   ├── Decode String.cpp
│   │   ├── Evaluate Division.cpp
│   │   ├── Integer Replacement.cpp
│   │   ├── Is Subsequence.cpp
│   │   ├── Longest Substring with At Least K Repeating Characters.cpp
│   │   ├── Nth Digit.cpp
│   │   ├── Perfect Rectangle.cpp
│   │   ├── Random Pick Index.cpp
│   │   ├── Rotate Function.cpp
│   │   └── UTF-8 Validation.cpp
│   ├── 401-410/
│   │   ├── Binary Watch.cpp
│   │   ├── Convert a Number to Hexadecimal.cpp
│   │   ├── Frog Jump.cpp
│   │   ├── Longest Palindrome.cpp
│   │   ├── Queue Reconstruction by Height.cpp
│   │   ├── Remove K Digits.cpp
│   │   ├── Split Array Largest Sum.cpp
│   │   ├── Sum of Left Leaves.cpp
│   │   ├── Trapping Rain Water II.cpp
│   │   └── Valid Word Abbreviation.cpp
│   ├── 411-420/
│   │   ├── Add Strings.cpp
│   │   ├── Arithmetic Slices.cpp
│   │   ├── Battleships in a Board.cpp
│   │   ├── Fizz Buzz.cpp
│   │   ├── Minimum Unique Word Abbreviation.cpp
│   │   ├── Pacific Atlantic Water Flow.cpp
│   │   ├── Partition Equal Subset Sum.cpp
│   │   ├── Sentence Screen Fitting.cpp
│   │   └── Third Maximum Number.cpp
│   ├── 421-430/
│   │   ├── Convert Binary Search Tree to Sorted Doubly Linked List.cpp
│   │   ├── Maximum XOR of Two Numbers in an Array.cpp
│   │   ├── Serialize and Deserialize N-ary Tree.cpp
│   │   ├── Valid Word Square.cpp
│   │   └── Word Squares.cpp
│   ├── 431-440/
│   │   ├── All O`one Data Structure.cpp
│   │   ├── Find All Anagrams in a String.cpp
│   │   ├── Find Right Interval.cpp
│   │   ├── K-th Smallest in Lexicographical Order.cpp
│   │   ├── Minimum Genetic Mutation.cpp
│   │   ├── Number of Segments in a String.cpp
│   │   ├── Path Sum III.cpp
│   │   └── Ternary Expression Parser.cpp
│   ├── 441-450/
│   │   ├── Add Two Numbers II.cpp
│   │   ├── Arithmetic Slices II - Subsequence.cpp
│   │   ├── Arranging Coins.cpp
│   │   ├── Delete Node in a BST.cpp
│   │   ├── Find All Duplicates in an Array.cpp
│   │   ├── Number of Boomerangs.cpp
│   │   ├── Sequence Reconstruction.cpp
│   │   ├── Serialize and Deserialize BST.cpp
│   │   └── String Compression.cpp
│   ├── 451-460/
│   │   ├── 132 Pattern.cpp
│   │   ├── 4Sum II.cpp
│   │   ├── Assign Cookies.cpp
│   │   ├── LFU Cache.cpp
│   │   ├── Minimum Moves to Equal Array Elements.cpp
│   │   ├── Minimum Number of Arrows to Burst Balloons.cpp
│   │   ├── Repeated Substring Pattern.cpp
│   │   └── Sort Characters By Frequency.cpp
│   ├── 461-470/
│   │   ├── Can I Win.cpp
│   │   ├── Convex Polygon.cpp
│   │   ├── Count The Repetitions.cpp
│   │   ├── Hamming Distance.cpp
│   │   ├── Island Perimeter.cpp
│   │   ├── Minimum Moves to Equal Array Elements II.cpp
│   │   ├── Optimal Account Balancing.cpp
│   │   ├── Unique Substrings in Wraparound String.cpp
│   │   └── Validate IP Address.cpp
│   ├── 471-480/
│   │   ├── Concatenated Words.cpp
│   │   ├── Encode String with Shortest Length.cpp
│   │   ├── Heaters.cpp
│   │   ├── Largest Palindrome Product.cpp
│   │   ├── Matchsticks to Square.cpp
│   │   ├── Number Complement.cpp
│   │   ├── Ones and Zeroes.cpp
│   │   ├── Sliding Window Median.cpp
│   │   └── Total Hamming Distance.cpp
│   ├── 481-490/
│   │   ├── Find Permutation.cpp
│   │   ├── License Key Formatting.cpp
│   │   ├── Magical String.cpp
│   │   ├── Max Consecutive Ones II.cpp
│   │   ├── Max Consecutive Ones.cpp
│   │   ├── Predict the Winner.cpp
│   │   ├── Robot Room Cleaner.cpp
│   │   ├── Smallest Good Base.cpp
│   │   ├── The Maze.cpp
│   │   └── Zuma Game.cpp
│   ├── 491-500/
│   │   ├── Construct the Rectangle.cpp
│   │   ├── Diagonal Traverse.cpp
│   │   ├── Increasing Subsequences.cpp
│   │   ├── Keyboard Row.cpp
│   │   ├── Next Greater Element I.cpp
│   │   ├── Reverse Pairs.cpp
│   │   ├── Target Sum.cpp
│   │   ├── Teemo Attacking.cpp
│   │   └── The Maze III.cpp
│   ├── 501-510/
│   │   ├── Base 7.cpp
│   │   ├── Find Mode in Binary Search Tree.cpp
│   │   ├── IPO.cpp
│   │   ├── Most Frequent Subtree Sum.cpp
│   │   ├── Next Greater Element II.cpp
│   │   ├── Perfect Number.cpp
│   │   ├── Relative Ranks.cpp
│   │   └── The Maze II.cpp
│   ├── 511-520/
│   │   ├── Coin Change 2.cpp
│   │   ├── Detect Capital.cpp
│   │   ├── Find Bottom Left Tree Value.cpp
│   │   ├── Find Largest Value in Each Tree Row.cpp
│   │   ├── Freedom Trail.cpp
│   │   ├── Longest Palindromic Subsequence.cpp
│   │   └── Super Washing Machines.cpp
│   ├── 521-530/
│   │   ├── Beautiful Arrangement.cpp
│   │   ├── Contiguous Array.cpp
│   │   ├── Continuous Subarray Sum.cpp
│   │   ├── Longest Uncommon Subsequence I.cpp
│   │   ├── Longest Uncommon Subsequence II.cpp
│   │   ├── Longest Word in Dictionary through Deleting.cpp
│   │   ├── Minimum Distance Between BST Nodes.cpp
│   │   └── Word Abbreviation.cpp
│   ├── 531-540/
│   │   ├── Complex Number Multiplication.cpp
│   │   ├── Convert BST to Greater Tree.cpp
│   │   ├── Encode and Decode TinyURL.cpp
│   │   ├── Lonely Pixel I.cpp
│   │   ├── Lonely Pixel II.cpp
│   │   └── Single Element in a Sorted Array.cpp
│   ├── 541-550/
│   │   ├── 01 Matrix.cpp
│   │   ├── Binary Tree Longest Consecutive Sequence II.cpp
│   │   ├── Boundary of Binary Tree.cpp
│   │   ├── Diameter of Binary Tree.cpp
│   │   ├── Friend Circles.cpp
│   │   ├── Output Contest Matches.cpp
│   │   ├── Reverse String II.cpp
│   │   └── Split Array with Equal Sum.cpp
│   ├── 551-560/
│   │   ├── Brick Wall.cpp
│   │   ├── Next Greater Element III.cpp
│   │   ├── Optimal Division.cpp
│   │   ├── Reverse Words in a String III.cpp
│   │   ├── Split Concatenated Strings.cpp
│   │   ├── Student Attendance Record I.cpp
│   │   ├── Student Attendance Record II.cpp
│   │   └── Subarray Sum Equals K.cpp
│   ├── 561-570/
│   │   ├── Array Nesting.cpp
│   │   ├── Array Partition I.cpp
│   │   ├── Binary Tree Tilt.cpp
│   │   ├── Longest Line of Consecutive One in Matrix.cpp
│   │   ├── Maximum Vacation Days.cpp
│   │   ├── Permutation in String.cpp
│   │   └── Reshape the Matrix.cpp
│   ├── 571-580/
│   │   ├── Distribute Candies.cpp
│   │   ├── Out of Boundary Paths.cpp
│   │   ├── Squirrel Simulation.cpp
│   │   └── Subtree of Another Tree.cpp
│   ├── 581-590/
│   │   ├── Delete Operation for Two Strings.cpp
│   │   ├── Design In-Memory File System.cpp
│   │   ├── Erect the Fence.cpp
│   │   ├── Kill Process.cpp
│   │   └── Shortest Unsorted Continuous Subarray.cpp
│   ├── 591-600/
│   │   ├── Fraction Addition and Subtraction.cpp
│   │   ├── Longest Harmonious Subsequence.cpp
│   │   ├── Minimum Index Sum of Two Lists.cpp
│   │   ├── Non-negative Integers without Consecutive Ones.cpp
│   │   ├── Range Addition II.cpp
│   │   ├── Tag Validator.cpp
│   │   └── Valid Square.cpp
│   ├── 601-610/
│   │   ├── Can Place Flowers.cpp
│   │   ├── Construct String from Binary Tree.cpp
│   │   ├── Design Compressed String Iterator.cpp
│   │   └── Find Duplicate File in System.cpp
│   ├── 611-620/
│   │   ├── Add Bold Tag in String.cpp
│   │   ├── Merge Two Binary Trees.cpp
│   │   └── Valid Triangle Number.cpp
│   ├── 621-630/
│   │   ├── Add One Row to Tree.cpp
│   │   ├── Course Schedule III.cpp
│   │   ├── Design Circular Queue.cpp
│   │   ├── K Inverse Pairs Array.cpp
│   │   ├── Maximum Distance in Arrays.cpp
│   │   ├── Maximum Product of Three Numbers.cpp
│   │   ├── Minimum Factorization.cpp
│   │   └── Task Scheduler.cpp
│   ├── 631-640/
│   │   ├── Average of Levels in Binary Tree.cpp
│   │   ├── Decode Ways II.cpp
│   │   ├── Design Excel Sum Formula.cpp
│   │   ├── Design Log Storage System.cpp
│   │   ├── Exclusive Time of Functions.cpp
│   │   ├── Find the Derangement of An Array.cpp
│   │   ├── Shopping Offers.cpp
│   │   ├── Smallest Range.cpp
│   │   ├── Solve the Equation.cpp
│   │   └── Sum of Square Numbers.cpp
│   ├── 641-650/
│   │   ├── 2 Keys Keyboard.cpp
│   │   ├── Design Search Autocomplete System.cpp
│   │   ├── Dota2 Senate.cpp
│   │   ├── Maximum Average Subarray I.cpp
│   │   ├── Maximum Average Subarray II.cpp
│   │   ├── Maximum Length of Pair Chain.cpp
│   │   ├── Palindromic Substrings.cpp
│   │   ├── Replace Words.cpp
│   │   └── Set Mismatch.cpp
│   ├── 651-660/
│   │   ├── 4 Keys Keyboard.cpp
│   │   ├── Coin Path.cpp
│   │   ├── Find Duplicate Subtrees.cpp
│   │   ├── Find K Closest Elements.cpp
│   │   ├── Judge Route Circle.cpp
│   │   ├── Maximum Binary Tree.cpp
│   │   ├── Print Binary Tree.cpp
│   │   ├── Remove 9.cpp
│   │   ├── Split Array into Consecutive Subsequences.cpp
│   │   └── Two Sum IV - Input is a BST.cpp
│   ├── 661-670/
│   │   ├── Beautiful Arrangement II.cpp
│   │   ├── Equal Tree Partition.cpp
│   │   ├── Image Smoother.cpp
│   │   ├── Kth largest Number in Multiplication Table.cpp
│   │   ├── Maximum Swap.cpp
│   │   ├── Maximum Width of Binary Tree.cpp
│   │   ├── Non-decreasing Array.cpp
│   │   ├── Path Sum IV.cpp
│   │   ├── Strange Printer.cpp
│   │   └── Trim a Binary Search Tree.cpp
│   ├── 671-680/
│   │   ├── 24 Game.cpp
│   │   ├── Cut Off Trees for Golf Event.cpp
│   │   ├── Implement Magic Dictionary.cpp
│   │   ├── Longest Continuous Increasing Subsequence.cpp
│   │   ├── Map Sum Pairs.cpp
│   │   ├── Number of Longest Increasing Subsequence.cpp
│   │   ├── Second Minimum Node In a Binary Tree.cpp
│   │   ├── Valid Palindrome II.cpp
│   │   └── Valid Parenthesis String.cpp
│   ├── 681-690/
│   │   ├── Baseball Game.cpp
│   │   ├── Employee Importance.cpp
│   │   ├── K Empty Slots.cpp
│   │   ├── Knight Probability in Chessboard.cpp
│   │   ├── Longest Univalue Path.cpp
│   │   ├── Maximum Sum of 3 Non-Overlapping Subarrays.cpp
│   │   ├── Next Closest Time.cpp
│   │   ├── Redundant Connection II.cpp
│   │   ├── Redundant Connection.cpp
│   │   └── Repeated String Match.cpp
│   ├── 691-700/
│   │   ├── Binary Number with Alternating Bits.cpp
│   │   ├── Count Binary Substrings.cpp
│   │   ├── Degree of an Array.cpp
│   │   ├── Falling Squares.cpp
│   │   ├── Max Area of Island.cpp
│   │   ├── Number of Distinct Islands.cpp
│   │   ├── Partition to K Equal Sum Subsets.cpp
│   │   └── Top K Frequent Words.cpp
│   ├── 701-710/
│   │   ├── Insert into a Binary Search Tree.cpp
│   │   ├── Random Pick with Blacklist.cpp
│   │   └── To Lower Case.cpp
│   ├── 711-720/
│   │   ├── 1-bit and 2-bit Characters.cpp
│   │   ├── Best Time to Buy and Sell Stock with Transaction Fee.cpp
│   │   ├── Find K-th Smallest Pair Distance.cpp
│   │   ├── Longest Word in Dictionary.cpp
│   │   ├── Max Stack.cpp
│   │   ├── Maximum Length of Repeated Subarray.cpp
│   │   ├── Minimum ASCII Delete Sum for Two Strings.cpp
│   │   ├── Number of Distinct Islands II.cpp
│   │   ├── Range Module.cpp
│   │   └── Subarray Product Less Than K.cpp
│   ├── 721-730/
│   │   ├── Accounts Merge.cpp
│   │   ├── Candy Crush.cpp
│   │   ├── Count Different Palindromic Subsequences.cpp
│   │   ├── Find Pivot Index.cpp
│   │   ├── My Calendar I.cpp
│   │   ├── Number of Atoms.cpp
│   │   ├── Remove Comments.cpp
│   │   ├── Self Dividing Numbers.cpp
│   │   └── Split Linked List in Parts.cpp
│   ├── 731-740/
│   │   ├── Asteroid Collision.cpp
│   │   ├── Daily Temperatures.cpp
│   │   ├── Delete and Earn.cpp
│   │   ├── Flood Fill.cpp
│   │   ├── Monotone Increasing Digits.cpp
│   │   ├── My Calendar II.cpp
│   │   ├── My Calendar III.cpp
│   │   ├── Parse Lisp Expression.cpp
│   │   ├── Sentence Similarity II.cpp
│   │   └── Sentence Similarity.cpp
│   ├── 741-750/
│   │   ├── Closest Leaf in a Binary Tree.cpp
│   │   ├── Find Smallest Letter Greater Than Target.cpp
│   │   ├── Largest Number At Least Twice of Others.cpp
│   │   ├── Min Cost Climbing Stairs.cpp
│   │   ├── Network Delay Time.cpp
│   │   ├── Number Of Corner Rectangles.cpp
│   │   ├── Prefix and Suffix Search.cpp
│   │   └── Shortest Completing Word.cpp
│   ├── 751-760/
│   │   ├── Bold Words in String.cpp
│   │   ├── Cracking the Safe.cpp
│   │   ├── Employee Free Time.cpp
│   │   ├── Find Anagram Mappings.cpp
│   │   ├── IP to CIDR.cpp
│   │   ├── Open the Lock.cpp
│   │   ├── Pour Water.cpp
│   │   ├── Pyramid Transition Matrix.cpp
│   │   ├── Reach a Number.cpp
│   │   └── Set Intersection Size At Least Two.cpp
│   ├── 761-770/
│   │   ├── Couples Holding Hands.cpp
│   │   ├── Largest Plus Sign.cpp
│   │   ├── Max Chunks To Make Sorted II.cpp
│   │   ├── Max Chunks To Make Sorted.cpp
│   │   ├── Partition Labels.cpp
│   │   ├── Prime Number of Set Bits in Binary Representation.cpp
│   │   ├── Reorganize String.cpp
│   │   ├── Special Binary String.cpp
│   │   └── Toeplitz Marix.cpp
│   ├── 771-780/
│   │   ├── Basic Calculator III.cpp
│   │   ├── Global and Local Inversions.cpp
│   │   ├── Jewels and Stones.cpp
│   │   ├── K-th Symbol in Grammar.cpp
│   │   ├── Minimize Max Distance to Gas Station.cpp
│   │   ├── Sliding Puzzle.cpp
│   │   ├── Split BST.cpp
│   │   ├── Swap Adjacent in LR String.cpp
│   │   └── Swim in Rising Water.cpp
│   ├── 781-790/
│   │   ├── Cheapest Flights Within K Stops.cpp
│   │   ├── Escape The Ghosts.cpp
│   │   ├── Is Graph Bipartite?.cpp
│   │   ├── K-th Smallest Prime Fraction.cpp
│   │   ├── Letter Case Permutation.cpp
│   │   ├── Minimum Distance Between BST Nodes.cpp
│   │   ├── Rabbits in Forest.cpp
│   │   ├── Rotated Digits.cpp
│   │   └── Transform to Chessboard.cpp
│   ├── 791-800/
│   │   ├── All Paths From Source to Target.cpp
│   │   ├── Champagne Tower.cpp
│   │   ├── Custom Sort String.cpp
│   │   ├── Number of Matching Subsequences.cpp
│   │   ├── Number of Subarrays with Bounded Maximum.cpp
│   │   ├── Preimage Size of Factorial Zeroes Function.cpp
│   │   ├── Rotate String
│   │   ├── Similar RGB Color.cpp
│   │   └── Valid Tic-Tac-Toe State.cpp
│   ├── 801-810/
│   │   ├── Bricks Falling When Hit.cpp
│   │   ├── Chalkboard XOR Game.cpp
│   │   ├── Expressive Words.cpp
│   │   ├── Find Eventual Safe States.cpp
│   │   ├── Max Increase to Keep City Skyline.cpp
│   │   ├── Minimum Swaps To Make Sequences Increasing.cpp
│   │   ├── Number of Lines To Write String.cpp
│   │   ├── Soup Servings.cpp
│   │   └── Unique Morse Code Words.cpp
│   ├── 811-820/
│   │   ├── Ambiguous Coordinates.cpp
│   │   ├── Binary Tree Pruning.cpp
│   │   ├── Bus Routes.cpp
│   │   ├── Largest Sum of Averages.cpp
│   │   ├── Linked List Components.cpp
│   │   ├── Most Common Word.cpp
│   │   ├── Race Car.cpp
│   │   ├── Short Encoding of Words.cpp
│   │   └── Subdomain Visit Count.cpp
│   ├── 821-830/
│   │   ├── Binary Trees With Factors.cpp
│   │   ├── Card Flipping Game.cpp
│   │   ├── Consecutive Numbers Sum.cpp
│   │   ├── Friends Of Appropriate Ages.cpp
│   │   ├── Goat Latin.cpp
│   │   ├── Making A Large Island.cpp
│   │   ├── Most Profit Assigning Work.cpp
│   │   ├── Positions of Large Groups.cpp
│   │   ├── Shortest Distance to a Character.cpp
│   │   └── Unique Letter String.cpp
│   ├── 831-840/
│   │   ├── Find And Replace in String.cpp
│   │   ├── Flipping an Image.cpp
│   │   ├── Image Overlap.cpp
│   │   ├── Magic Squares In Grid.cpp
│   │   ├── Masking Personal Information.cpp
│   │   ├── New 21 Game.cpp
│   │   ├── Push Dominoes.cpp
│   │   ├── Rectangle Overlap.cpp
│   │   ├── Similar String Groups.cpp
│   │   └── Sum of Distances in Tree.cpp
│   ├── 841-850/
│   │   ├── Backspace String Compare.cpp
│   │   ├── Guess the Word.cpp
│   │   ├── Hand of Straights.cpp
│   │   ├── Keys and Rooms.cpp
│   │   ├── Longest Mountain in Array.cpp
│   │   ├── Maximize Distance to Closest Person.cpp
│   │   ├── Shifting Letters.cpp
│   │   ├── Shortest Path Visiting All Nodes.cpp
│   │   └── Split Array into Fibonacci Sequence.cpp
│   ├── 851-860/
│   │   ├── Buddy Strings.cpp
│   │   ├── Car Fleet.cpp
│   │   ├── Exam Room.cpp
│   │   ├── K-Similar Strings.cpp
│   │   ├── Lemonade Change.cpp
│   │   ├── Loud and Rich.cpp
│   │   ├── Peak Index in a Mountain Array.cpp
│   │   └── Score of Parentheses.cpp
│   ├── 861-870/
│   │   ├── Advantage Shuffle.cpp
│   │   ├── All Nodes Distance K in Binary Tree.cpp
│   │   ├── Binary Gap.cpp
│   │   ├── Prime Palindrome.cpp
│   │   ├── Reordered Power of 2.cpp
│   │   ├── Score After Flipping Matrix.cpp
│   │   ├── Smallest Subtree with all the Deepest Nodes.cpp
│   │   └── Transpose Matrix.cpp
│   ├── 871-880/
│   │   ├── Implement Rand10() Using Rand7().cpp
│   │   ├── Koko Eating Bananas.cpp
│   │   ├── Leaf-Similar Trees.cpp
│   │   ├── Length of Longest Fibonacci Subsequence.cpp
│   │   ├── Middle of the Linked List.cpp
│   │   └── Stone Game.cpp
│   ├── 881-890/
│   │   ├── Boats to Save People.cpp
│   │   ├── Possible Bipartition.cpp
│   │   ├── Projection Area of 3D Shapes.cpp
│   │   └── Uncommon Words from Two Sentences.cpp
│   ├── 891-900/
│   │   └── Maximum Frequency Stack.cpp
│   ├── 911-920/
│   │   ├── Complete Binary Tree Inserter.cpp
│   │   ├── Maximum Sum Circular Subarray.cpp
│   │   ├── Number of Music Playlists.cpp
│   │   ├── Online Election.cpp
│   │   ├── Partition Array into Disjoint Intervals.cpp
│   │   ├── Reverse Only Letters.cpp
│   │   ├── Word Subsets.cpp
│   │   └── X of a Kind in a Deck of Cards.cpp
│   ├── 921-930/
│   │   ├── 3Sum With Multiplicity.cpp
│   │   ├── Binary Subarrays With Sum.cpp
│   │   ├── Flip String to Monotone Increasing.cpp
│   │   ├── Long Pressed Name.cpp
│   │   ├── Minimize Malware Spread.cpp
│   │   ├── Minimum Add to Make Parentheses Valid.cpp
│   │   ├── Sort Array By Parity II.cpp
│   │   ├── Three Equal Parts.cpp
│   │   └── Unique Email Addresses.cpp
│   ├── 931-940/
│   │   ├── Beautiful Array.cpp
│   │   ├── Distinct Subsequences II.cpp
│   │   ├── Knight Dialer.cpp
│   │   ├── Minimum Area Rectangle.cpp
│   │   ├── Minimum Falling Path Sum.cpp
│   │   ├── Number of Recent Calls.cpp
│   │   ├── Range Sum of BST.cpp
│   │   ├── Reorder Log Files.cpp
│   │   ├── Shortest Bridge.cpp
│   │   └── Stamping The Sequence.cpp
│   ├── 941-950/
│   │   ├── Bag of Tokens.cpp
│   │   ├── DI String Match.cpp
│   │   ├── Delete Columns to Make Sorted.cpp
│   │   ├── Minimum Increment to Make Array Unique.cpp
│   │   ├── Most Stones Removed with Same Row or Column.cpp
│   │   ├── Valid Mountain Array.cpp
│   │   └── Validate Stack Sequences.cpp
│   ├── 951-960/
│   │   ├── Check Completeness of a Binary Tree.cpp
│   │   ├── Prison Cells After N Days.cpp
│   │   ├── Regions Cut By Slashes.cpp
│   │   └── Verifying an Alien Dictionary.cpp
│   ├── 961-970/
│   │   ├── N-Repeated Element in Size 2N Array.cpp
│   │   └── Pancake Sorting.cpp
│   ├── 971-980/
│   │   ├── Distribute Coins in Binary Tree.cpp
│   │   ├── K Closest Points to Origin.cpp
│   │   ├── Largest Perimeter Triangle.cpp
│   │   ├── Longest Turbulent Subarray.cpp
│   │   ├── Squares of a Sorted Array.cpp
│   │   ├── Subarray Sums Divisible by K.cpp
│   │   └── Unique Paths III.cpp
│   ├── 981-990/
│   │   ├── Add to Array-Form of Integer.cpp
│   │   ├── Interval List Intersections.cpp
│   │   ├── Satisfiability of Equality Equations.cpp
│   │   ├── String Without AAA or BBB.cpp
│   │   └── Time Based Key-Value Store.cpp
│   └── 991-1000/
│       ├── Broken Calculator.cpp
│       ├── Cousins in Binary Tree.cpp
│       ├── Find the Town Judge.cpp
│       ├── Maximum Binary Tree II.cpp
│       ├── Minimum Number of K Consecutive Bit Flips.cpp
│       ├── Number of Squareful Arrays.cpp
│       └── Rotting Oranges.cpp
├── golang/
│   └── 001-010/
│       ├── Add Two Numbers.go
│       ├── Longest Substring Without Repeating Characters.go
│       └── Two Sum.go
├── java/
│   ├── 201-210/
│   │   └── Happy Number.java
│   ├── 291-300/
│   │   └── Nim Game.java
│   └── 331-340/
│       ├── Counting Bits.java
│       └── Nested List Weight Sum.java
├── python/
│   ├── 001-010/
│   │   └── Median of Two Sorted Arrays.py
│   ├── 011-020/
│   │   └── Valid Parentheses.py
│   ├── 021-030/
│   │   └── Reverse Nodes in k-Group.py
│   ├── 031-040/
│   │   ├── Combination Sum II.py
│   │   ├── Combination Sum.py
│   │   ├── Next Permutation.py
│   │   ├── Search Insert Position.py
│   │   ├── Search for a Range.py
│   │   ├── Sudoku Solver.py
│   │   └── Valid Sudoku.py
│   ├── 041-050/
│   │   ├── Jump Game II.py
│   │   └── Rotate Image.py
│   ├── 051-060/
│   │   ├── Jump Game.py
│   │   └── Permutation Sequence.py
│   ├── 061-070/
│   │   ├── Minimum Path Sum.py
│   │   ├── Sqrt(x).py
│   │   ├── Unique Paths II.py
│   │   ├── Unique Paths.py
│   │   └── Valid Number.py
│   ├── 071-080/
│   │   └── Edit Distance.py
│   ├── 081-090/
│   │   ├── Largest Rectangle in Histogram.py
│   │   ├── Maximal Rectangle.py
│   │   ├── Remove Duplicates from Sorted List II.py
│   │   └── Remove Duplicates from Sorted List.py
│   ├── 091-100/
│   │   ├── Decode Ways.py
│   │   └── Interleaving String.py
│   ├── 101-110/
│   │   └── Symmetric Tree.py
│   ├── 111-120/
│   │   ├── Path Sum.py
│   │   ├── Populating Next Right Pointers in Each Node II.py
│   │   └── Populating Next Right Pointers in Each Node.py
│   ├── 121-130/
│   │   ├── Best Time to Buy and Sell Stock.py
│   │   ├── Binary Tree Maximum Path Sum.py
│   │   ├── Word Ladder II.py
│   │   └── Word Ladder.py
│   ├── 131-140/
│   │   ├── Candy.py
│   │   ├── Clone Graph.py
│   │   └── Single Number II.py
│   ├── 141-150/
│   │   ├── Binary Tree Postorder Traversal.py
│   │   └── LRU Cache.py
│   ├── 151-160/
│   │   ├── Find Minimum in Rotated Sorted Array II.py
│   │   └── Find Minimum in Rotated Sorted Array.py
│   ├── 161-170/
│   │   ├── Majority Element.py
│   │   └── Maximum Gap.py
│   ├── 171-180/
│   │   └── Largest Number.py
│   ├── 181-190/
│   │   ├── Best Time to Buy and Sell Stock IV.py
│   │   └── Repeated DNA Sequences.py
│   ├── 191-200/
│   │   ├── Binary Tree Right Side View.py
│   │   └── House Robber.py
│   ├── 201-210/
│   │   ├── Count Primes.py
│   │   └── Implement Trie (Prefix Tree).py
│   ├── 211-220/
│   │   └── House Robber II.py
│   ├── 221-230/
│   │   └── Maximal Square.py
│   └── 231-240/
│       ├── Palindrome Linked List.py
│       ├── Product of Array Except Self.py
│       └── a.py
└── scala/
    ├── 0001-0010/
    │   ├── Add Two Numbers.scala
    │   ├── Longest Substring Without Repeating Characters.scala
    │   ├── Palindrome Number.scala
    │   └── Two Sum.scala
    └── 0011-0020/
        ├── Longest Common Prefix.scala
        └── Roman to Integer.scala