CODING CHALLENGES

ABOUT THE PROJECT

LeetCode is a site made up of problems specifically designed to prepare software engineers for potential interview questions. There are currently more than two thousand challenges available, all designed to test a candidate’s knowledge of efficiency, patterns, and problem-solving. Reference

On top of that, LeetCode is an important website to hone problem solving and critical thinking skills.

This REPO contains the questions, descriptions, pseudocode, solutions of the problems I have attempted on LeetCode.

PURPOSE

Hone my problem-solving skills

Practice Test Driven Development approach

Prepare for technical interview

Help myself keep track of my progress and stay consistent

I am a fan of GitHub

APPRECIATION

My appreciation goes to LeetHub for making such an amazing plugin that links github to leetcode.

Name		Name	Last commit message	Last commit date
Latest commit History 347 Commits
0001-two-sum		0001-two-sum
0002-add-two-numbers		0002-add-two-numbers
0005-longest-palindromic-substring		0005-longest-palindromic-substring
0006-zigzag-conversion		0006-zigzag-conversion
0008-string-to-integer-atoi		0008-string-to-integer-atoi
0015-3sum		0015-3sum
0016-3sum-closest		0016-3sum-closest
0019-remove-nth-node-from-end-of-list		0019-remove-nth-node-from-end-of-list
0020-valid-parentheses		0020-valid-parentheses
0021-merge-two-sorted-lists		0021-merge-two-sorted-lists
0022-generate-parentheses		0022-generate-parentheses
0026-remove-duplicates-from-sorted-array		0026-remove-duplicates-from-sorted-array
0027-remove-element		0027-remove-element
0028-find-the-index-of-the-first-occurrence-in-a-string		0028-find-the-index-of-the-first-occurrence-in-a-string
0033-search-in-rotated-sorted-array		0033-search-in-rotated-sorted-array
0045-jump-game-ii		0045-jump-game-ii
0046-permutations		0046-permutations
0049-group-anagrams		0049-group-anagrams
0050-powx-n		0050-powx-n
0051-n-queens		0051-n-queens
0053-maximum-subarray		0053-maximum-subarray
0055-jump-game		0055-jump-game
0058-length-of-last-word		0058-length-of-last-word
0066-plus-one		0066-plus-one
0069-sqrtx		0069-sqrtx
0070-climbing-stairs		0070-climbing-stairs
0075-sort-colors		0075-sort-colors
0078-subsets		0078-subsets
0080-remove-duplicates-from-sorted-array-ii		0080-remove-duplicates-from-sorted-array-ii
0088-merge-sorted-array		0088-merge-sorted-array
0090-subsets-ii		0090-subsets-ii
0092-reverse-linked-list-ii		0092-reverse-linked-list-ii
0098-validate-binary-search-tree		0098-validate-binary-search-tree
0106-construct-binary-tree-from-inorder-and-postorder-traversal		0106-construct-binary-tree-from-inorder-and-postorder-traversal
0109-convert-sorted-list-to-binary-search-tree		0109-convert-sorted-list-to-binary-search-tree
0121-best-time-to-buy-and-sell-stock		0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii		0122-best-time-to-buy-and-sell-stock-ii
0136-single-number		0136-single-number
0141-linked-list-cycle		0141-linked-list-cycle
0142-linked-list-cycle-ii		0142-linked-list-cycle-ii
0146-lru-cache		0146-lru-cache
0147-insertion-sort-list		0147-insertion-sort-list
0151-reverse-words-in-a-string		0151-reverse-words-in-a-string
0155-min-stack		0155-min-stack
0167-two-sum-ii-input-array-is-sorted		0167-two-sum-ii-input-array-is-sorted
0169-majority-element		0169-majority-element
0189-rotate-array		0189-rotate-array
0191-number-of-1-bits		0191-number-of-1-bits
0198-house-robber		0198-house-robber
0200-number-of-islands		0200-number-of-islands
0207-course-schedule		0207-course-schedule
0208-implement-trie-prefix-tree		0208-implement-trie-prefix-tree
0210-course-schedule-ii		0210-course-schedule-ii
0213-house-robber-ii		0213-house-robber-ii
0225-implement-stack-using-queues		0225-implement-stack-using-queues
0226-invert-binary-tree		0226-invert-binary-tree
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
0238-product-of-array-except-self		0238-product-of-array-except-self
0242-valid-anagram		0242-valid-anagram
0257-binary-tree-paths		0257-binary-tree-paths
0268-missing-number		0268-missing-number
0287-find-the-duplicate-number		0287-find-the-duplicate-number
0290-word-pattern		0290-word-pattern
0322-coin-change		0322-coin-change
0337-house-robber-iii		0337-house-robber-iii
0347-top-k-frequent-elements		0347-top-k-frequent-elements
0383-ransom-note		0383-ransom-note
0389-find-the-difference		0389-find-the-difference
0392-is-subsequence		0392-is-subsequence
0430-flatten-a-multilevel-doubly-linked-list		0430-flatten-a-multilevel-doubly-linked-list
0435-non-overlapping-intervals		0435-non-overlapping-intervals
0445-add-two-numbers-ii		0445-add-two-numbers-ii
0451-sort-characters-by-frequency		0451-sort-characters-by-frequency
0452-minimum-number-of-arrows-to-burst-balloons		0452-minimum-number-of-arrows-to-burst-balloons
0516-longest-palindromic-subsequence		0516-longest-palindromic-subsequence
0653-two-sum-iv-input-is-a-bst		0653-two-sum-iv-input-is-a-bst
0811-subdomain-visit-count		0811-subdomain-visit-count
0876-middle-of-the-linked-list		0876-middle-of-the-linked-list
1-two-sum		1-two-sum
1008-construct-binary-search-tree-from-preorder-traversal		1008-construct-binary-search-tree-from-preorder-traversal
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1047-remove-all-adjacent-duplicates-in-string		1047-remove-all-adjacent-duplicates-in-string
11-container-with-most-water		11-container-with-most-water
111-minimum-depth-of-binary-tree		111-minimum-depth-of-binary-tree
1169-invalid-transactions		1169-invalid-transactions
1209-remove-all-adjacent-duplicates-in-string-ii		1209-remove-all-adjacent-duplicates-in-string-ii
1221-split-a-string-in-balanced-strings		1221-split-a-string-in-balanced-strings
1234-replace-the-substring-for-balanced-string		1234-replace-the-substring-for-balanced-string
125-valid-palindrome		125-valid-palindrome
1328-break-a-palindrome		1328-break-a-palindrome
134-gas-station		134-gas-station
1374-generate-a-string-with-characters-that-have-odd-counts		1374-generate-a-string-with-characters-that-have-odd-counts
15-3sum		15-3sum
152-maximum-product-subarray		152-maximum-product-subarray
1525-number-of-good-ways-to-split-a-string		1525-number-of-good-ways-to-split-a-string
1636-sort-array-by-increasing-frequency		1636-sort-array-by-increasing-frequency
1662-check-if-two-string-arrays-are-equivalent		1662-check-if-two-string-arrays-are-equivalent
167-two-sum-ii-input-array-is-sorted		167-two-sum-ii-input-array-is-sorted
1845-seat-reservation-manager		1845-seat-reservation-manager

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

CODING CHALLENGES

ABOUT THE PROJECT

PURPOSE

APPRECIATION

About

Releases

Packages

Languages

tinotenda-alfaneti/coding-challenges

Folders and files

Latest commit

History

Repository files navigation

CODING CHALLENGES

ABOUT THE PROJECT

PURPOSE

APPRECIATION

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages