Skip to content

yeabtsega07/Competetive_programing

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2,412 Commits
0001-two-sum
0001-two-sum
 
 
0002-add-two-numbers
0002-add-two-numbers
 
 
0003-longest-substring-without-repeating-characters
0003-longest-substring-without-repeating-characters
 
 
0004-median-of-two-sorted-arrays
0004-median-of-two-sorted-arrays
 
 
0005-longest-palindromic-substring
0005-longest-palindromic-substring
 
 
0009-palindrome-number
0009-palindrome-number
 
 
0011-container-with-most-water
0011-container-with-most-water
 
 
0013-roman-to-integer
0013-roman-to-integer
 
 
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
 
 
0022-generate-parentheses
0022-generate-parentheses
 
 
0026-remove-duplicates-from-sorted-array
0026-remove-duplicates-from-sorted-array
 
 
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
 
 
0034-find-first-and-last-position-of-element-in-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
 
 
0035-search-insert-position
0035-search-insert-position
 
 
0036-valid-sudoku
0036-valid-sudoku
 
 
0039-combination-sum
0039-combination-sum
 
 
0040-combination-sum-ii
0040-combination-sum-ii
 
 
0041-first-missing-positive
0041-first-missing-positive
 
 
0042-trapping-rain-water
0042-trapping-rain-water
 
 
0043-multiply-strings
0043-multiply-strings
 
 
0046-permutations
0046-permutations
 
 
0048-rotate-image
0048-rotate-image
 
 
0050-powx-n
0050-powx-n
 
 
0054-spiral-matrix
0054-spiral-matrix
 
 
0055-jump-game
0055-jump-game
 
 
0056-merge-intervals
0056-merge-intervals
 
 
0061-rotate-list
0061-rotate-list
 
 
0062-unique-paths
0062-unique-paths
 
 
0063-unique-paths-ii
0063-unique-paths-ii
 
 
0064-minimum-path-sum
0064-minimum-path-sum
 
 
0069-sqrtx
0069-sqrtx
 
 
0070-climbing-stairs
0070-climbing-stairs
 
 
0071-simplify-path
0071-simplify-path
 
 
0073-set-matrix-zeroes
0073-set-matrix-zeroes
 
 
0074-search-a-2d-matrix
0074-search-a-2d-matrix
 
 
0075-sort-colors
0075-sort-colors
 
 
0076-minimum-window-substring
0076-minimum-window-substring
 
 
0077-combinations
0077-combinations
 
 
0078-subsets
0078-subsets
 
 
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
 
 
0084-largest-rectangle-in-histogram
0084-largest-rectangle-in-histogram
 
 
0086-partition-list
0086-partition-list
 
 
0088-merge-sorted-array
0088-merge-sorted-array
 
 
0090-subsets-ii
0090-subsets-ii
 
 
0091-decode-ways
0091-decode-ways
 
 
0092-reverse-linked-list-ii
0092-reverse-linked-list-ii
 
 
0093-restore-ip-addresses
0093-restore-ip-addresses
 
 
0094-binary-tree-inorder-traversal
0094-binary-tree-inorder-traversal
 
 
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
 
 
0111-minimum-depth-of-binary-tree
0111-minimum-depth-of-binary-tree
 
 
0112-path-sum
0112-path-sum
 
 
0113-path-sum-ii
0113-path-sum-ii
 
 
0115-distinct-subsequences
0115-distinct-subsequences
 
 
0116-populating-next-right-pointers-in-each-node
0116-populating-next-right-pointers-in-each-node
 
 
0117-populating-next-right-pointers-in-each-node-ii
0117-populating-next-right-pointers-in-each-node-ii
 
 
0118-pascals-triangle
0118-pascals-triangle
 
 
0119-pascals-triangle-ii
0119-pascals-triangle-ii
 
 
0120-triangle
0120-triangle
 
 
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
 
 
0124-binary-tree-maximum-path-sum
0124-binary-tree-maximum-path-sum
 
 
0125-valid-palindrome
0125-valid-palindrome
 
 
0127-word-ladder
0127-word-ladder
 
 
0128-longest-consecutive-sequence
0128-longest-consecutive-sequence
 
 
0129-sum-root-to-leaf-numbers
0129-sum-root-to-leaf-numbers
 
 
0130-surrounded-regions
0130-surrounded-regions
 
 
0133-clone-graph
0133-clone-graph
 
 
0134-gas-station
0134-gas-station
 
 
0135-candy
0135-candy
 
 
0137-single-number-ii
0137-single-number-ii
 
 
0138-copy-list-with-random-pointer
0138-copy-list-with-random-pointer
 
 
0139-word-break
0139-word-break
 
 
0140-word-break-ii
0140-word-break-ii
 
 
0141-linked-list-cycle
0141-linked-list-cycle
 
 
0142-linked-list-cycle-ii
0142-linked-list-cycle-ii
 
 
0144-binary-tree-preorder-traversal
0144-binary-tree-preorder-traversal
 
 
0146-lru-cache
0146-lru-cache
 
 
0147-insertion-sort-list
0147-insertion-sort-list
 
 
0148-sort-list
0148-sort-list
 
 
0149-max-points-on-a-line
0149-max-points-on-a-line
 
 
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
 
 
0155-min-stack
0155-min-stack
 
 
0162-find-peak-element
0162-find-peak-element
 
 
0167-two-sum-ii-input-array-is-sorted
0167-two-sum-ii-input-array-is-sorted
 
 
0174-dungeon-game
0174-dungeon-game
 
 
0175-combine-two-tables
0175-combine-two-tables
 
 

Repository files navigation

Competitive Programming

This repository contains my solutions to various coding problems from platforms like LeetCode and Codeforces. It serves as a personal record of my progress and a resource for others interested in competitive programming.

About

Competitive programming is an excellent way to enhance your problem-solving skills and improve your coding abilities. This repository serves as a collection of my solutions to coding challenges from popular platforms like LeetCode and Codeforces. Each solution is implemented in Python and provides a clear explanation of the approach used to solve the problem.

Problem Sources

LeetCode Codeforces Please note that the problems in this repository are sourced from the above platforms. Make sure to adhere to their respective terms and conditions when using the problem statements.

Feel free to explore the repository, learn from the solutions, and use them as a reference for your own learning journey.

About

Competitive Programming This repository contains my solutions to various coding problems from platforms like LeetCode and Codeforces. It serves as a personal record of my progress and a resource for others interested in competitive programming.

Resources

Readme
Activity

Stars

3 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages