文件列表:

000-hey-programmer/ (0, 2021-11-08)
000-hey-programmer/cases_test.go (413, 2021-11-08)
000-hey-programmer/concatenation.go (82, 2021-11-08)
000-hey-programmer/concatenation_test.go (983, 2021-11-08)
000-hey-programmer/interpolaton.go (110, 2021-11-08)
000-hey-programmer/interpolaton_test.go (983, 2021-11-08)
001-max-value/ (0, 2021-11-08)
001-max-value/cases_test.go (744, 2021-11-08)
001-max-value/iterative.go (206, 2021-11-08)
001-max-value/iterative_test.go (1248, 2021-11-08)
002-is-prime/ (0, 2021-11-08)
002-is-prime/cases_test.go (920, 2021-11-08)
002-is-prime/naive.go (190, 2021-11-08)
002-is-prime/naive_test.go (1532, 2021-11-08)
002-is-prime/pair.go (192, 2021-11-08)
002-is-prime/pair_6k.go (344, 2021-11-08)
002-is-prime/pair_6k_test.go (1560, 2021-11-08)
002-is-prime/pair_test.go (1504, 2021-11-08)
003-uncompress/ (0, 2021-11-08)
003-uncompress/cases_test.go (659, 2021-11-08)
003-uncompress/generator.go (771, 2021-11-08)
003-uncompress/generator_test.go (1089, 2021-11-08)
003-uncompress/iterative.go (711, 2021-11-08)
003-uncompress/iterative_test.go (1089, 2021-11-08)
003-uncompress/regex.go (352, 2021-11-08)
003-uncompress/regex_test.go (1033, 2021-11-08)
004-compress/ (0, 2021-11-08)
004-compress/cases_test.go (662, 2021-11-08)
004-compress/generator.go (1018, 2021-11-08)
004-compress/generator_test.go (1079, 2021-11-08)
004-compress/iterative.go (967, 2021-11-08)
... ...

