Problem_Solving_DSA

This repo store all problems i solved on DSA for ITW prepartion

LeetCode Topics

Two Pointers

Problem Name	Difficulty
0283-move-zeroes	Easy
0881-boats-to-save-people	Medium
0917-reverse-only-letters	Easy
1768-merge-strings-alternately	Easy
2000-reverse-prefix-of-word	Easy
2540-minimum-common-value	Easy

String

Problem Name	Difficulty
0917-reverse-only-letters	Easy
1768-merge-strings-alternately	Easy
2000-reverse-prefix-of-word	Easy

Array

Problem Name	Difficulty
0283-move-zeroes	Easy
0881-boats-to-save-people	Medium
2540-minimum-common-value	Easy

Hash Table

Problem Name	Difficulty
2540-minimum-common-value	Easy

Binary Search

Problem Name	Difficulty
2540-minimum-common-value	Easy

Stack

Problem Name	Difficulty
2000-reverse-prefix-of-word	Easy

Greedy

Problem Name	Difficulty
0881-boats-to-save-people	Medium

Sorting

Problem Name	Difficulty
0881-boats-to-save-people	Medium

Name		Name	Last commit message	Last commit date
0001-two-sum		0001-two-sum
0002-add-two-numbers		0002-add-two-numbers
0003-longest-substring-without-repeating-characters		0003-longest-substring-without-repeating-characters
0004-median-of-two-sorted-arrays		0004-median-of-two-sorted-arrays
0005-longest-palindromic-substring		0005-longest-palindromic-substring
0006-zigzag-conversion		0006-zigzag-conversion
0014-longest-common-prefix		0014-longest-common-prefix
0017-letter-combinations-of-a-phone-number		0017-letter-combinations-of-a-phone-number
0020-valid-parentheses		0020-valid-parentheses
0022-generate-parentheses		0022-generate-parentheses
0024-swap-nodes-in-pairs		0024-swap-nodes-in-pairs
0035-search-insert-position		0035-search-insert-position
0039-combination-sum		0039-combination-sum
0044-wildcard-matching		0044-wildcard-matching
0045-jump-game-ii		0045-jump-game-ii
0046-permutations		0046-permutations
0047-permutations-ii		0047-permutations-ii
0052-n-queens-ii		0052-n-queens-ii
0056-merge-intervals		0056-merge-intervals
0057-insert-interval		0057-insert-interval
0062-unique-paths		0062-unique-paths
0063-unique-paths-ii		0063-unique-paths-ii
0064-minimum-path-sum		0064-minimum-path-sum
0065-valid-number		0065-valid-number
0068-text-justification		0068-text-justification
0070-climbing-stairs		0070-climbing-stairs
0071-simplify-path		0071-simplify-path
0072-edit-distance		0072-edit-distance
0074-search-a-2d-matrix		0074-search-a-2d-matrix
0077-combinations		0077-combinations
0078-subsets		0078-subsets
0079-word-search		0079-word-search
0083-remove-duplicates-from-sorted-list		0083-remove-duplicates-from-sorted-list
0091-decode-ways		0091-decode-ways
0092-reverse-linked-list-ii		0092-reverse-linked-list-ii
0094-binary-tree-inorder-traversal		0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree		0098-validate-binary-search-tree
0100-same-tree		0100-same-tree
0101-symmetric-tree		0101-symmetric-tree
0102-binary-tree-level-order-traversal		0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal		0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree		0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal		0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal		0106-construct-binary-tree-from-inorder-and-postorder-traversal
0107-binary-tree-level-order-traversal-ii		0107-binary-tree-level-order-traversal-ii
0108-convert-sorted-array-to-binary-search-tree		0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree		0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree		0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree		0111-minimum-depth-of-binary-tree
0112-path-sum		0112-path-sum
0114-flatten-binary-tree-to-linked-list		0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node		0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii		0117-populating-next-right-pointers-in-each-node-ii
0124-binary-tree-maximum-path-sum		0124-binary-tree-maximum-path-sum
0125-valid-palindrome		0125-valid-palindrome
0127-word-ladder		0127-word-ladder
0129-sum-root-to-leaf-numbers		0129-sum-root-to-leaf-numbers
0136-single-number		0136-single-number
0137-single-number-ii		0137-single-number-ii
0139-word-break		0139-word-break
0141-linked-list-cycle		0141-linked-list-cycle
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal		0145-binary-tree-postorder-traversal
0146-lru-cache		0146-lru-cache
0152-maximum-product-subarray		0152-maximum-product-subarray
0159-longest-substring-with-at-most-two-distinct-characters		0159-longest-substring-with-at-most-two-distinct-characters
0164-maximum-gap		0164-maximum-gap
0167-two-sum-ii-input-array-is-sorted		0167-two-sum-ii-input-array-is-sorted
0173-binary-search-tree-iterator		0173-binary-search-tree-iterator
0188-best-time-to-buy-and-sell-stock-iv		0188-best-time-to-buy-and-sell-stock-iv
0189-rotate-array		0189-rotate-array
0198-house-robber		0198-house-robber
0199-binary-tree-right-side-view		0199-binary-tree-right-side-view
0200-number-of-islands		0200-number-of-islands
0205-isomorphic-strings		0205-isomorphic-strings
0206-reverse-linked-list		0206-reverse-linked-list
0208-implement-trie-prefix-tree		0208-implement-trie-prefix-tree
0209-minimum-size-subarray-sum		0209-minimum-size-subarray-sum
0213-house-robber-ii		0213-house-robber-ii
0215-kth-largest-element-in-an-array		0215-kth-largest-element-in-an-array
0216-combination-sum-iii		0216-combination-sum-iii
0222-count-complete-tree-nodes		0222-count-complete-tree-nodes
0226-invert-binary-tree		0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst		0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree		0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree		0236-lowest-common-ancestor-of-a-binary-tree
0239-sliding-window-maximum		0239-sliding-window-maximum
0250-count-univalue-subtrees		0250-count-univalue-subtrees
0252-meeting-rooms		0252-meeting-rooms
0253-meeting-rooms-ii		0253-meeting-rooms-ii
0257-binary-tree-paths		0257-binary-tree-paths
0268-missing-number		0268-missing-number
0270-closest-binary-search-tree-value		0270-closest-binary-search-tree-value
0283-move-zeroes		0283-move-zeroes
0285-inorder-successor-in-bst		0285-inorder-successor-in-bst
0289-game-of-life		0289-game-of-life
0290-word-pattern		0290-word-pattern
0295-find-median-from-data-stream		0295-find-median-from-data-stream
0298-binary-tree-longest-consecutive-sequence		0298-binary-tree-longest-consecutive-sequence
0300-longest-increasing-subsequence		0300-longest-increasing-subsequence

Navigation Menu

Repository files navigation

Problem_Solving_DSA

LeetCode Topics

Two Pointers

String

Array

Hash Table

Binary Search

Stack

Greedy

Sorting

About

Releases

Packages

Contributors

Languages

Latest commit

History

Folders and files

Repository files navigation

Problem_Solving_DSA

LeetCode Topics

Two Pointers

String

Array

Hash Table

Binary Search

Stack

Greedy

Sorting

About

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages