Name		Name	Last commit message	Last commit date
Latest commit History 676 Commits
.github/workflows		.github/workflows
.24. Swap Nodes in Pairs		.24. Swap Nodes in Pairs
01 DEC 1704. Determine if String Halves Are Alike		01 DEC 1704. Determine if String Halves Are Alike
100. Same Tree 10 jan		100. Same Tree 10 jan
101. Symmetric Tree 13 march		101. Symmetric Tree 13 march
1011. Capacity To Ship Packages Within D Days 22 feb		1011. Capacity To Ship Packages Within D Days 22 feb
1020. Number of Enclaves 7 Apr		1020. Number of Enclaves 7 Apr
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 16 feb		104. Maximum Depth of Binary Tree 16 feb
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
1061. Lexicographically Smallest Equivalent String		1061. Lexicographically Smallest Equivalent String
1071. Greatest Common Divisor of Strings		1071. Greatest Common Divisor of Strings
1071. Greatest Common Divisor of Strings 2 feb		1071. Greatest Common Divisor of Strings 2 feb
109. Convert Sorted List to Binary Search Tree 11 march		109. Convert Sorted List to Binary Search Tree 11 march
1091. Shortest Path in Binary Matrix		1091. Shortest Path in Binary Matrix
1095. Find in Mountain Array		1095. Find in Mountain Array
11 DEC 124. Binary Tree Maximum Path Sum		11 DEC 124. Binary Tree Maximum Path Sum
1125. Smallest Sufficient Team		1125. Smallest Sufficient Team
1137. N-th Tribonacci Number 30 jan		1137. N-th Tribonacci Number 30 jan
1140. Stone Game II		1140. Stone Game II
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
1162. As Far from Land as Possible 11 feb		1162. As Far from Land as Possible 11 feb
118. Pascal's Triangle		118. Pascal's Triangle
1186. Maximum Subarray Sum with One Deletion		1186. Maximum Subarray Sum with One Deletion
1187. Make Array Strictly Increasing		1187. Make Array Strictly Increasing
119. Pascal's Triangle II		119. Pascal's Triangle II
12 DEC 70. Climbing Stairs		12 DEC 70. Climbing Stairs
12 January Minimize the sum		12 January Minimize the sum
1203. Sort Items by Groups Respecting Dependencies		1203. Sort Items by Groups Respecting Dependencies
121. Best Time to Buy and Sell Stock 25 feb		121. Best Time to Buy and Sell Stock 25 feb
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
1254. Number of Closed Islands 6 apr		1254. Number of Closed Islands 6 apr
1269. Number of Ways to Stay in the Same Place After Some Steps		1269. Number of Ways to Stay in the Same Place After Some Steps
129. Sum Root to Leaf Numbers 14 march		129. Sum Root to Leaf Numbers 14 march
13 DEC 931. Minimum Falling Path Sum		13 DEC 931. Minimum Falling Path Sum
131. Palindrome Partitioning		131. Palindrome Partitioning
1312. Minimum Insertion Steps to Make a String Palindrome(22 Apr)		1312. Minimum Insertion Steps to Make a String Palindrome(22 Apr)
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 23 march		1319. Number of Operations to Make Network Connected 23 march
1326. Minimum Number of Taps to Open to Water a Garden		1326. Minimum Number of Taps to Open to Water a Garden
133. Clone Graph 8Apr		133. Clone Graph 8Apr
1337. The K Weakest Rows in a Matrix		1337. The K Weakest Rows in a Matrix
1339. Maximum Product of Splitted Binary Tree		1339. Maximum Product of Splitted Binary Tree
134. Gas Station 7 jan		134. Gas Station 7 jan
1345. Jump Game IV 5 th march		1345. Jump Game IV 5 th march
135. Candy		135. Candy
1351. Count Negative Numbers in a Sorted Matrix		1351. Count Negative Numbers in a Sorted Matrix
1359. Count All Valid Pickup and Delivery Options		1359. Count All Valid Pickup and Delivery Options
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
139. Word Break		139. Word Break
1396. Design Underground System		1396. Design Underground System
14 NOV Most Stones Removed with Same Row or Column		14 NOV Most Stones Removed with Same Row or Column
1402. Reducing Dishes 29march		1402. Reducing Dishes 29march
1406. Stone Game III		1406. Stone Game III
141. Linked List Cycle		141. Linked List Cycle
1416. Restore The Array		1416. Restore The Array
142. Linked List Cycle II		142. Linked List Cycle II
1420.You are given three integers n, m and k. Consider the following algorithm to find the maximum element of an array of positive integers.		1420.You are given three integers n, m and k. Consider the following algorithm to find the maximum element of an array of positive integers.
1425. Constrained Subsequence Sum		1425. Constrained Subsequence Sum
1431. Kids With the Greatest Number of Candies		1431. Kids With the Greatest Number of Candies
144. Binary Tree Preorder Traversal		144. Binary Tree Preorder Traversal
1443. Minimum Time to Collect All Apples in a Tree 12 jan		1443. Minimum Time to Collect All Apples in a Tree 12 jan
1444. Number of Ways of Cutting a Pizza 31 march		1444. Number of Ways of Cutting a Pizza 31 march
1456. Maximum Number of Vowels in a Substring of Given Length		1456. Maximum Number of Vowels in a Substring of Given Length
1458. Max Dot Product of Two Subsequences		1458. Max Dot Product of Two Subsequences
1458. Max Dot Product of Two Subsequences Hard		1458. Max Dot Product of Two Subsequences Hard
1466. Reorder Routes to Make All Paths Lead to the City Zero 24 march		1466. Reorder Routes to Make All Paths Lead to the City Zero 24 march
1470. Shuffle the Array 6 feb		1470. Shuffle the Array 6 feb
1472. Design Browser History 18 march		1472. Design Browser History 18 march
1472. Design Browser History 19 march		1472. Design Browser History 19 march
1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree		1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree
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
1498. Number of Subsequences That Satisfy the Given Sum Condition		1498. Number of Subsequences That Satisfy the Given Sum Condition
15 Nov Count Complete Tree Nodes		15 Nov Count Complete Tree Nodes
1502. Can Make Arithmetic Progression From Sequence		1502. Can Make Arithmetic Progression From Sequence
1514. Path with Maximum Probability		1514. Path with Maximum Probability
1519. Number of Nodes in the Sub-Tree With the Same Label 12 jan		1519. Number of Nodes in the Sub-Tree With the Same Label 12 jan
1523. Count Odd Numbers in an Interval Range		1523. Count Odd Numbers in an Interval Range
1523. Count Odd Numbers in an Interval Range 14 feb 2023		1523. Count Odd Numbers in an Interval Range 14 feb 2023
1539. Kth Missing Positive Number		1539. Kth Missing Positive Number
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
1579. Remove Max Number of Edges to Keep Graph Fully Traversable		1579. Remove Max Number of Edges to Keep Graph Fully Traversable
1584. Min Cost to Connect All Points		1584. Min Cost to Connect All Points
1601. Maximum Number of Achievable Transfer Requests		1601. Maximum Number of Achievable Transfer Requests

sumanjeet0012/LeetCode-challenge

Folders and files

Latest commit

History

Repository files navigation

LeetCode-challenge-

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages