How akene-uzezi/leetcode works
This repository is a small collection of standalone Go algorithm examples, not a single application. Each main.go has its own hard-coded input and demonstrates an array or string operation. The palindrome checker is unfinished and is not called; the string example instead reverses and prints a string. No README or broader runtime workflow is present.
Main entry points: apply-operations-to-an-array/main.go Apply demo · move-zeros-back/main.go Move zeros demo · removeduplicates/main.go Deduplicate demo · valid-palindrome/main.go String demo
Components 11
Array examples
- Apply demo
apply-operations-to-an-array/main.go - Apply operations
apply-operations-to-an-array/main.go - Move zeros demo
move-zeros-back/main.go - Move zeros
move-zeros-back/main.go - Deduplicate demo
removeduplicates/main.go - Remove duplicates
removeduplicates/main.go
String example
- String demo
valid-palindrome/main.go - Reverse string
valid-palindrome/main.go - Palindrome checker
valid-palindrome/main.go
Other components
- Program runner
- Standard output
Connections 16
- Program runner → Apply demo: runs
- Program runner → Move zeros demo: runs
- Program runner → Deduplicate demo: runs
- Program runner → String demo: runs
- Apply demo → Apply operations: calls
- Apply operations → Apply demo: returns slice
- Apply demo → Standard output: prints result
- Move zeros demo → Move zeros: calls
- Move zeros → Move zeros demo: mutates slice
- Move zeros demo → Standard output: prints slice
- Deduplicate demo → Remove duplicates: calls
- Remove duplicates → Deduplicate demo: returns count
- Deduplicate demo → Standard output: prints count
- String demo → Reverse string: calls
- Reverse string → String demo: returns string
- String demo → Standard output: prints string