GitHub - bulbulT/technical-interview-prep: DSA 👩🏻‍💻 | Created using LeetHub

DSA Solutions synced to GitHub using LeetHub

Name		Name	Last commit message	Last commit date
Latest commit History 249 Commits
1537-get-the-maximum-score		1537-get-the-maximum-score
2108-find-first-palindromic-string-in-the-array		2108-find-first-palindromic-string-in-the-array
334-increasing-triplet-subsequence		334-increasing-triplet-subsequence
3sum		3sum
845-longest-mountain-in-array		845-longest-mountain-in-array
941-valid-mountain-array		941-valid-mountain-array
Check if array is sorted - GFG		Check if array is sorted - GFG
Largest Element in Array - GFG		Largest Element in Array - GFG
Print 1 To N Without Loop - GFG		Print 1 To N Without Loop - GFG
Print GFG n times - GFG		Print GFG n times - GFG
Second Largest - GFG		Second Largest - GFG
add-two-numbers		add-two-numbers
backspace-string-compare		backspace-string-compare
best-time-to-buy-and-sell-stock		best-time-to-buy-and-sell-stock
binary-search		binary-search
binary-tree-level-order-traversal		binary-tree-level-order-traversal
binary-tree-postorder-traversal		binary-tree-postorder-traversal
binary-tree-preorder-traversal		binary-tree-preorder-traversal
binary-tree-right-side-view		binary-tree-right-side-view
binary-tree-zigzag-level-order-traversal		binary-tree-zigzag-level-order-traversal
check-if-numbers-are-ascending-in-a-sentence		check-if-numbers-are-ascending-in-a-sentence
construct-binary-tree-from-inorder-and-postorder-traversal		construct-binary-tree-from-inorder-and-postorder-traversal
construct-binary-tree-from-preorder-and-inorder-traversal		construct-binary-tree-from-preorder-and-inorder-traversal
container-with-most-water		container-with-most-water
contains-duplicate		contains-duplicate
convert-sorted-array-to-binary-search-tree		convert-sorted-array-to-binary-search-tree
convert-sorted-list-to-binary-search-tree		convert-sorted-list-to-binary-search-tree
cousins-in-binary-tree		cousins-in-binary-tree
daily-temperatures		daily-temperatures
delete-node-in-a-linked-list		delete-node-in-a-linked-list
design-circular-queue		design-circular-queue
diameter-of-binary-tree		diameter-of-binary-tree
distribute-candies		distribute-candies
factorial-trailing-zeroes		factorial-trailing-zeroes
fibonacci-number		fibonacci-number
find-first-and-last-position-of-element-in-sorted-array		find-first-and-last-position-of-element-in-sorted-array
find-k-closest-elements		find-k-closest-elements
find-pivot-index		find-pivot-index
find-the-duplicate-number		find-the-duplicate-number
first-bad-version		first-bad-version
first-unique-character-in-a-string		first-unique-character-in-a-string
flipping-an-image		flipping-an-image
fruit-into-baskets		fruit-into-baskets
group-anagrams		group-anagrams
implement-trie-prefix-tree		implement-trie-prefix-tree
insert-into-a-binary-search-tree		insert-into-a-binary-search-tree
intersection-of-two-arrays-ii		intersection-of-two-arrays-ii
intersection-of-two-linked-lists		intersection-of-two-linked-lists
invert-binary-tree		invert-binary-tree
kth-largest-element-in-an-array		kth-largest-element-in-an-array
kth-smallest-element-in-a-bst		kth-smallest-element-in-a-bst
linked-list-cycle		linked-list-cycle
longest-substring-without-repeating-characters		longest-substring-without-repeating-characters
maximum-depth-of-binary-tree		maximum-depth-of-binary-tree
maximum-depth-of-n-ary-tree		maximum-depth-of-n-ary-tree
maximum-product-of-two-elements-in-an-array		maximum-product-of-two-elements-in-an-array
maximum-score-from-removing-stones		maximum-score-from-removing-stones
maximum-subarray		maximum-subarray
merge-sorted-array		merge-sorted-array
merge-two-binary-trees		merge-two-binary-trees
merge-two-sorted-lists		merge-two-sorted-lists
middle-of-the-linked-list		middle-of-the-linked-list
min-stack		min-stack
minimum-depth-of-binary-tree		minimum-depth-of-binary-tree
minimum-path-sum		minimum-path-sum
minimum-size-subarray-sum		minimum-size-subarray-sum
missing-number		missing-number
move-zeroes		move-zeroes
n-ary-tree-level-order-traversal		n-ary-tree-level-order-traversal
n-ary-tree-preorder-traversal		n-ary-tree-preorder-traversal
next-greater-element-i		next-greater-element-i
palindrome-linked-list		palindrome-linked-list
partition-labels		partition-labels
pascals-triangle		pascals-triangle
path-sum		path-sum
product-of-array-except-self		product-of-array-except-self
range-sum-of-bst		range-sum-of-bst
remove-all-adjacent-duplicates-in-string		remove-all-adjacent-duplicates-in-string
remove-duplicates-from-sorted-array		remove-duplicates-from-sorted-array
remove-duplicates-from-sorted-list		remove-duplicates-from-sorted-list
remove-k-digits		remove-k-digits
remove-linked-list-elements		remove-linked-list-elements
reshape-the-matrix		reshape-the-matrix
reverse-string		reverse-string
reverse-words-in-a-string		reverse-words-in-a-string
rotate-array		rotate-array
rotate-image		rotate-image
rotate-list		rotate-list
running-sum-of-1d-array		running-sum-of-1d-array
search-a-2d-matrix		search-a-2d-matrix
search-in-a-binary-search-tree		search-in-a-binary-search-tree
search-in-rotated-sorted-array		search-in-rotated-sorted-array
search-insert-position		search-insert-position
set-matrix-zeroes		set-matrix-zeroes
sort-characters-by-frequency		sort-characters-by-frequency
squares-of-a-sorted-array		squares-of-a-sorted-array
substrings-of-size-three-with-distinct-characters		substrings-of-size-three-with-distinct-characters
subtree-of-another-tree		subtree-of-another-tree
swap-nodes-in-pairs		swap-nodes-in-pairs
top-k-frequent-elements		top-k-frequent-elements

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

About

Uh oh!

Releases

Packages

Uh oh!

Contributors

Uh oh!

Languages

Folders and files

Latest commit

History

Repository files navigation

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Languages

Packages