Repository navigation

data-structures-algorithms

Public

About

No description, website, or topics provided.

0 stars

1 watching

Report repository

Name		Name	Last commit message	Last commit date
.github/workflows		.github/workflows
0001-two-sum		0001-two-sum
0020-valid-parentheses		0020-valid-parentheses
0021-merge-two-sorted-lists		0021-merge-two-sorted-lists
0036-valid-sudoku		0036-valid-sudoku
0046-permutations		0046-permutations
0053-maximum-subarray		0053-maximum-subarray
0070-climbing-stairs		0070-climbing-stairs
0074-search-a-2d-matrix		0074-search-a-2d-matrix
0077-combinations		0077-combinations
0083-remove-duplicates-from-sorted-list		0083-remove-duplicates-from-sorted-list
0088-merge-sorted-array		0088-merge-sorted-array
0094-binary-tree-inorder-traversal		0094-binary-tree-inorder-traversal
0101-symmetric-tree		0101-symmetric-tree
0102-binary-tree-level-order-traversal		0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree		0104-maximum-depth-of-binary-tree
0118-pascals-triangle		0118-pascals-triangle
0120-triangle		0120-triangle
0121-best-time-to-buy-and-sell-stock		0121-best-time-to-buy-and-sell-stock
0136-single-number		0136-single-number
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
0190-reverse-bits		0190-reverse-bits
0191-number-of-1-bits		0191-number-of-1-bits
0198-house-robber		0198-house-robber
0203-remove-linked-list-elements		0203-remove-linked-list-elements
0206-reverse-linked-list		0206-reverse-linked-list
0217-contains-duplicate		0217-contains-duplicate
0226-invert-binary-tree		0226-invert-binary-tree
0231-power-of-two		0231-power-of-two
0232-implement-queue-using-stacks		0232-implement-queue-using-stacks
0242-valid-anagram		0242-valid-anagram
0268-missing-number		0268-missing-number
0287-find-the-duplicate-number		0287-find-the-duplicate-number
0349-intersection-of-two-arrays		0349-intersection-of-two-arrays
0350-intersection-of-two-arrays-ii		0350-intersection-of-two-arrays-ii
0383-ransom-note		0383-ransom-note
0387-first-unique-character-in-a-string		0387-first-unique-character-in-a-string
0566-reshape-the-matrix		0566-reshape-the-matrix
0653-two-sum-iv-input-is-a-bst		0653-two-sum-iv-input-is-a-bst
0692-top-k-frequent-words		0692-top-k-frequent-words
0784-letter-case-permutation		0784-letter-case-permutation
1-two-sum		1-two-sum
100-same-tree		100-same-tree
101-symmetric-tree		101-symmetric-tree
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
111-minimum-depth-of-binary-tree		111-minimum-depth-of-binary-tree
1137-n-th-tribonacci-number		1137-n-th-tribonacci-number
116-populating-next-right-pointers-in-each-node		116-populating-next-right-pointers-in-each-node
14-longest-common-prefix		14-longest-common-prefix
143-reorder-list		143-reorder-list
15-3sum		15-3sum
167-two-sum-ii-input-array-is-sorted		167-two-sum-ii-input-array-is-sorted
1796-second-largest-digit-in-a-string		1796-second-largest-digit-in-a-string
1805-number-of-different-integers-in-a-string		1805-number-of-different-integers-in-a-string
189-rotate-array		189-rotate-array
19-remove-nth-node-from-end-of-list		19-remove-nth-node-from-end-of-list
1971-find-if-path-exists-in-graph		1971-find-if-path-exists-in-graph
2-add-two-numbers		2-add-two-numbers
20-valid-parentheses		20-valid-parentheses
2007-find-original-array-from-doubled-array		2007-find-original-array-from-doubled-array
203-remove-linked-list-elements		203-remove-linked-list-elements
206-reverse-linked-list		206-reverse-linked-list
2089-find-target-indices-after-sorting-array		2089-find-target-indices-after-sorting-array
2095-delete-the-middle-node-of-a-linked-list		2095-delete-the-middle-node-of-a-linked-list
21-merge-two-sorted-lists		21-merge-two-sorted-lists
2259-remove-digit-from-number-to-maximize-result		2259-remove-digit-from-number-to-maximize-result
2351-first-letter-to-appear-twice		2351-first-letter-to-appear-twice
237-delete-node-in-a-linked-list		237-delete-node-in-a-linked-list
242-valid-anagram		242-valid-anagram
26-remove-duplicates-from-sorted-array		26-remove-duplicates-from-sorted-array
27-remove-element		27-remove-element
278-first-bad-version		278-first-bad-version
283-move-zeroes		283-move-zeroes
3-longest-substring-without-repeating-characters		3-longest-substring-without-repeating-characters
326-power-of-three		326-power-of-three
34-find-first-and-last-position-of-element-in-sorted-array		34-find-first-and-last-position-of-element-in-sorted-array
344-reverse-string		344-reverse-string
35-search-insert-position		35-search-insert-position
374-guess-number-higher-or-lower		374-guess-number-higher-or-lower
383-ransom-note		383-ransom-note
387-first-unique-character-in-a-string		387-first-unique-character-in-a-string
509-fibonacci-number		509-fibonacci-number
542-01-matrix		542-01-matrix
543-diameter-of-binary-tree		543-diameter-of-binary-tree
557-reverse-words-in-a-string-iii		557-reverse-words-in-a-string-iii
567-permutation-in-string		567-permutation-in-string
58-length-of-last-word		58-length-of-last-word
617-merge-two-binary-trees		617-merge-two-binary-trees
653-two-sum-iv-input-is-a-bst		653-two-sum-iv-input-is-a-bst
66-plus-one		66-plus-one
67-add-binary		67-add-binary
69-sqrtx		69-sqrtx
695-max-area-of-island		695-max-area-of-island
7-reverse-integer		7-reverse-integer
70-climbing-stairs		70-climbing-stairs
704-binary-search		704-binary-search
733-flood-fill		733-flood-fill

Repository files navigation

Data Structures & Algorithms

Solutions for leetcode problems

About

No description, website, or topics provided.

0 stars

1 watching

Report repository

Releases

Packages

Contributors

Languages