LeetCode Solutions Repository: A curated collection of efficient and well-documented solutions to various LeetCode coding challenges. Explore optimized code for problem-solving, aiding programmers in honing their skills and enhancing their problem-solving abilities.

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Repository files navigation

leetcodesolved

About

Uh oh!

Releases

Packages

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 426 Commits
100. Same Tree		100. Same Tree
101. Symmetric Tree		101. Symmetric Tree
1011. Capacity To Ship Packages Within D Days		1011. Capacity To Ship Packages Within D Days
1026. Maximum Difference Between Node and Ancestor		1026. Maximum Difference Between Node and Ancestor
1027. Longest Arithmetic Subsequence		1027. Longest Arithmetic Subsequence
103. Binary Tree Zigzag Level Order Traversal		103. Binary Tree Zigzag Level Order Traversal
1035. Uncrossed Lines		1035. Uncrossed Lines
104. Maximum Depth of Binary Tree		104. Maximum Depth of Binary Tree
1043. Partition Array for Maximum Sum		1043. Partition Array for Maximum Sum
1046. Last Stone Weight		1046. Last Stone Weight
1048.Longest-string-chain		1048.Longest-string-chain
106. Construct Binary Tree from Inorder and Postorder Traversal		106. Construct Binary Tree from Inorder and Postorder Traversal
1071. Greatest Common Divisor of Strings		1071. Greatest Common Divisor of Strings
109. Convert Sorted List to Binary Search Tree		109. Convert Sorted List to Binary Search Tree
1091. Shortest Path in Binary Matrix		1091. Shortest Path in Binary Matrix
1095. Find in Mountain Array		1095. Find in Mountain Array
111. Minimum Depth of Binary Tree		111. Minimum Depth of Binary Tree
1125. Smallest Sufficient Team		1125. Smallest Sufficient Team
1137. N-th Tribonacci Number		1137. N-th Tribonacci Number
1143. Longest Common Subsequence		1143. Longest Common Subsequence
1143.Longest Common Subsequence		1143.Longest Common Subsequence
1146. Snapshot Array		1146. Snapshot Array
1161. Maximum Level Sum of a Binary Tree		1161. Maximum Level Sum of a Binary Tree
1162. As Far from Land as Possible		1162. As Far from Land as Possible
118. Pascal's Triangle		118. Pascal's Triangle
1187. Make Array Strictly Increasing		1187. Make Array Strictly Increasing
119. Pascal's Triangle II		119. Pascal's Triangle II
1203. Sort Items by Groups Respecting Dependencies		1203. Sort Items by Groups Respecting Dependencies
1207. Unique Number of Occurrences		1207. Unique Number of Occurrences
1207.Unique Number of Subsequences		1207.Unique Number of Subsequences
121. Best Time to Buy and Sell Stock		121. Best Time to Buy and Sell Stock
1218. Longest Arithmetic Subsequence of Given Difference		1218. Longest Arithmetic Subsequence of Given Difference
1220. Count Vowels Permutation		1220. Count Vowels Permutation
1232. Check If It Is a Straight Line		1232. Check If It Is a Straight Line
1235. Maximum Profit in Job Scheduling		1235. Maximum Profit in Job Scheduling
124. Binary Tree Maximum Path Sum		124. Binary Tree Maximum Path Sum
1254. Number of Closed Islands		1254. Number of Closed Islands
1266. Minimum Time Visiting All Points		1266. Minimum Time Visiting All Points
1287. Element Appearing More Than 25% In Sorted Array		1287. Element Appearing More Than 25% In Sorted Array
129. Sum Root to Leaf Numbers		129. Sum Root to Leaf Numbers
1291. Sequential Digits		1291. Sequential Digits
1312. Minimum Insertion Steps to Make a String Palindrome		1312. Minimum Insertion Steps to Make a String Palindrome
1318. Minimum Flips to Make a OR b Equal to c		1318. Minimum Flips to Make a OR b Equal to c
1319. Number of Operations to Make Network Connected		1319. Number of Operations to Make Network Connected
133. Clone Graph		133. Clone Graph
1335. Minimum Difficulty of a Job Schedule		1335. Minimum Difficulty of a Job Schedule
1339. Maximum Product of Splitted Binary Tree		1339. Maximum Product of Splitted Binary Tree
134. Gas Station		134. Gas Station
1345. Jump Game IV		1345. Jump Game IV
1347. Minimum Number of Steps to Make Two Strings Anagram		1347. Minimum Number of Steps to Make Two Strings Anagram
1351. Count Negative Numbers in a Sorted Matrix		1351. Count Negative Numbers in a Sorted Matrix
1361. Validate Binary Tree Nodes		1361. Validate Binary Tree Nodes
1372. Longest ZigZag Path in a Binary Tree		1372. Longest ZigZag Path in a Binary Tree
1376. Time Needed to Inform All Employees		1376. Time Needed to Inform All Employees
138. Copy List with Random Pointer		138. Copy List with Random Pointer
1402. Reducing Dishes		1402. Reducing Dishes
1406. Stone Game III		1406. Stone Game III
141. Linked List Cycle		141. Linked List Cycle
1416. Restore The Array		1416. Restore The Array
1422. Maximum Score After Splitting a String		1422. Maximum Score After Splitting a String
1424. Diagonal Traverse II		1424. Diagonal Traverse II
1425. Constrained Subsequence Sum		1425. Constrained Subsequence Sum
143. Reorder List		143. Reorder List
1431. Kids With the Greatest Number of Candies		1431. Kids With the Greatest Number of Candies
1436. Destination City		1436. Destination City
144. Binary Tree Preorder Traversal		144. Binary Tree Preorder Traversal
1441. Build an Array With Stack Operations		1441. Build an Array With Stack Operations
1443. Minimum Time to Collect All Apples in a Tree		1443. Minimum Time to Collect All Apples in a Tree
1444. Number of Ways of Cutting a Pizza		1444. Number of Ways of Cutting a Pizza
1456. Maximum Number of Vowels in a Substring of Given Length		1456. Maximum Number of Vowels in a Substring of Given Length
1457. Pseudo-Palindromic Paths in a Binary Tree		1457. Pseudo-Palindromic Paths in a Binary Tree
1458. Max Dot Product of Two Subsequences		1458. Max Dot Product of Two Subsequences
146. LRU Cache		146. LRU Cache
1463. Cherry Pickup II		1463. Cherry Pickup II
1466. Reorder Routes to Make All Paths Lead to the City Zero		1466. Reorder Routes to Make All Paths Lead to the City Zero
1470. Shuffle the Array		1470. Shuffle the Array
1481. Least Number of Unique Integers after K Removals		1481. Least Number of Unique Integers after K Removals
1489.find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree		1489.find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree
149. Max Points on a Line		149. Max Points on a Line
1491. Average Salary Excluding the Minimum and Maximum Salary		1491. Average Salary Excluding the Minimum and Maximum Salary
1493. Longest Subarray of 1's After Deleting One Element		1493. Longest Subarray of 1's After Deleting One Element
1496. Path Crossing		1496. Path Crossing
1498. Number of Subsequences That Satisfy the Given Sum Condition		1498. Number of Subsequences That Satisfy the Given Sum Condition
150. Evaluate Reverse Polish Notation		150. Evaluate Reverse Polish Notation
1502. Can Make Arithmetic Progression From Sequence		1502. Can Make Arithmetic Progression From Sequence
1503. Last Moment Before All Ants Fall Out of a Plank		1503. Last Moment Before All Ants Fall Out of a Plank
1514. Path with Maximum Probability		1514. Path with Maximum Probability
1519. Number of Nodes in the Sub-Tree With the Same Label		1519. Number of Nodes in the Sub-Tree With the Same Label
1523. Count Odd Numbers in an Interval Range		1523. Count Odd Numbers in an Interval Range
1531. String Compression II		1531. String Compression II
1535. Find the Winner of an Array Games		1535. Find the Winner of an Array Games
1544. Make The String Great		1544. Make The String Great
1547. Minimum Cost to Cut a Stick		1547. Minimum Cost to Cut a Stick
1557. Minimum Number of Vertices to Reach All Nodes		1557. Minimum Number of Vertices to Reach All Nodes
1569. Number of Ways to Reorder Array to Get Same BST		1569. Number of Ways to Reorder Array to Get Same BST
1572. Matrix Diagonal Sum		1572. Matrix Diagonal Sum
1575. Count All Possible Routes		1575. Count All Possible Routes
1578. Minimum Time to Make Rope Colorful		1578. Minimum Time to Make Rope Colorful
1579. Remove Max Number of Edges to Keep Graph Fully Traversable		1579. Remove Max Number of Edges to Keep Graph Fully Traversable
1601. Maximum Number of Achievable Transfer Requests		1601. Maximum Number of Achievable Transfer Requests

artificialcoder02/leetcodesolved

Folders and files

Latest commit

History

Repository files navigation

leetcodesolved

About

Topics

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages