GitHub - kaustav202/Problem-Solving-Techniques: Solutions to interesting coding problems, techniques used to solve and my approach.

kaustav202 / Problem-Solving-Techniques Public

Notifications You must be signed in to change notification settings
Fork 0
Star 1

Solutions to interesting coding problems, techniques used to solve and my approach.

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 648 Commits
0003-longest-substring-without-repeating-characters		0003-longest-substring-without-repeating-characters
0005-longest-palindromic-substring		0005-longest-palindromic-substring
0007-reverse-integer		0007-reverse-integer
0011-container-with-most-water		0011-container-with-most-water
0012-integer-to-roman		0012-integer-to-roman
0014-longest-common-prefix		0014-longest-common-prefix
0016-3sum-closest		0016-3sum-closest
0017-letter-combinations-of-a-phone-number		0017-letter-combinations-of-a-phone-number
0019-remove-nth-node-from-end-of-list		0019-remove-nth-node-from-end-of-list
0021-merge-two-sorted-lists		0021-merge-two-sorted-lists
0023-merge-k-sorted-lists		0023-merge-k-sorted-lists
0024-swap-nodes-in-pairs		0024-swap-nodes-in-pairs
0026-remove-duplicates-from-sorted-array		0026-remove-duplicates-from-sorted-array
0031-next-permutation		0031-next-permutation
0032-longest-valid-parentheses		0032-longest-valid-parentheses
0033-search-in-rotated-sorted-array		0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array		0034-find-first-and-last-position-of-element-in-sorted-array
0036-valid-sudoku		0036-valid-sudoku
0038-count-and-say		0038-count-and-say
0045-jump-game-ii		0045-jump-game-ii
0048-rotate-image		0048-rotate-image
0049-group-anagrams		0049-group-anagrams
0050-powx-n		0050-powx-n
0052-n-queens-ii		0052-n-queens-ii
0053-maximum-subarray		0053-maximum-subarray
0054-spiral-matrix		0054-spiral-matrix
0055-jump-game		0055-jump-game
0056-merge-intervals		0056-merge-intervals
0059-spiral-matrix-ii		0059-spiral-matrix-ii
0060-permutation-sequence		0060-permutation-sequence
0061-rotate-list		0061-rotate-list
0064-minimum-path-sum		0064-minimum-path-sum
0067-add-binary		0067-add-binary
0069-sqrtx		0069-sqrtx
0070-climbing-stairs		0070-climbing-stairs
0072-edit-distance		0072-edit-distance
0074-search-a-2d-matrix		0074-search-a-2d-matrix
0075-sort-colors		0075-sort-colors
0080-remove-duplicates-from-sorted-array-ii		0080-remove-duplicates-from-sorted-array-ii
0082-remove-duplicates-from-sorted-list-ii		0082-remove-duplicates-from-sorted-list-ii
0083-remove-duplicates-from-sorted-list		0083-remove-duplicates-from-sorted-list
0086-partition-list		0086-partition-list
0088-merge-sorted-array		0088-merge-sorted-array
0089-gray-code		0089-gray-code
0090-subsets-ii		0090-subsets-ii
0094-binary-tree-inorder-traversal		0094-binary-tree-inorder-traversal
0095-unique-binary-search-trees-ii		0095-unique-binary-search-trees-ii
0096-unique-binary-search-trees		0096-unique-binary-search-trees
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
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
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
0111-minimum-depth-of-binary-tree		0111-minimum-depth-of-binary-tree
0113-path-sum-ii		0113-path-sum-ii
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
0119-pascals-triangle-ii		0119-pascals-triangle-ii
0122-best-time-to-buy-and-sell-stock-ii		0122-best-time-to-buy-and-sell-stock-ii
0125-valid-palindrome		0125-valid-palindrome
0128-longest-consecutive-sequence		0128-longest-consecutive-sequence
0129-sum-root-to-leaf-numbers		0129-sum-root-to-leaf-numbers
0131-palindrome-partitioning		0131-palindrome-partitioning
0135-candy		0135-candy
0142-linked-list-cycle-ii		0142-linked-list-cycle-ii
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal		0145-binary-tree-postorder-traversal
0148-sort-list		0148-sort-list
0152-maximum-product-subarray		0152-maximum-product-subarray
0153-find-minimum-in-rotated-sorted-array		0153-find-minimum-in-rotated-sorted-array
0162-find-peak-element		0162-find-peak-element
0169-majority-element		0169-majority-element
0171-excel-sheet-column-number		0171-excel-sheet-column-number
0187-repeated-dna-sequences		0187-repeated-dna-sequences
0190-reverse-bits		0190-reverse-bits
0191-number-of-1-bits		0191-number-of-1-bits
0199-binary-tree-right-side-view		0199-binary-tree-right-side-view
0200-number-of-islands		0200-number-of-islands
0202-happy-number		0202-happy-number
0206-reverse-linked-list		0206-reverse-linked-list
0208-implement-trie-prefix-tree		0208-implement-trie-prefix-tree
0210-course-schedule-ii		0210-course-schedule-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
0225-implement-stack-using-queues		0225-implement-stack-using-queues
0226-invert-binary-tree		0226-invert-binary-tree
0229-majority-element-ii		0229-majority-element-ii
0230-kth-smallest-element-in-a-bst		0230-kth-smallest-element-in-a-bst
0231-power-of-two		0231-power-of-two
0232-implement-queue-using-stacks		0232-implement-queue-using-stacks
0234-palindrome-linked-list		0234-palindrome-linked-list
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
0242-valid-anagram		0242-valid-anagram
0258-add-digits		0258-add-digits

Repository files navigation

About

Solutions to interesting coding problems, techniques used to solve and my approach.

Activity

1 star

1 watching

0 forks

Report repository

Releases

No releases published

Packages

No packages published

kaustav202/Problem-Solving-Techniques

Folders and files

Latest commit

History