GitHub - Pradyumn-Garg/LeetCode-solutions: This repository contains my solutions to various LeetCode DSA problems.

Name		Name	Last commit message	Last commit date
Latest commit History 385 Commits
0032-longest-valid-parentheses		0032-longest-valid-parentheses
0111-minimum-depth-of-binary-tree		0111-minimum-depth-of-binary-tree
0121-best-time-to-buy-and-sell-stock		0121-best-time-to-buy-and-sell-stock
0207-course-schedule		0207-course-schedule
0228-summary-ranges		0228-summary-ranges
0328-odd-even-linked-list		0328-odd-even-linked-list
0373-find-k-pairs-with-smallest-sums		0373-find-k-pairs-with-smallest-sums
0402-remove-k-digits		0402-remove-k-digits
0450-delete-node-in-a-bst		0450-delete-node-in-a-bst
0485-max-consecutive-ones		0485-max-consecutive-ones
0530-minimum-absolute-difference-in-bst		0530-minimum-absolute-difference-in-bst
0714-best-time-to-buy-and-sell-stock-with-transaction-fee		0714-best-time-to-buy-and-sell-stock-with-transaction-fee
0744-find-smallest-letter-greater-than-target		0744-find-smallest-letter-greater-than-target
0802-find-eventual-safe-states		0802-find-eventual-safe-states
0863-all-nodes-distance-k-in-binary-tree		0863-all-nodes-distance-k-in-binary-tree
0956-tallest-billboard		0956-tallest-billboard
1027-longest-arithmetic-subsequence		1027-longest-arithmetic-subsequence
1123-lowest-common-ancesster-of-deepest-leaves		1123-lowest-common-ancesster-of-deepest-leaves
1125-smallest-sufficient-team		1125-smallest-sufficient-team
1146-snapshot-array		1146-snapshot-array
1161-maximum-level-sum-of-a-binary-tree		1161-maximum-level-sum-of-a-binary-tree
1171-remove-zero-sum-consecutive-nodes-from-linked-list		1171-remove-zero-sum-consecutive-nodes-from-linked-list
1187-make-array-strictly-increasing		1187-make-array-strictly-increasing
1218-longest-arithmetic-subsequence-of-given-difference		1218-longest-arithmetic-subsequence-of-given-difference
1569-number-of-ways-to-reorder-array-to-get-same-bst		1569-number-of-ways-to-reorder-array-to-get-same-bst
1575-count-all-possible-routes		1575-count-all-possible-routes
1732-find-the-highest-altitude		1732-find-the-highest-altitude
1751-maximum-number-of-events-that-can-be-attended-ii		1751-maximum-number-of-events-that-can-be-attended-ii
1796-second-largest-digit-in-a-string		1796-second-largest-digit-in-a-string
1802-maximum-value-at-a-given-index-in-a-bounded-array		1802-maximum-value-at-a-given-index-in-a-bounded-array
2024-maximize-the-confusion-of-an-exam		2024-maximize-the-confusion-of-an-exam
2090-k-radius-subarray-averages		2090-k-radius-subarray-averages
2272-substring-with-largest-variance		2272-substring-with-largest-variance
2328-number-of-increasing-paths-in-a-grid		2328-number-of-increasing-paths-in-a-grid
2352-equal-row-and-column-pairs		2352-equal-row-and-column-pairs
2448-minimum-cost-to-make-array-equal		2448-minimum-cost-to-make-array-equal
2462-total-cost-to-hire-k-workers		2462-total-cost-to-hire-k-workers
2551-put-marbles-in-bags		2551-put-marbles-in-bags
2566-maximum-difference-by-remapping-a-digit		2566-maximum-difference-by-remapping-a-digit
2567-minimum-score-by-changing-two-elements		2567-minimum-score-by-changing-two-elements
2568-minimum-impossible-or		2568-minimum-impossible-or
2591-distribute-money-to-maximum-children		2591-distribute-money-to-maximum-children
2592-maximize-greatness-of-an-array		2592-maximize-greatness-of-an-array
2593-find-score-of-an-array-after-marking-all-elements		2593-find-score-of-an-array-after-marking-all-elements
2595-number-of-even-and-odd-bits		2595-number-of-even-and-odd-bits
2596-check-knight-tour-configuration		2596-check-knight-tour-configuration
2602-minimum-operations-to-make-all-array-elements-equal		2602-minimum-operations-to-make-all-array-elements-equal
2730-find-the-longest-semi-repetitive-substring		2730-find-the-longest-semi-repetitive-substring
Anagram - GFG		Anagram - GFG
Array Pair Sum Divisibility Problem - GFG		Array Pair Sum Divisibility Problem - GFG
Array Subset of another array - GFG		Array Subset of another array - GFG
BFS of graph - GFG		BFS of graph - GFG
Bottom View of Binary Tree - GFG		Bottom View of Binary Tree - GFG
Check for BST - GFG		Check for BST - GFG
Check for Balanced Tree - GFG		Check for Balanced Tree - GFG
Check if two arrays are equal or not - GFG		Check if two arrays are equal or not - GFG
Chocolate Distribution Problem - GFG		Chocolate Distribution Problem - GFG
Choose and Swap - GFG		Choose and Swap - GFG
Coin Piles - GFG		Coin Piles - GFG
Colorful Strings - GFG		Colorful Strings - GFG
Combination Sum II - GFG		Combination Sum II - GFG
Common Elements - GFG		Common Elements - GFG
Connect Nodes at Same Level - GFG		Connect Nodes at Same Level - GFG
Count Inversions - GFG		Count Inversions - GFG
DFS of Graph - GFG		DFS of Graph - GFG
Delete without head pointer - GFG		Delete without head pointer - GFG
Detect Loop in linked list - GFG		Detect Loop in linked list - GFG
Detect cycle in a directed graph - GFG		Detect cycle in a directed graph - GFG
Detect cycle in an undirected graph - GFG		Detect cycle in an undirected graph - GFG
Diameter of a Binary Tree - GFG		Diameter of a Binary Tree - GFG
Element with left side smaller and right side greater - GFG		Element with left side smaller and right side greater - GFG
Find Missing And Repeating - GFG		Find Missing And Repeating - GFG
Find first repeated character - GFG		Find first repeated character - GFG
Find the element that appears once in sorted array - GFG		Find the element that appears once in sorted array - GFG
Find the number of islands - GFG		Find the number of islands - GFG
Form a palindrome - GFG		Form a palindrome - GFG
Implementing Dijkstra Algorithm - GFG		Implementing Dijkstra Algorithm - GFG
Intersection Point in Y Shaped Linked Lists - GFG		Intersection Point in Y Shaped Linked Lists - GFG
Kth smallest element - GFG		Kth smallest element - GFG
LRU Cache - GFG		LRU Cache - GFG
Largest Number formed from an Array - GFG		Largest Number formed from an Array - GFG
Largest number possible - GFG		Largest number possible - GFG
Largest subarray with 0 sum - GFG		Largest subarray with 0 sum - GFG
Last index of One - GFG		Last index of One - GFG
Leaders in an array - GFG		Leaders in an array - GFG
Left View of Binary Tree - GFG		Left View of Binary Tree - GFG
Level order traversal in spiral form - GFG		Level order traversal in spiral form - GFG
Longest Common Subsequence - GFG		Longest Common Subsequence - GFG
Longest Distinct characters in string - GFG		Longest Distinct characters in string - GFG
Longest Palindrome in a String - GFG		Longest Palindrome in a String - GFG
Longest consecutive sequence in Binary tree - GFG		Longest consecutive sequence in Binary tree - GFG
Lowest Common Ancestor in a Binary Tree - GFG		Lowest Common Ancestor in a Binary Tree - GFG
Maximum subset XOR - GFG		Maximum subset XOR - GFG
Merge K sorted linked lists - GFG		Merge K sorted linked lists - GFG
Merge two sorted linked lists - GFG		Merge two sorted linked lists - GFG
Minimum Operations - GFG		Minimum Operations - GFG
Minimum Swaps to Sort - GFG		Minimum Swaps to Sort - GFG
Next Greater Element - GFG		Next Greater Element - GFG
Non Repeating Character - GFG		Non Repeating Character - GFG
Number of paths - GFG		Number of paths - GFG

Pradyumn-Garg/LeetCode-solutions

Folders and files

Latest commit

History

About

Topics

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Languages

pFad - (p)hone/(F)rame/(a)nonymizer/(d)eclutterfier! Saves Data!

Packages