The programming problems on structy.net for data structures and algorithms in Python are meant to be tackled sequentially, with tasks below arranged in chronological order. Moreover, comprehensive test coverage has been included as an additional component.
000. hey programmer
001. max value
002. is prime
003. uncompress
004. compress
005. anagrams
006. most frequent char
007. pair sum
008. pair product
009. intersection
010. five sort
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
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
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
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