GitHub - W1ngshot/LeetCode: My solutions to problems on Leetcode

Name		Name	Last commit message	Last commit date
1. Two Sum		1. Two Sum
100. Same Tree		100. Same Tree
1009. Complement of Base 10 Integer		1009. Complement of Base 10 Integer
101. Symmetric Tree		101. Symmetric Tree
1022. Sum of Root To Leaf Binary Numbers		1022. Sum of Root To Leaf Binary Numbers
104. Maximum Depth of Binary Tree		104. Maximum Depth of Binary Tree
1051. Height Checker		1051. Height Checker
1089. Duplicate Zeros		1089. Duplicate Zeros
11. Container With Most Water		11. Container With Most Water
1137. N-th Tribonacci Number		1137. N-th Tribonacci Number
1171. Remove Zero Sum Consecutive Nodes from Linked List		1171. Remove Zero Sum Consecutive Nodes from Linked List
118. Pascal's Triangle		118. Pascal's Triangle
121. Best Time to Buy and Sell Stock		121. Best Time to Buy and Sell Stock
1249. Minimum Remove to Make Valid Parentheses		1249. Minimum Remove to Make Valid Parentheses
125. Valid Palindrome		125. Valid Palindrome
129. Sum Root to Leaf Numbers		129. Sum Root to Leaf Numbers
1295. Find Numbers with Even Number of Digits		1295. Find Numbers with Even Number of Digits
1299. Replace Elements with Greatest Element on Right Side		1299. Replace Elements with Greatest Element on Right Side
1342. Number of Steps to Reduce a Number to Zero		1342. Number of Steps to Reduce a Number to Zero
1346. Check If N and Its Double Exist		1346. Check If N and Its Double Exist
1356. Sort Integers by The Number of 1 Bits		1356. Sort Integers by The Number of 1 Bits
14. Longest Common Prefix		14. Longest Common Prefix
141. Linked List Cycle		141. Linked List Cycle
1415. The k-th Lexicographical String of All Happy Strings of Length n		1415. The k-th Lexicographical String of All Happy Strings of Length n
143. Reorder List		143. Reorder List
146. LRU Cache		146. LRU Cache
1461. Check If a String Contains All Binary Codes of Size K		1461. Check If a String Contains All Binary Codes of Size K
1480. Running Sum of 1d Array		1480. Running Sum of 1d Array
1481. Least Number of Unique Integers after K Removals		1481. Least Number of Unique Integers after K Removals
1536. Minimum Swaps to Arrange a Binary Grid		1536. Minimum Swaps to Arrange a Binary Grid
1544. Make The String Great		1544. Make The String Great
1545. Find Kth Bit in Nth Binary String		1545. Find Kth Bit in Nth Binary String
1582. Special Positions in a Binary Matrix		1582. Special Positions in a Binary Matrix
1609. Even Odd Tree		1609. Even Odd Tree
1614. Maximum Nesting Depth of the Parentheses		1614. Maximum Nesting Depth of the Parentheses
1622. Fancy Sequence		1622. Fancy Sequence
1642. Furthest Building You Can Reach		1642. Furthest Building You Can Reach
1669. Merge In Between Linked Lists		1669. Merge In Between Linked Lists
167. Two Sum II - Input Array Is Sorted		167. Two Sum II - Input Array Is Sorted
1672. Richest Customer Wealth		1672. Richest Customer Wealth
1680. Concatenation of Consecutive Binary Numbers		1680. Concatenation of Consecutive Binary Numbers
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers		1689. Partitioning Into Minimum Number Of Deci-Binary Numbers
169. Majority Element		169. Majority Element
1700. Number of Students Unable to Eat Lunch		1700. Number of Students Unable to Eat Lunch
1727. Largest Submatrix With Rearrangements		1727. Largest Submatrix With Rearrangements
1750. Minimum Length of String After Deleting Similar Ends		1750. Minimum Length of String After Deleting Similar Ends
1758. Minimum Changes To Make Alternating Binary String		1758. Minimum Changes To Make Alternating Binary String
1784. Check if Binary String Has at Most One Segment of Ones		1784. Check if Binary String Has at Most One Segment of Ones
1878. Get Biggest Three Rhombus Sums in a Grid		1878. Get Biggest Three Rhombus Sums in a Grid
1888. Minimum Number of Flips to Make the Binary String Alternating		1888. Minimum Number of Flips to Make the Binary String Alternating
189. Rotate Array		189. Rotate Array
19. Remove Nth Node From End of List		19. Remove Nth Node From End of List
1971. Find if Path Exists in Graph		1971. Find if Path Exists in Graph
1980. Find Unique Binary String		1980. Find Unique Binary String
1992. Find All Groups of Farmland		1992. Find All Groups of Farmland
2. Add Two Numbers		2. Add Two Numbers
20. Valid Parentheses		20. Valid Parentheses
200. Number of Islands		200. Number of Islands
201. Bitwise AND of Numbers Range		201. Bitwise AND of Numbers Range
205. Isomorphic Strings		205. Isomorphic Strings
206. Reverse Linked List		206. Reverse Linked List
2073. Time Needed to Buy Tickets		2073. Time Needed to Buy Tickets
21. Merge Two Sorted Lists		21. Merge Two Sorted Lists
2108. Find First Palindromic String in the Array		2108. Find First Palindromic String in the Array
2149. Rearrange Array Elements by Sign		2149. Rearrange Array Elements by Sign
219. Contains Duplicate II		219. Contains Duplicate II
2235. Add Two Integers		2235. Add Two Integers
2236. Root Equals Sum of Children		2236. Root Equals Sum of Children
226. Invert Binary Tree		226. Invert Binary Tree
228. Summary Ranges		228. Summary Ranges
231. Power of Two		231. Power of Two
234. Palindrome Linked List		234. Palindrome Linked List
2370. Longest Ideal Subsequence		2370. Longest Ideal Subsequence
238. Product of Array Except Self		238. Product of Array Except Self
2402. Meeting Rooms III		2402. Meeting Rooms III
242. Valid Anagram		242. Valid Anagram
2444. Count Subarrays With Fixed Bounds		2444. Count Subarrays With Fixed Bounds
2485. Find the Pivot Integer		2485. Find the Pivot Integer
2540. Minimum Common Value		2540. Minimum Common Value
26. Remove Duplicates from Sorted Array		26. Remove Duplicates from Sorted Array
268. Missing Number		268. Missing Number
27. Remove Element		27. Remove Element
283. Move Zeroes		283. Move Zeroes
2864. Maximum Odd Binary Number		2864. Maximum Odd Binary Number
287. Find the Duplicate Number		287. Find the Duplicate Number
290. Word Pattern		290. Word Pattern
2958. Length of Longest Subarray With at Most K Frequency		2958. Length of Longest Subarray With at Most K Frequency
2962. Count Subarrays Where Max Element Appears at Least K Times		2962. Count Subarrays Where Max Element Appears at Least K Times
2971. Find Polygon With the Largest Perimeter		2971. Find Polygon With the Largest Perimeter
3005. Count Elements With Maximum Frequency		3005. Count Elements With Maximum Frequency
3070. Count Submatrices with Top-Left Element and Sum Less Than k		3070. Count Submatrices with Top-Left Element and Sum Less Than k
310. Minimum Height Trees		310. Minimum Height Trees
3129. Find All Possible Stable Binary Arrays I		3129. Find All Possible Stable Binary Arrays I
3130. Find All Possible Stable Binary Arrays II		3130. Find All Possible Stable Binary Arrays II
3296. Minimum Number of Seconds to Make Mountain Height Zero		3296. Minimum Number of Seconds to Make Mountain Height Zero
349. Intersection of Two Arrays		349. Intersection of Two Arrays
3600. Maximize Spanning Tree Stability with Upgrades		3600. Maximize Spanning Tree Stability with Upgrades
383. Ransom Note		383. Ransom Note
3852. Smallest Pair With Different Frequencies		3852. Smallest Pair With Different Frequencies
3854. Minimum Operations to Make Array Parity Alternating		3854. Minimum Operations to Make Array Parity Alternating