Commit 8a5e197


JavaScalaDeveloper
JavaScalaDeveloper
1 parent 5149921 commit 8a5e197
File tree
194 files changed
+420868
-17256
lines changed- change
- scripts
- out
- solution
- 0000-0099
- 0002.Add Two Numbers
- 0019.Remove Nth Node From End of List
- 0021.Merge Two Sorted Lists
- 0023.Merge k Sorted Lists
- 0024.Swap Nodes in Pairs
- 0025.Reverse Nodes in k-Group
- 0061.Rotate List
- 0082.Remove Duplicates from Sorted List II
- 0083.Remove Duplicates from Sorted List
- 0086.Partition List
- 0092.Reverse Linked List II
- 0094.Binary Tree Inorder Traversal
- 0095.Unique Binary Search Trees II
- 0098.Validate Binary Search Tree
- 0099.Recover Binary Search Tree
- 0100-0199
- 0100.Same Tree
- 0101.Symmetric Tree
- 0102.Binary Tree Level Order Traversal
- 0103.Binary Tree Zigzag Level Order Traversal
- 0104.Maximum Depth of Binary Tree
- 0105.Construct Binary Tree from Preorder and Inorder Traversal
- 0106.Construct Binary Tree from Inorder and Postorder Traversal
- 0107.Binary Tree Level Order Traversal II
- 0108.Convert Sorted Array to Binary Search Tree
- 0109.Convert Sorted List to Binary Search Tree
- 0110.Balanced Binary Tree
- 0111.Minimum Depth of Binary Tree
- 0112.Path Sum
- 0113.Path Sum II
- 0114.Flatten Binary Tree to Linked List
- 0124.Binary Tree Maximum Path Sum
- 0129.Sum Root to Leaf Numbers
- 0141.Linked List Cycle
- 0142.Linked List Cycle II
- 0143.Reorder List
- 0144.Binary Tree Preorder Traversal
- 0145.Binary Tree Postorder Traversal
- 0147.Insertion Sort List
- 0148.Sort List
- 0156.Binary Tree Upside Down
- 0173.Binary Search Tree Iterator
- 0199.Binary Tree Right Side View
- 0200-0299
- 0203.Remove Linked List Elements
- 0206.Reverse Linked List
- 0222.Count Complete Tree Nodes
- 0226.Invert Binary Tree
- 0230.Kth Smallest Element in a BST
- 0234.Palindrome Linked List
- 0235.Lowest Common Ancestor of a Binary Search Tree
- 0236.Lowest Common Ancestor of a Binary Tree
- 0237.Delete Node in a Linked List
- 0250.Count Univalue Subtrees
- 0257.Binary Tree Paths
- 0270.Closest Binary Search Tree Value
- 0272.Closest Binary Search Tree Value II
- 0285.Inorder Successor in BST
- 0297.Serialize and Deserialize Binary Tree
- 0298.Binary Tree Longest Consecutive Sequence
- 0300-0399
- 0314.Binary Tree Vertical Order Traversal
- 0328.Odd Even Linked List
- 0333.Largest BST Subtree
- 0337.House Robber III
- 0366.Find Leaves of Binary Tree
- 0369.Plus One Linked List
- 0382.Linked List Random Node
- 0400-0499
- 0404.Sum of Left Leaves
- 0437.Path Sum III
- 0445.Add Two Numbers II
- 0449.Serialize and Deserialize BST
- 0450.Delete Node in a BST
- 0500-0599
- 0501.Find Mode in Binary Search Tree
- 0508.Most Frequent Subtree Sum
- 0513.Find Bottom Left Tree Value
- 0515.Find Largest Value in Each Tree Row
- 0530.Minimum Absolute Difference in BST
- 0536.Construct Binary Tree from String
- 0538.Convert BST to Greater Tree
- 0543.Diameter of Binary Tree
- 0545.Boundary of Binary Tree
- 0549.Binary Tree Longest Consecutive Sequence II
- 0563.Binary Tree Tilt
- 0572.Subtree of Another Tree
- 0600-0699
- 0606.Construct String from Binary Tree
- 0617.Merge Two Binary Trees
- 0623.Add One Row to Tree
- 0637.Average of Levels in Binary Tree
- 0652.Find Duplicate Subtrees
- 0653.Two Sum IV - Input is a BST
- 0654.Maximum Binary Tree
- 0655.Print Binary Tree
- 0662.Maximum Width of Binary Tree
- 0663.Equal Tree Partition
- 0669.Trim a Binary Search Tree
- 0671.Second Minimum Node In a Binary Tree
- 0687.Longest Univalue Path
- 0700-0799
- 0700.Search in a Binary Search Tree
- 0701.Insert into a Binary Search Tree
- 0725.Split Linked List in Parts
- 0742.Closest Leaf in a Binary Tree
- 0776.Split BST
- 0783.Minimum Distance Between BST Nodes
- 0800-0899
- 0814.Binary Tree Pruning
- 0817.Linked List Components
- 0863.All Nodes Distance K in Binary Tree
- 0865.Smallest Subtree with all the Deepest Nodes
- 0872.Leaf-Similar Trees
- 0876.Middle of the Linked List
- 0894.All Possible Full Binary Trees
- 0897.Increasing Order Search Tree
- 0900-0999
- 0919.Complete Binary Tree Inserter
- 0938.Range Sum of BST
- 0951.Flip Equivalent Binary Trees
- 0958.Check Completeness of a Binary Tree
- 0965.Univalued Binary Tree
- 0968.Binary Tree Cameras
- 0979.Distribute Coins in Binary Tree
- 0988.Smallest String Starting From Leaf
- 0993.Cousins in Binary Tree
- 0998.Maximum Binary Tree II
- 1000-1099
- 1008.Construct Binary Search Tree from Preorder Traversal
- 1019.Next Greater Node In Linked List
- 1022.Sum of Root To Leaf Binary Numbers
- 1026.Maximum Difference Between Node and Ancestor
- 1038.Binary Search Tree to Greater Sum Tree
- 1080.Insufficient Nodes in Root to Leaf Paths
- 1100-1199
- 1110.Delete Nodes And Return Forest
- 1120.Maximum Average Subtree
- 1123.Lowest Common Ancestor of Deepest Leaves
- 1145.Binary Tree Coloring Game
- 1161.Maximum Level Sum of a Binary Tree
- 1171.Remove Zero Sum Consecutive Nodes from Linked List
- 1200-1299
- 1214.Two Sum BSTs
- 1261.Find Elements in a Contaminated Binary Tree
- 1290.Convert Binary Number in a Linked List to Integer
- 1300-1399
- 1302.Deepest Leaves Sum
- 1305.All Elements in Two Binary Search Trees
- 1315.Sum of Nodes with Even-Valued Grandparent
- 1325.Delete Leaves With a Given Value
- 1339.Maximum Product of Splitted Binary Tree
- 1367.Linked List in Binary Tree
- 1372.Longest ZigZag Path in a Binary Tree
- 1373.Maximum Sum BST in Binary Tree
- 1379.Find a Corresponding Node of a Binary Tree in a Clone of That Tree
- 1382.Balance a Binary Search Tree
- 1400-1499
- 1430.Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
- 1448.Count Good Nodes in Binary Tree
- 1457.Pseudo-Palindromic Paths in a Binary Tree
- 1469.Find All The Lonely Nodes
- 1474.Delete N Nodes After M Nodes of a Linked List
- 1500-1599/1530.Number of Good Leaf Nodes Pairs
- 1600-1699
- 1602.Find Nearest Right Node in Binary Tree
- 1609.Even Odd Tree
- 1612.Check If Two Expression Trees are Equivalent
- 1644.Lowest Common Ancestor of a Binary Tree II
- 1660.Correct a Binary Tree
- 1669.Merge In Between Linked Lists
- 1676.Lowest Common Ancestor of a Binary Tree IV
- 1700-1799
- 1721.Swapping Nodes in a Linked List
- 1740.Find Distance in a Binary Tree
- 1800-1899/1836.Remove Duplicates From an Unsorted Linked List
- 1900-1999/1973.Count Nodes Equal to Sum of Descendants
- 2000-2099
- 2046.Sort Linked List Already Sorted Using Absolute Values
- 2058.Find the Minimum and Maximum Number of Nodes Between Critical Points
- 2074.Reverse Nodes in Even Length Groups
- 2095.Delete the Middle Node of a Linked List
- 2096.Step-By-Step Directions From a Binary Tree Node to Another
- 2100-2199
- 2130.Maximum Twin Sum of a Linked List
- 2181.Merge Nodes in Between Zeros
- 2196.Create Binary Tree From Descriptions
- 2200-2299
- 2236.Root Equals Sum of Children
- 2265.Count Nodes Equal to Average of Subtree
- 2300-2399
- 2326.Spiral Matrix IV
- 2331.Evaluate Boolean Binary Tree
- 2385.Amount of Time for Binary Tree to Be Infected
- 2400-2499
- 2415.Reverse Odd Levels of Binary Tree
- 2458.Height of Binary Tree After Subtree Removal Queries
- 2471.Minimum Number of Operations to Sort a Binary Tree by Level
- 2476.Closest Nodes Queries in a Binary Search Tree
- 2487.Remove Nodes From Linked List
- 2500-2599/2583.Kth Largest Sum in a Binary Tree
- 2600-2699
- 2641.Cousins in Binary Tree II
- 2674.Split a Circular Linked List
Some content is hidden
Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.
194 files changed
+420868
-17256
lines changedWhitespace-only changes.
Whitespace-only changes.
Whitespace-only changes.
Lines changed: 13 additions & 4 deletions
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
9 |
| - | |
| 9 | + | |
10 | 10 |
| |
11 | 11 |
| |
12 | 12 |
| |
| |||
25 | 25 |
| |
26 | 26 |
| |
27 | 27 |
| |
28 |
| - | |
29 |
| - | |
30 |
| - | |
| 28 | + | |
| 29 | + | |
| 30 | + | |
| 31 | + | |
| 32 | + | |
| 33 | + | |
| 34 | + | |
| 35 | + | |
| 36 | + | |
| 37 | + | |
| 38 | + | |
| 39 | + | |
31 | 40 |
| |
32 | 41 |
| |
33 | 42 |
| |
|
Lines changed: 74 additions & 0 deletions
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
| 1 | + | |
| 2 | + | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
| 6 | + | |
| 7 | + | |
| 8 | + | |
| 9 | + | |
| 10 | + | |
| 11 | + | |
| 12 | + | |
| 13 | + | |
| 14 | + | |
| 15 | + | |
| 16 | + | |
| 17 | + | |
| 18 | + | |
| 19 | + | |
| 20 | + | |
| 21 | + | |
| 22 | + | |
| 23 | + | |
| 24 | + | |
| 25 | + | |
| 26 | + | |
| 27 | + | |
| 28 | + | |
| 29 | + | |
| 30 | + | |
| 31 | + | |
| 32 | + | |
| 33 | + | |
| 34 | + | |
| 35 | + | |
| 36 | + | |
| 37 | + | |
| 38 | + | |
| 39 | + | |
| 40 | + | |
| 41 | + | |
| 42 | + | |
| 43 | + | |
| 44 | + | |
| 45 | + | |
| 46 | + | |
| 47 | + | |
| 48 | + | |
| 49 | + | |
| 50 | + | |
| 51 | + | |
| 52 | + | |
| 53 | + | |
| 54 | + | |
| 55 | + | |
| 56 | + | |
| 57 | + | |
| 58 | + | |
| 59 | + | |
| 60 | + | |
| 61 | + | |
| 62 | + | |
| 63 | + | |
| 64 | + | |
| 65 | + | |
| 66 | + | |
| 67 | + | |
| 68 | + | |
| 69 | + | |
| 70 | + | |
| 71 | + | |
| 72 | + | |
| 73 | + | |
| 74 | + |
Lines changed: 10 additions & 3 deletions
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
9 | 9 |
| |
10 | 10 |
| |
11 | 11 |
| |
| 12 | + | |
12 | 13 |
| |
13 | 14 |
| |
14 | 15 |
| |
15 | 16 |
| |
16 |
| - | |
17 |
| - | |
| 17 | + | |
18 | 18 |
| |
19 | 19 |
| |
20 | 20 |
| |
| 21 | + | |
| 22 | + | |
21 | 23 |
| |
22 | 24 |
| |
23 | 25 |
| |
24 |
| - | |
| 26 | + | |
| 27 | + | |
| 28 | + | |
| 29 | + | |
| 30 | + | |
| 31 | + | |
25 | 32 |
| |
26 | 33 |
| |
27 | 34 |
| |
|
0 commit comments