structy.net
Solving structy.net data structures & algorithms programming problems in Go (with Tests)
I. Introduction
000. hey programmer
001. max-value
002. is prime
II. Array and String
003. uncompress
004. compress
005. anagrams
006. most frequent char
007. pair sum
008. pair product
009. intersection
010. five sort
III. Linked List
011. linked list values
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
IV. Binary Tree
024. depth first values
025. breadth first values
026. tree includes
027. tree sum
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 levels
036. level averages
037. leaf list
V. Graph
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
VI. Dynamic Programming
051. fib
052. tribonacci
053. sum possible
054. min change
055. count paths
056. max path sum
057. non-adjacent sum
058. summing squares
059. counting change
060. array stepper
061. max palin subsequence
062. overlap subsequence
063. can concat
064. quickest concat
VII. Stack
065. paired parentheses
066. befitting brackets
067. decompress braces
068. nesting score
VIII. Exhaustive Recursion
069. subsets
070. permutations
071. create combinations
072. parenthetical possibilities
073. substitute synonyms
IX. Mixed Recall
074. linked palindrome
075. middle value
076. linked list cycle
077. lowest common ancestor
078. flip tree
079. lefty nodes
080. can color
081. tolerant teams
082. rare routing
083. max increasing subseq
084. positioning plants
085. breaking boundaries
086. merge sort
087. combine intervals
088. binary search
089. binary search tree includes
090. is binary search tree
091. post order
092. build tree in post
093. build tree in pre
094. lexical order
095. detect dictionary
096. topological order
097. safe cracking
098. string search
099. token replace
100. token transform
