Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
Data-Structures-Algorithms-Python
This repository features DSA problems & solutions in Python adapted from structy.net course. I created it as a resource to help others enhance their problem-solving skills and build proficiency in Python. Whether you're a beginner or a seasoned programmer, this comprehensive guide can help you develop your abilities and excel in your career.
https://github.com/MoigeMatino/Data-Structures-Algorithms-Python
Last synced: 4 days ago
JSON representation
-
0. Introduction
-
1. Arrays and Strings
- 003. uncompress
- 004. compress
- 005. anagrams
- 006. most frequent char
- 007. pair sum
- 008. pair product
- 009. intersection
- 010. five sort
- BONUS: first bad version
- BONUS: circular array loop
- BONUS: find duplicate number
- 005. anagrams
- 003. uncompress
- 004. compress
- 005. anagrams
- 006. most frequent char
- 007. pair sum
- 008. pair product
- 009. intersection
- 010. five sort
- BONUS: happy number
- BONUS: circular array loop
- BONUS: container with most water
- BONUS: search rotated sorted array
- 003. uncompress
- 004. compress
- 006. most frequent char
- 007. pair sum
- 008. pair product
- 009. intersection
- 010. five sort
-
2. Linked Lists
- 011. traversal
- 012. sum list
- 013. linked list find
- 014. get node value
- 015. reverse list
- 016. zipper lists
- 017. merge lists
- 018. is univalue list
- 019. longest streak
- 020. remove node
- 021. insert node
- 022. create linked list
- 023. add lists
- BONUS: middle of a linked list
- BONUS: palindrome linked list
- BONUS: remove nth node from end of list
- 016. zipper lists
- 015. reverse list
- 011. traversal
- 012. sum list
- 013. linked list find
- 014. get node value
- 015. reverse list
- 016. zipper lists
- 017. merge lists
- 018. is univalue list
- 019. longest streak
- 020. remove node
- 021. insert node
- 022. create linked list
- 023. add lists
- 021. insert node
- 022. create linked list
- 012. sum list
- 013. linked list find
- 018. is univalue list
- 019. longest streak
- 020. remove node
- 023. add lists
- 014. get node value
- 017. merge lists
-
3. Binary Tree
- 024. depth first values
- 025. breadth first values
- 026. tree sum
- 027. tree includes
- 028. tree min value
- 029. max root to leaf path sum
- 030. tree path finder
- 031. tree value count
- 032. how high
- 033. bottom right value
- 034. all tree paths
- 035. tree level
- 036. level averages
- 037. leaf list
- 030. tree path finder
- 034. all tree paths
- 037. leaf list
- 024. depth first values
- 025. breadth first values
- 026. tree sum
- 027. tree includes
- 028. tree min value
- 029. max root to leaf path sum
- 030. tree path finder
- 031. tree value count
- 032. how high
- 033. bottom right value
- 034. all tree paths
- 035. tree level
- 036. level averages
- 037. leaf list
- 029. max root to leaf path sum
- BONUS: diameter of a tree
- BONUS: invert tree
- BONUS: max tree path sum
- BONUS: serialise and desrialise tree
- BONUS: symmetric tree
- 024. depth first values
- 025. breadth first values
- 026. tree sum
- 027. tree includes
- 028. tree min value
- 031. tree value count
- 033. bottom right value
- 035. tree level
- 036. level averages
-
4. Graphs
- 038. has path
- 039. undirected path
- 040. connected components count
- 041. largest component
- 042. shortest path
- 043. island count
- 044. minimum island
- 045. closest carrot
- 046. longest path
- 047. semesters required
- 048. best bridge
- 049. has cycle
- 050. prereqs possible
- 051. knight attack
- 038. has path
- 039. undirected path
- 040. connected components count
- 041. largest component
- 042. shortest path
- 043. island count
- 044. minimum island
- 045. closest carrot
- 046. longest path
- 047. semesters required
- 048. best bridge
- 049. has cycle
- 050. prereqs possible
- 051. knight attack
- 048. best bridge
- 049. has cycle
- 038. has path
- 039. undirected path
- 040. connected components count
- 041. largest component
- 042. shortest path
- 044. minimum island
- 045. closest carrot
- 046. longest path
- 047. semesters required
-
5. Dynamic Programming
- 052. fib
- 053. tribonacci
- 054. sum possible
- 055. min change
- 056. count path
- 057. max path sum
- 059. summing squares
- 060. counting change
- 061. array stepper
- 062. max palin subsequence
- 063. overlap subsequence
- 064. can concat
- 065. quickest concat
- 066. knightly number
- 052. fib
- 053. tribonacci
- 054. sum possible
- 055. min change
- 056. count path
- 057. max path sum
- 058. non adjacent sum
- 059. summing squares
- 060. counting change
- 061. array stepper
- 062. max plain subsequence
- 063. overlap subsequence
- 064. can concat
- 065. quickest concat
- 066. knightly number
- 052. fib
- 053. tribonacci
- 054. sum possible
- 055. min change
- 056. count path
- 057. max path sum
- 059. summing squares
- 060. counting change
- 061. array stepper
- 062. max palin subsequence
Categories
Sub Categories