GitHub - Merwan-J/competetive-programming: This repository contains solutions to various LeetCode interview questions, aimed at helping software engineers prepare for technical interviews. The solutions are written in Python and cover a wide range of topics such as data structures, algorithms, and problem-solving techniques.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 2,567 Commits
0001-two-sum		0001-two-sum
0011-container-with-most-water		0011-container-with-most-water
0015-3sum		0015-3sum
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
0020-valid-parentheses		0020-valid-parentheses
0021-merge-two-sorted-lists		0021-merge-two-sorted-lists
0024-swap-nodes-in-pairs		0024-swap-nodes-in-pairs
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
0036-valid-sudoku		0036-valid-sudoku
0038-count-and-say		0038-count-and-say
0039-combination-sum		0039-combination-sum
0042-trapping-rain-water		0042-trapping-rain-water
0045-jump-game-ii		0045-jump-game-ii
0046-permutations		0046-permutations
0054-spiral-matrix		0054-spiral-matrix
0055-jump-game		0055-jump-game
0057-insert-interval		0057-insert-interval
0059-spiral-matrix-ii		0059-spiral-matrix-ii
0067-add-binary		0067-add-binary
0068-text-justification		0068-text-justification
0071-simplify-path		0071-simplify-path
0072-edit-distance		0072-edit-distance
0073-set-matrix-zeroes		0073-set-matrix-zeroes
0075-sort-colors		0075-sort-colors
0076-minimum-window-substring		0076-minimum-window-substring
0078-subsets		0078-subsets
0079-word-search		0079-word-search
0080-remove-duplicates-from-sorted-array-ii		0080-remove-duplicates-from-sorted-array-ii
0084-largest-rectangle-in-histogram		0084-largest-rectangle-in-histogram
0088-merge-sorted-array		0088-merge-sorted-array
0093-restore-ip-addresses		0093-restore-ip-addresses
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
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
0110-balanced-binary-tree		0110-balanced-binary-tree
0118-pascals-triangle		0118-pascals-triangle
0121-best-time-to-buy-and-sell-stock		0121-best-time-to-buy-and-sell-stock
0124-binary-tree-maximum-path-sum		0124-binary-tree-maximum-path-sum
0125-valid-palindrome		0125-valid-palindrome
0128-longest-consecutive-sequence		0128-longest-consecutive-sequence
0131-palindrome-partitioning		0131-palindrome-partitioning
0132-palindrome-partitioning-ii		0132-palindrome-partitioning-ii
0134-gas-station		0134-gas-station
0136-single-number		0136-single-number
0137-single-number-ii		0137-single-number-ii
0141-linked-list-cycle		0141-linked-list-cycle
0143-reorder-list		0143-reorder-list
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0150-evaluate-reverse-polish-notation		0150-evaluate-reverse-polish-notation
0151-reverse-words-in-a-string		0151-reverse-words-in-a-string
0153-find-minimum-in-rotated-sorted-array		0153-find-minimum-in-rotated-sorted-array
0168-excel-sheet-column-title		0168-excel-sheet-column-title
0169-majority-element		0169-majority-element
0190-reverse-bits		0190-reverse-bits
0198-house-robber		0198-house-robber
0199-binary-tree-right-side-view		0199-binary-tree-right-side-view
0204-count-primes		0204-count-primes
0206-reverse-linked-list		0206-reverse-linked-list
0207-course-schedule		0207-course-schedule
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
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
0238-product-of-array-except-self		0238-product-of-array-except-self
0239-sliding-window-maximum		0239-sliding-window-maximum
0257-binary-tree-paths		0257-binary-tree-paths
0258-add-digits		0258-add-digits
0259-3sum-smaller		0259-3sum-smaller
0260-single-number-iii		0260-single-number-iii
0268-missing-number		0268-missing-number
0273-integer-to-english-words		0273-integer-to-english-words
0279-perfect-squares		0279-perfect-squares
0284-peeking-iterator		0284-peeking-iterator
0290-word-pattern		0290-word-pattern
0297-serialize-and-deserialize-binary-tree		0297-serialize-and-deserialize-binary-tree
0309-best-time-to-buy-and-sell-stock-with-cooldown		0309-best-time-to-buy-and-sell-stock-with-cooldown
0315-count-of-smaller-numbers-after-self		0315-count-of-smaller-numbers-after-self
0319-bulb-switcher		0319-bulb-switcher
0322-coin-change		0322-coin-change
0328-odd-even-linked-list		0328-odd-even-linked-list
0329-longest-increasing-path-in-a-matrix		0329-longest-increasing-path-in-a-matrix
0334-increasing-triplet-subsequence		0334-increasing-triplet-subsequence
0338-counting-bits		0338-counting-bits
0347-top-k-frequent-elements		0347-top-k-frequent-elements
0380-insert-delete-getrandom-o1		0380-insert-delete-getrandom-o1
0381-insert-delete-getrandom-o1-duplicates-allowed		0381-insert-delete-getrandom-o1-duplicates-allowed
0395-longest-substring-with-at-least-k-repeating-characters		0395-longest-substring-with-at-least-k-repeating-characters
0399-evaluate-division		0399-evaluate-division
0401-binary-watch		0401-binary-watch
0414-third-maximum-number		0414-third-maximum-number
0416-partition-equal-subset-sum		0416-partition-equal-subset-sum
0430-flatten-a-multilevel-doubly-linked-list		0430-flatten-a-multilevel-doubly-linked-list

About

This repository contains solutions to various LeetCode interview questions, aimed at helping software engineers prepare for technical interviews. The solutions are written in Python and cover a wide range of topics such as data structures, algorithms, and problem-solving techniques.