https://github.com/ferueda/structy-go
This repo contains all problem sets and solutions for the algorithms and data structures course made by @alvin-the-programmer. Solutions and test suites are written in Go.
https://github.com/ferueda/structy-go
algorithms data-structures go golang
Last synced: 2 months ago
JSON representation
This repo contains all problem sets and solutions for the algorithms and data structures course made by @alvin-the-programmer. Solutions and test suites are written in Go.
- Host: GitHub
- URL: https://github.com/ferueda/structy-go
- Owner: ferueda
- Created: 2022-05-21T01:42:43.000Z (almost 4 years ago)
- Default Branch: main
- Last Pushed: 2022-08-07T19:42:12.000Z (over 3 years ago)
- Last Synced: 2024-06-21T19:05:55.330Z (almost 2 years ago)
- Topics: algorithms, data-structures, go, golang
- Language: Go
- Homepage: https://www.structy.net/
- Size: 107 KB
- Stars: 6
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# [Structy](https://www.structy.net/problem-index)
[](https://github.com/ferueda/structy-go/actions?query=workflow%3Atests)
This repo contains all problem sets and solutions for the algorithms and data structures course made by [Alvin Zablan](https://github.com/alvin-the-programmer). Solutions and test suites are written in Go.
## [Link to the course](https://www.structy.net/)
## Problem Sets
### String
* [Uncompress](https://github.com/ferueda/structy-go/tree/main/string/uncompress)
* [Compress](https://github.com/ferueda/structy-go/tree/main/string/compress)
* [Anagrams](https://github.com/ferueda/structy-go/tree/main/string/anagrams)
* [Most frequent char](https://github.com/ferueda/structy-go/tree/main/string/mostFrequentChar)
### Array
* [Pair sum](https://github.com/ferueda/structy-go/tree/main/array/pairsum)
* [Pair product](https://github.com/ferueda/structy-go/tree/main/array/pairproduct)
* [Intersection](https://github.com/ferueda/structy-go/tree/main/array/intersection)
* [Five sort](https://github.com/ferueda/structy-go/tree/main/array/fivesort)
### Linked List
* [Linked list values](https://github.com/ferueda/structy-go/tree/main/linkedlist/linkedListValues)
* [Sum list](https://github.com/ferueda/structy-go/tree/main/linkedlist/sumList)
* [Find value](https://github.com/ferueda/structy-go/tree/main/linkedlist/findValue)
* [Get node value](https://github.com/ferueda/structy-go/tree/main/linkedlist/getNodeValue)
* [Reverse list](https://github.com/ferueda/structy-go/tree/main/linkedlist/reverseList)
* [Zipper lists](https://github.com/ferueda/structy-go/tree/main/linkedlist/zipperLists)
* [Merge lists](https://github.com/ferueda/structy-go/tree/main/linkedlist/mergeLists)
* [Is univalue](https://github.com/ferueda/structy-go/tree/main/linkedlist/isUnivalue)
* [Longest streak](https://github.com/ferueda/structy-go/tree/main/linkedlist/longestStreak)
* [Remove node](https://github.com/ferueda/structy-go/tree/main/linkedlist/removeNode)
* [Insert node](https://github.com/ferueda/structy-go/tree/main/linkedlist/insertNode)
* [Create linked list](https://github.com/ferueda/structy-go/tree/main/linkedlist/createLinkedlist)
* [Add lists](https://github.com/ferueda/structy-go/tree/main/linkedlist/addLists)
### Binary Tree
* [Depth first values](https://github.com/ferueda/structy-go/tree/main/binarytree/depthFirstValues)
* [Breadth first values](https://github.com/ferueda/structy-go/tree/main/binarytree/breadthFirstValues)
* [Tree sum](https://github.com/ferueda/structy-go/tree/main/binarytree/treeSum)
* [Tree includes](https://github.com/ferueda/structy-go/tree/main/binarytree/treeIncludes)
* [Tree min value](https://github.com/ferueda/structy-go/tree/main/binarytree/treeMinValue)
* [Max root to leaf path sum](https://github.com/ferueda/structy-go/tree/main/binarytree/maxPathSum)
* [Tree path finder](https://github.com/ferueda/structy-go/tree/main/binarytree/treePathFinder)
* [Tree value count](https://github.com/ferueda/structy-go/tree/main/binarytree/treeValueCount)
* [How high](https://github.com/ferueda/structy-go/tree/main/binarytree/howHigh)
* [Bottom right value](https://github.com/ferueda/structy-go/tree/main/binarytree/bottomRightValue)
* [All tree paths](https://github.com/ferueda/structy-go/tree/main/binarytree/allTreePaths)
* [Tree levels](https://github.com/ferueda/structy-go/tree/main/binarytree/treeLevels)
* [Level averages](https://github.com/ferueda/structy-go/tree/main/binarytree/levelAverages)
* [Leaf list](https://github.com/ferueda/structy-go/tree/main/binarytree/leafList)
### Graph
* [Has path](https://github.com/ferueda/structy-go/tree/main/graph/hasPath)
* [Undirected path](https://github.com/ferueda/structy-go/tree/main/graph/undirectedPath)
* [Connected components count](https://github.com/ferueda/structy-go/tree/main/graph/connectedComponentsCount)
* [Largest component](https://github.com/ferueda/structy-go/tree/main/graph/largestComponent)
* [Shortest path](https://github.com/ferueda/structy-go/tree/main/graph/shortestPath)
* [Island count](https://github.com/ferueda/structy-go/tree/main/graph/islandCount)
* [Minimum island](https://github.com/ferueda/structy-go/tree/main/graph/minimumIsland)
* [Closest carrot](https://github.com/ferueda/structy-go/tree/main/graph/closestCarrot)
* [Longest path](https://github.com/ferueda/structy-go/tree/main/graph/longestPath)
* [Semesters required](https://github.com/ferueda/structy-go/tree/main/graph/semestersRequired)