GitHub - Rishabh068/DSA-questions: This repo contains important DSA questions asked in coding test and interviews of many companies

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 337 Commits
0041-first-missing-positive		0041-first-missing-positive
0044-wildcard-matching		0044-wildcard-matching
0050-powx-n		0050-powx-n
0062-unique-paths		0062-unique-paths
0063-unique-paths-ii		0063-unique-paths-ii
0064-minimum-path-sum		0064-minimum-path-sum
0078-subsets		0078-subsets
0084-largest-rectangle-in-histogram		0084-largest-rectangle-in-histogram
0085-maximal-rectangle		0085-maximal-rectangle
0115-distinct-subsequences		0115-distinct-subsequences
0120-triangle		0120-triangle
0127-word-ladder		0127-word-ladder
0129-sum-root-to-leaf-numbers		0129-sum-root-to-leaf-numbers
0140-word-break-ii		0140-word-break-ii
0165-compare-version-numbers		0165-compare-version-numbers
0200-number-of-islands		0200-number-of-islands
0205-isomorphic-strings		0205-isomorphic-strings
0213-house-robber-ii		0213-house-robber-ii
0237-delete-node-in-a-linked-list		0237-delete-node-in-a-linked-list
0300-longest-increasing-subsequence		0300-longest-increasing-subsequence
0322-coin-change		0322-coin-change
0368-largest-divisible-subset		0368-largest-divisible-subset
0377-combination-sum-iv		0377-combination-sum-iv
0402-remove-k-digits		0402-remove-k-digits
0404-sum-of-left-leaves		0404-sum-of-left-leaves
0435-non-overlapping-intervals		0435-non-overlapping-intervals
0463-island-perimeter		0463-island-perimeter
0494-target-sum		0494-target-sum
0514-freedom-trail		0514-freedom-trail
0516-longest-palindromic-subsequence		0516-longest-palindromic-subsequence
0518-coin-change-ii		0518-coin-change-ii
0623-add-one-row-to-tree		0623-add-one-row-to-tree
0673-number-of-longest-increasing-subsequence		0673-number-of-longest-increasing-subsequence
0678-valid-parenthesis-string		0678-valid-parenthesis-string
0713-subarray-product-less-than-k		0713-subarray-product-less-than-k
0752-open-the-lock		0752-open-the-lock
0786-k-th-smallest-prime-fraction		0786-k-th-smallest-prime-fraction
0834-sum-of-distances-in-tree		0834-sum-of-distances-in-tree
0857-minimum-cost-to-hire-k-workers		0857-minimum-cost-to-hire-k-workers
0860-lemonade-change		0860-lemonade-change
0861-score-after-flipping-matrix		0861-score-after-flipping-matrix
0881-boats-to-save-people		0881-boats-to-save-people
0931-minimum-falling-path-sum		0931-minimum-falling-path-sum
0950-reveal-cards-in-increasing-order		0950-reveal-cards-in-increasing-order
0979-distribute-coins-in-binary-tree		0979-distribute-coins-in-binary-tree
1043-partition-array-for-maximum-sum		1043-partition-array-for-maximum-sum
1048-longest-string-chain		1048-longest-string-chain
1137-n-th-tribonacci-number		1137-n-th-tribonacci-number
1143-longest-common-subsequence		1143-longest-common-subsequence
1249-minimum-remove-to-make-valid-parentheses		1249-minimum-remove-to-make-valid-parentheses
1312-minimum-insertion-steps-to-make-a-string-palindrome		1312-minimum-insertion-steps-to-make-a-string-palindrome
1547-minimum-cost-to-cut-a-stick		1547-minimum-cost-to-cut-a-stick
1863-sum-of-all-subset-xor-totals		1863-sum-of-all-subset-xor-totals
1971-find-if-path-exists-in-graph		1971-find-if-path-exists-in-graph
1992-find-all-groups-of-farmland		1992-find-all-groups-of-farmland
2073-time-needed-to-buy-tickets		2073-time-needed-to-buy-tickets
2220-minimum-bit-flips-to-convert-number		2220-minimum-bit-flips-to-convert-number
2331-evaluate-boolean-binary-tree		2331-evaluate-boolean-binary-tree
2373-largest-local-values-in-a-matrix		2373-largest-local-values-in-a-matrix
2441-largest-positive-integer-that-exists-with-its-negative		2441-largest-positive-integer-that-exists-with-its-negative
2597-the-number-of-beautiful-subsets		2597-the-number-of-beautiful-subsets
2812-find-the-safest-path-in-a-grid		2812-find-the-safest-path-in-a-grid
2958-length-of-longest-subarray-with-at-most-k-frequency		2958-length-of-longest-subarray-with-at-most-k-frequency
2997-minimum-number-of-operations-to-make-array-xor-equal-to-k		2997-minimum-number-of-operations-to-make-array-xor-equal-to-k
3068-find-the-maximum-sum-of-node-values		3068-find-the-maximum-sum-of-node-values
3075-maximize-happiness-of-selected-children		3075-maximize-happiness-of-selected-children
3083-existence-of-a-substring-in-a-string-and-its-reverse		3083-existence-of-a-substring-in-a-string-and-its-reverse
3084-count-substrings-starting-and-ending-with-given-character		3084-count-substrings-starting-and-ending-with-given-character
3091-apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k		3091-apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k
3092-most-frequent-ids		3092-most-frequent-ids
3sum		3sum
4sum		4sum
Intersection Point in Y Shapped Linked Lists		Intersection Point in Y Shapped Linked Lists
LRU cache		LRU cache
Minimum Falling Path Sum		Minimum Falling Path Sum
Minimum number of days to make n bouquets		Minimum number of days to make n bouquets
Remove duplicates from an unsorted linked list		Remove duplicates from an unsorted linked list
Repeated DNA sequences		Repeated DNA sequences
Rotate array by k		Rotate array by k
activity selection		activity selection
add 1 to linked list		add 1 to linked list
aggressive cows		aggressive cows
best time to buy and sell stocks		best time to buy and sell stocks
book allocation problem		book allocation problem
celebrity problem		celebrity problem
cheapest flight within k stops		cheapest flight within k stops
check if a ll is palindrome		check if a ll is palindrome
check if a tree is a bst		check if a tree is a bst
climbing stairs		climbing stairs
codechef tictactoe		codechef tictactoe
coin change top down		coin change top down
convert roman numeral into decimal		convert roman numeral into decimal
count good substrings		count good substrings
count number of nice subarrays		count number of nice subarrays
count subsequences having product less than k		count subsequences having product less than k
count triplets with sum less than x		count triplets with sum less than x
diameter of a binary tree		diameter of a binary tree
die hard spoj		die hard spoj
dijkstras algorithm		dijkstras algorithm
edit distance dp		edit distance dp