# structy.net Solving [structy.net](https://structy.net/) data structures & algorithms programming problems in Go (with Tests) ## I. Introduction [000. hey programmer](https://github.com/ju-popov/structy.net/blob/main/000-hey-programmer) [001. max-value](https://github.com/ju-popov/structy.net/blob/main/001-max-value) [002. is prime](https://github.com/ju-popov/structy.net/blob/main/002-is-prime) ## II. Array and String [003. uncompress](https://github.com/ju-popov/structy.net/blob/main/003-uncompress) [004. compress](https://github.com/ju-popov/structy.net/blob/main/004-compress) [005. anagrams](https://github.com/ju-popov/structy.net/blob/main/005-anagrams) [006. most frequent char](https://github.com/ju-popov/structy.net/blob/main/006-most-frequent-char) [007. pair sum](https://github.com/ju-popov/structy.net/blob/main/007-pair-sum) [008. pair product](https://github.com/ju-popov/structy.net/blob/main/008-pair-product) [009. intersection](https://github.com/ju-popov/structy.net/blob/main/009-intersection) [010. five sort](https://github.com/ju-popov/structy.net/blob/main/010-five-sort) ## III. Linked List [011. linked list values](https://github.com/ju-popov/structy.net/blob/main/011-linked-list-values) [012. sum list](https://github.com/ju-popov/structy.net/blob/main/012-sum-list) [013. linked list find](https://github.com/ju-popov/structy.net/blob/main/013-linked-list-find) [014. get node value](https://github.com/ju-popov/structy.net/blob/main/014-get-node-value) [015. reverse list](https://github.com/ju-popov/structy.net/blob/main/015-reverse-list) [016. zipper lists](https://github.com/ju-popov/structy.net/blob/main/016-zipper-lists) [017. merge lists](https://github.com/ju-popov/structy.net/blob/main/017-merge-lists) [018. is univalue list](https://github.com/ju-popov/structy.net/blob/main/018-is-univalue-list) [019. longest streak](https://github.com/ju-popov/structy.net/blob/main/019-longest-streak) [020. remove node](https://github.com/ju-popov/structy.net/blob/main/020-remove-node) [021. insert node](https://github.com/ju-popov/structy.net/blob/main/021-insert-node) [022. create linked list](https://github.com/ju-popov/structy.net/blob/main/022-create-linked-list) [023. add lists](https://github.com/ju-popov/structy.net/blob/main/023-add-lists) ## IV. Binary Tree [024. depth first values](https://github.com/ju-popov/structy.net/blob/main/024-depth-first-values) [025. breadth first values](https://github.com/ju-popov/structy.net/blob/main/025-breadth-first-values) [026. tree includes](https://github.com/ju-popov/structy.net/blob/main/026-tree-includes) [027. tree sum](https://github.com/ju-popov/structy.net/blob/main/027-tree-sum) [028. tree min value](https://github.com/ju-popov/structy.net/blob/main/028-tree-min-value) [029. max root to leaf path sum](https://github.com/ju-popov/structy.net/blob/main/029-max-root-to-leaf-path-sum) [030. tree path finder](https://github.com/ju-popov/structy.net/blob/main/030-tree-path-finder) [031. tree value count](https://github.com/ju-popov/structy.net/blob/main/031-tree-value-count) [032. how high](https://github.com/ju-popov/structy.net/blob/main/032-how-high) [033. bottom right value](https://github.com/ju-popov/structy.net/blob/main/033-bottom-right-value) [034. all tree paths](https://github.com/ju-popov/structy.net/blob/main/034-all-tree-paths) [035. tree levels](https://github.com/ju-popov/structy.net/blob/main/035-tree-levels) [036. level averages](https://github.com/ju-popov/structy.net/blob/main/036-level-averages) [037. leaf list](https://github.com/ju-popov/structy.net/blob/main/037-leaf-list) ## V. Graph [038. has path](https://github.com/ju-popov/structy.net/blob/main/038-has-path) [039. undirected path](https://github.com/ju-popov/structy.net/blob/main/039-undirected-path) [040. connected components count](https://github.com/ju-popov/structy.net/blob/main/040-connected-components-count) [041. largest component](https://github.com/ju-popov/structy.net/blob/main/041-largest-component) [042. shortest path](https://github.com/ju-popov/structy.net/blob/main/042-shortest-path) [043. island count](https://github.com/ju-popov/structy.net/tree/main/043-island-count) [044. minimum island](https://github.com/ju-popov/structy.net/tree/main/044-minimum-island) [045. closest carrot](https://github.com/ju-popov/structy.net/tree/main/045-closest-carrot) [046. longest path](https://github.com/ju-popov/structy.net/tree/main/046-longest-path) [047. semesters required](https://github.com/ju-popov/structy.net/tree/main/047-semesters-required) [048. best bridge](https://github.com/ju-popov/structy.net/tree/main/048-best-bridge) [049. has cycle](https://github.com/ju-popov/structy.net/tree/main/049-has-cycle) [050. prereqs possible](https://github.com/ju-popov/structy.net/tree/main/050-prereqs-possible) ## VI. Dynamic Programming [051. fib](https://github.com/ju-popov/structy.net/tree/main/051-fib) [052. tribonacci](https://github.com/ju-popov/structy.net/tree/main/052-tribonacci) [053. sum possible](https://github.com/ju-popov/structy.net/tree/main/053-sum-possible) [054. min change](https://github.com/ju-popov/structy.net/tree/main/054-min-change) [055. count paths](https://github.com/ju-popov/structy.net/tree/main/055-count-paths) [056. max path sum](https://github.com/ju-popov/structy.net/tree/main/056-max-path-sum) [057. non-adjacent sum](https://github.com/ju-popov/structy.net/tree/main/057-non-adjacent-sum) [058. summing squares](https://github.com/ju-popov/structy.net/tree/main/058-summing-squares) [059. counting change](https://github.com/ju-popov/structy.net/tree/main/059-counting-change) [060. array stepper](https://github.com/ju-popov/structy.net/tree/main/060-array-stepper) [061. max palin subsequence](https://github.com/ju-popov/structy.net/tree/main/061-max-palin-subsequence) [062. overlap subsequence](https://github.com/ju-popov/structy.net/tree/main/062-overlap-subsequence) [063. can concat](https://github.com/ju-popov/structy.net/tree/main/063-can-concat) [064. quickest concat](https://github.com/ju-popov/structy.net/tree/main/064-quickest-concat) ## VII. Stack [065. paired parentheses](https://github.com/ju-popov/structy.net/tree/main/065-paired-parentheses) [066. befitting brackets](https://github.com/ju-popov/structy.net/tree/main/066-befitting-brackets) [067. decompress braces](https://github.com/ju-popov/structy.net/tree/main/067-decompress-braces) [068. nesting score](https://github.com/ju-popov/structy.net/tree/main/068-nesting-score) ## VIII. Exhaustive Recursion [069. subsets](https://github.com/ju-popov/structy.net/tree/main/069-subsets) [070. permutations](https://github.com/ju-popov/structy.net/tree/main/070-permutations) [071. create combinations](https://github.com/ju-popov/structy.net/tree/main/071-create-combinations) [072. parenthetical possibilities](https://github.com/ju-popov/structy.net/tree/main/072-parenthetical-possibilities) [073. substitute synonyms](https://github.com/ju-popov/structy.net/tree/main/073-substitute-synonyms) ## IX. Mixed Recall [074. linked palindrome](https://github.com/ju-popov/structy.net/tree/main/074-linked-palindrome) [075. middle value](https://github.com/ju-popov/structy.net/tree/main/075-middle-value) [076. linked list cycle](https://github.com/ju-popov/structy.net/tree/main/076-linked-list-cycle) [077. lowest common ancestor](https://github.com/ju-popov/structy.net/tree/main/077-lowest-common-ancestor) [078. flip tree](https://github.com/ju-popov/structy.net/tree/main/078-flip-tree) [079. lefty nodes](https://github.com/ju-popov/structy.net/tree/main/079-lefty-nodes) [080. can color](https://github.com/ju-popov/structy.net/tree/main/080-can-color) [081. tolerant teams](https://github.com/ju-popov/structy.net/tree/main/081-tolerant-teams) [082. rare routing](https://github.com/ju-popov/structy.net/tree/main/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

近期下载者：

相关文件：

评论：[我要评论] [举报此文件]

收藏者：