DSA Series

Welcome to the Tekraze DSA series, where every day we pick one classic data structures and algorithms (DSA) problem, explain the idea in plain words, and solve it in Java, Python and Rust. No jargon walls, just the thinking behind the answer.

This page is the home of the whole DSA series. Bookmark it, and you will always find every problem in one tidy list.

Also Read: Day 1: Two Sum solution

What will you get from every post in the DSA series?

• A clear problem statement with simple examples
• The brute force idea first, then the better approach
• Working solutions in Java, Python and Rust that were tested before publishing
• A tips and tricks section to help you spot the pattern next time
• Time and space complexity explained in plain words

How do you follow along in 5 steps?

1. Start with Day 1 and move down the table in order, since later problems build on earlier ideas.
2. Try it yourself for ten minutes before opening the solution. You can test your attempt on LeetCode too.
3. Pick one language, Java, Python or Rust, and type the code out by hand instead of copying it.
4. Check the complexity section, then try to explain it back in your own words.
5. Come back to a solved problem after a few days and solve it again from scratch.

Which problems are covered so far in the DSA series?

Here is the full list in order. Each row links to the complete post.

New days are added to this list as they go live, so check back often.

Where is the DSA series heading next?

The plan follows the order most interview courses use: arrays and strings, hashing, two pointers, sliding window, stacks and queues, linked lists, binary search, recursion and backtracking, trees, heaps, graphs, and dynamic programming.

Where can you learn the basics?

If terms like time complexity feel fuzzy, start with the helpers below. They make the rest of the series much easier to follow.

• Time and Space Complexity (Big O)
• Data Structures Cheat Sheet

Frequently asked questions

Who is this DSA series for?

It is for beginners and working developers who want to get comfortable with data structures and algorithms, especially anyone preparing for coding interviews. Each post starts simple, so you do not need to be an expert.

Which programming languages does the series use?

Every problem is solved in Java, Python and Rust. You can follow just the language you know or compare all three to see how the same idea looks in each.

How can I use this series for interview prep?

Go through the problems in order, try each one yourself before reading the solution, and then explain the complexity out loud. Repeating a problem a few days later helps the pattern stick.

How often are new posts added?

A new problem is added every day, and each one is listed in the table above as soon as it is published.

Conclusion

Start with Day 1 today, give it ten honest minutes, and then read the solution. One problem a day adds up quickly, and the DSA series will be here when you want the next one.

Drop-in table rows for Days 11 to 18. Add only the ones that are live, and verify each slug: