Name		Name	Last commit message	Last commit date
Latest commit History 393 Commits
1. Two sum		1. Two sum
100. Same tree		100. Same tree
101. Symmetric tree		101. Symmetric tree
102. Binary tree level order traversal		102. Binary tree level order traversal
1021. Remove outermost parentheses		1021. Remove outermost parentheses
1038. Binary search tree to greater sum tree		1038. Binary search tree to greater sum tree
1051. Height checker		1051. Height checker
1052. Grumpy bookstore owner		1052. Grumpy bookstore owner
1072. Flip columns for maximum number of equal rows		1072. Flip columns for maximum number of equal rows
11. Container with most water		11. Container with most water
1105. Filling bookcase shelves		1105. Filling bookcase shelves
1106. Parsing a boolean expression		1106. Parsing a boolean expression
1110. Delete nodes and return forest		1110. Delete nodes and return forest
1122. Relative sort array		1122. Relative sort array
1137. N-th tribonacci number		1137. N-th tribonacci number
1140. Stone game II		1140. Stone game II
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
1190. Reverse substrings between each pair of parentheses		1190. Reverse substrings between each pair of parentheses
1208. Get equal substrings within budget		1208. Get equal substrings within budget
121. Best time to buy and sell stock		121. Best time to buy and sell stock
1219. Path with maximum gold		1219. Path with maximum gold
122. Best time to buy and sell stock II		122. Best time to buy and sell stock II
1233. Remove sub-folders from the filesystem		1233. Remove sub-folders from the filesystem
1248. Count number of nice subarrays		1248. Count number of nice subarrays
1249. Minimum remove to make valid parentheses		1249. Minimum remove to make valid parentheses
125. Valid palindrome		125. Valid palindrome
1255. Maximum score words formed by letters		1255. Maximum score words formed by letters
1277. Count square submatrices with all ones		1277. Count square submatrices with all ones
1289. Minimum falling path sum II		1289. Minimum falling path sum II
129. Sum root to leaf numbers		129. Sum root to leaf numbers
131. Palindome partitioning		131. Palindome partitioning
1310. XOR queries of a subarray		1310. XOR queries of a subarray
1325. Delete leaves with a given value		1325. Delete leaves with a given value
1331. Rank transform of an array		1331. Rank transform of an array
1334. Find the city with the smallest number of neighbors at a threshold distance		1334. Find the city with the smallest number of neighbors at a threshold distance
1346. Check if n and its double exist		1346. Check if n and its double exist
136. Single number		136. Single number
1367. Linked list in binary tree		1367. Linked list in binary tree
1371. Find the longest substring containing vowels in even counts		1371. Find the longest substring containing vowels in even counts
1381. Design a stack with increment operation		1381. Design a stack with increment operation
1382. Balance a binary search tree		1382. Balance a binary search tree
1395. Count number of teams		1395. Count number of teams
14. Longest common prefix		14. Longest common prefix
140. Word break II		140. Word break II
1404. Number of steps to reduce a number in binary representation to one		1404. Number of steps to reduce a number in binary representation to one
1405. Longest happy string		1405. Longest happy string
141. Linked list cycle		141. Linked list cycle
142. Linked list cycle II		142. Linked list cycle II
143. Reorder list		143. Reorder list
1438. Longest continuous subarray with absolute diff less than or equal to limit		1438. Longest continuous subarray with absolute diff less than or equal to limit
144. Binary tree preorder traversal		144. Binary tree preorder traversal
1442. Count triplets that can form two arrays of equal XOR		1442. Count triplets that can form two arrays of equal XOR
145. Binary tree postorder traversal		145. Binary tree postorder traversal
1460. Make two arrays equal by reversing subarrays		1460. Make two arrays equal by reversing subarrays
1475. Final prices with a special discount in a shop		1475. Final prices with a special discount in a shop
1482. Minimum number of days to make m bouquets		1482. Minimum number of days to make m bouquets
1497. Check if array pairs are divisible by k		1497. Check if array pairs are divisible by k
15. 3Sum		15. 3Sum
1508. Range sum of sorted subarray sums		1508. Range sum of sorted subarray sums
1509. Minimum difference between largest and smallest in three moves		1509. Minimum difference between largest and smallest in three moves
1514. Path with maximum probability		1514. Path with maximum probability
1518. Water bottles		1518. Water bottles
153. Find minimum in rotated sorted array		153. Find minimum in rotated sorted array
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
1550. Three consecutive odds		1550. Three consecutive odds
1552. Magnetic force between two balls		1552. Magnetic force between two balls
1568. Minimum number of days to disconnect island		1568. Minimum number of days to disconnect island
1574. Shortest subarray to be removed to make array sorted		1574. Shortest subarray to be removed to make array sorted
1579. Remove max number of edges to keep graph fully traversable		1579. Remove max number of edges to keep graph fully traversable
1590. Make sum divisible by p		1590. Make sum divisible by p
1593. Split a string into the max number of unique substrings		1593. Split a string into the max number of unique substrings
1598. Crawler log folder		1598. Crawler log folder
1608. Special array with x elements greater than or equal to x		1608. Special array with x elements greater than or equal to x
1614. Maximum nesting depth of the parentheses		1614. Maximum nesting depth of the parentheses
162. Find peak element		162. Find peak element
1636. Sort array by increasing frequency		1636. Sort array by increasing frequency
165. Compare version numbers		165. Compare version numbers
1652. Defuse the bomb		1652. Defuse the bomb
1653. Minimum deletions to make string balanced		1653. Minimum deletions to make string balanced
1669. Merge in between linked lists		1669. Merge in between linked lists
1671. Minimum number of removals to make mountain array		1671. Minimum number of removals to make mountain array
1684. Count the number of consistent strings		1684. Count the number of consistent strings
169. Majority element		169. Majority element
1700. Number of students unable to eat lunch		1700. Number of students unable to eat lunch
1701. Average waiting time		1701. Average waiting time
1717. Maximum score from removing substrings		1717. Maximum score from removing substrings
1750. Minimum length of string after deleting similar ends		1750. Minimum length of string after deleting similar ends
1752. Check if array is sorted and rotated		1752. Check if array is sorted and rotated
1760. Minimum limit of balls in a bag		1760. Minimum limit of balls in a bag
179. Largest number		179. Largest number
1791. Find center of star graph		1791. Find center of star graph
1792. Maximum average pass ratio		1792. Maximum average pass ratio
1813. Sentence similarity III		1813. Sentence similarity III
1823. Find the winner of the circular game		1823. Find the winner of the circular game
1829. Maximum XOR for each query		1829. Maximum XOR for each query
1861. Rotating the box		1861. Rotating the box
1863. Sum of all subset XOR totals		1863. Sum of all subset XOR totals
189. Rotate array		189. Rotate array

dishathakurata/Leetcode

Folders and files

Latest commit

History

Repository files navigation

Leetcode

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Packages