Loading…
40+ curated questions with the same answer shape every time: quick recap, deep dive, pitfalls, and follow-ups. Coverage includes fizzbuzz go, fibonacci iterative recursive, palindrome check go, anagram check go, and more.
Suggested path
Topics follow a teaching order. Each answer ends with a clear Next question control so you can move forward without hunting the list.
Problem-solving and coding patterns in Go cover the programs every Go fresher is asked to write in a 30-minute screening. This module covers seven canonical problems written idiomatically in Go: FizzBuzz (the baseline — if it takes more than 3 minutes something is wrong, but showing clean switch and string conversion matters), Fibonacci (iterative with a simple loop vs recursive — and why iterative is preferred in Go for stack-depth reasons), palindrome check (rune-safe using a slice of runes, not indexing bytes), anagram check (using a frequency map with make(map[rune]int)), two-sum (the hash map approach, O(n) time — the Go map literal and the ok pattern for existence check), reverse a string rune-safely (range + append to a rune slice + string()), and word count (strings.Fields + a map, the range-over-string gotcha). Every solution is complete, compiles, and is written the way a Go developer writes it — not Java or Python style with Go syntax. The meta-lesson: interviewers watch how you use the language, not just whether you get the right answer.
Full catalog
Topics are ordered for learning. Within each topic, rows are numbered 1–40 globally so you always know where you are. Collapse topics if you want a lighter view — use Expand all when you need the full list again.
Numbers 1–40 follow the order we recommend — click any row to open the full answer, or use the sticky Next link at the bottom of each page to go Q1 → Q40.