Leetcode solutions 👨‍💻

As far as data structures and algorithms are concerned they are highly required to crack coding interviews for big tech companies.
Rather than just submitting my solutions I have made this repo to save them in a structured way so any beginner can have a look on these solutions and try to solve the quetsions
CPP and STL have been used for most of the questions
The solutions consist of my approach as well as the most optimized approach

Name		Name	Last commit message	Last commit date
Latest commit History 2,964 Commits
0012-integer-to-roman		0012-integer-to-roman
0023-merge-k-sorted-lists		0023-merge-k-sorted-lists
0035-search-insert-position		0035-search-insert-position
0038-count-and-say		0038-count-and-say
0045-jump-game-ii		0045-jump-game-ii
0049-group-anagrams		0049-group-anagrams
0054-spiral-matrix		0054-spiral-matrix
0067-add-binary		0067-add-binary
0076-minimum-window-substring		0076-minimum-window-substring
0087-scramble-string		0087-scramble-string
0093-restore-ip-addresses		0093-restore-ip-addresses
0101-symmetric-tree		0101-symmetric-tree
0103-binary-tree-zigzag-level-order-traversal		0103-binary-tree-zigzag-level-order-traversal
0109-convert-sorted-list-to-binary-search-tree		0109-convert-sorted-list-to-binary-search-tree
0129-sum-root-to-leaf-numbers		0129-sum-root-to-leaf-numbers
0131-palindrome-partitioning		0131-palindrome-partitioning
0133-clone-graph		0133-clone-graph
0136-single-number		0136-single-number
0203-remove-linked-list-elements		0203-remove-linked-list-elements
0219-contains-duplicate-ii		0219-contains-duplicate-ii
0237-delete-node-in-a-linked-list		0237-delete-node-in-a-linked-list
0322-coin-change		0322-coin-change
0334-increasing-triplet-subsequence		0334-increasing-triplet-subsequence
0352-data-stream-as-disjoint-intervals		0352-data-stream-as-disjoint-intervals
0409-longest-palindrome		0409-longest-palindrome
0433-minimum-genetic-mutation		0433-minimum-genetic-mutation
0460-lfu-cache		0460-lfu-cache
0472-concatenated-words		0472-concatenated-words
0502-ipo		0502-ipo
0523-continuous-subarray-sum		0523-continuous-subarray-sum
0645-set-mismatch		0645-set-mismatch
0673-number-of-longest-increasing-subsequence		0673-number-of-longest-increasing-subsequence
0692-top-k-frequent-words		0692-top-k-frequent-words
0707-design-linked-list		0707-design-linked-list
0812-largest-triangle-area		0812-largest-triangle-area
0835-image-overlap		0835-image-overlap
0912-sort-an-array		0912-sort-an-array
0953-verifying-an-alien-dictionary		0953-verifying-an-alien-dictionary
0958-check-completeness-of-a-binary-tree		0958-check-completeness-of-a-binary-tree
0976-largest-perimeter-triangle		0976-largest-perimeter-triangle
0988-smallest-string-starting-from-leaf		0988-smallest-string-starting-from-leaf
0994-rotting-oranges		0994-rotting-oranges
0997-find-the-town-judge		0997-find-the-town-judge
1-two-sum		1-two-sum
1002-find-common-characters		1002-find-common-characters
1007-minimum-domino-rotations-for-equal-row		1007-minimum-domino-rotations-for-equal-row
1008-construct-binary-search-tree-from-preorder-traversal		1008-construct-binary-search-tree-from-preorder-traversal
1009-complement-of-base-10-integer		1009-complement-of-base-10-integer
101-symmetric-tree		101-symmetric-tree
1011-capacity-to-ship-packages-within-d-days		1011-capacity-to-ship-packages-within-d-days
1019-next-greater-node-in-linked-list		1019-next-greater-node-in-linked-list
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1020-number-of-enclaves		1020-number-of-enclaves
1024-video-stitching		1024-video-stitching
1029-two-city-scheduling		1029-two-city-scheduling
103-binary-tree-zigzag-level-order-traversal		103-binary-tree-zigzag-level-order-traversal
1038-binary-search-tree-to-greater-sum-tree		1038-binary-search-tree-to-greater-sum-tree
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1046-last-stone-weight		1046-last-stone-weight
1048-longest-string-chain		1048-longest-string-chain
1049-last-stone-weight-ii		1049-last-stone-weight-ii
105-construct-binary-tree-from-preorder-and-inorder-traversal		105-construct-binary-tree-from-preorder-and-inorder-traversal
106-construct-binary-tree-from-inorder-and-postorder-traversal		106-construct-binary-tree-from-inorder-and-postorder-traversal
107-binary-tree-level-order-traversal-ii		107-binary-tree-level-order-traversal-ii
1071-greatest-common-divisor-of-strings		1071-greatest-common-divisor-of-strings
1074-number-of-submatrices-that-sum-to-target		1074-number-of-submatrices-that-sum-to-target
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
1081-smallest-subsequence-of-distinct-characters		1081-smallest-subsequence-of-distinct-characters
109-convert-sorted-list-to-binary-search-tree		109-convert-sorted-list-to-binary-search-tree
1091-shortest-path-in-binary-matrix		1091-shortest-path-in-binary-matrix
11-container-with-most-water		11-container-with-most-water
110-balanced-binary-tree		110-balanced-binary-tree
1108-defanging-an-ip-address		1108-defanging-an-ip-address
111-minimum-depth-of-binary-tree		111-minimum-depth-of-binary-tree
1110-delete-nodes-and-return-forest		1110-delete-nodes-and-return-forest
112-path-sum		112-path-sum
1123-lowest-common-ancestor-of-deepest-leaves		1123-lowest-common-ancestor-of-deepest-leaves
113-path-sum-ii		113-path-sum-ii
1137-n-th-tribonacci-number		1137-n-th-tribonacci-number
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
1143-longest-common-subsequence		1143-longest-common-subsequence
1155-number-of-dice-rolls-with-target-sum		1155-number-of-dice-rolls-with-target-sum
116-populating-next-right-pointers-in-each-node		116-populating-next-right-pointers-in-each-node
1161-maximum-level-sum-of-a-binary-tree		1161-maximum-level-sum-of-a-binary-tree
117-populating-next-right-pointers-in-each-node-ii		117-populating-next-right-pointers-in-each-node-ii
118-pascals-triangle		118-pascals-triangle
119-pascals-triangle-ii		119-pascals-triangle-ii
1192-critical-connections-in-a-network		1192-critical-connections-in-a-network
12-integer-to-roman		12-integer-to-roman
120-triangle		120-triangle
1202-smallest-string-with-swaps		1202-smallest-string-with-swaps
1207-unique-number-of-occurrences		1207-unique-number-of-occurrences
1209-remove-all-adjacent-duplicates-in-string-ii		1209-remove-all-adjacent-duplicates-in-string-ii
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
122-best-time-to-buy-and-sell-stock-ii		122-best-time-to-buy-and-sell-stock-ii
1220-count-vowels-permutation		1220-count-vowels-permutation
123-best-time-to-buy-and-sell-stock-iii		123-best-time-to-buy-and-sell-stock-iii
1239-maximum-length-of-a-concatenated-string-with-unique-characters		1239-maximum-length-of-a-concatenated-string-with-unique-characters
124-binary-tree-maximum-path-sum		124-binary-tree-maximum-path-sum
1249-minimum-remove-to-make-valid-parentheses		1249-minimum-remove-to-make-valid-parentheses

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Leetcode solutions 👨‍💻

About

Releases

Packages

Languages

tanishq252/myLeetcodeSolutions

Folders and files

Latest commit

History

Repository files navigation

Leetcode solutions 👨‍💻

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages