Search for a command to run...
Series
Quick, digestible posts where I tackle DSA problems using Go — perfect for developers who want to sharpen their skills with real examples.
The Fibonacci sequence is one of the most common problems you'll solve throughout your software career. Its implementation can be as simple or complex as you want. One of the most frequently used solutions is recursion—a core concept in computer scie...
If you are preparing for technical interviews, sooner or later someone will ask you to reverse an array. At first glance it looks trivial, but it quietly tests how well you understand indexing, boundaries, and memory. In Go, this problem becomes a gr...
Throughout my career, I've encountered array chunking in everything from pagination systems to batch processing jobs. What seems simple at first glance hides tricky edge cases that can silently corrupt your data—like out-of-bounds errors or inconsist...
Hey, there! Golang enthusiastics. I hope you are putting effort in the Golang journey. This week we are improving the learning by using Go’s internal packages. We are using string package. Problem Statement Write a function that takes a string as in...
Hey there, Go enthusiasts! How's the roadmap to that desired job going? Today we're covering an interesting exercise I found on exercism. We'll solve the first turn of a BlackJack game. In this exercise, we're covering Go fundamentals and the underes...
Hello, Go enthusiast! Today we're covering a new algorithm in Go. This is a commonly asked question for entry-level positions as it covers Go basics like maps, runes, and string manipulation. We'll explore how to determine if all characters in a stri...
