Mar 20 · 8 min read · for example: arr1 = [1, 3, 2, 1, 4, 5] arr2 = [3, 2, 2, 1, 1] answer = [3, 2, 1] simple enough right? and if you've done even a little bit of DSA prep your brain immediately goes - HashSet. put all e
Join discussion
Feb 4 · 14 min read · Imagine you've just created an algorithm, and it works lightning-fast on your brand-new computer. You're thrilled with the results and can't wait to share your success, so you ask your friend to give it a try. However, when your friend runs the same ...
Join discussion
Jan 30 · 9 min read · Introduction: Why This Matters You're building a dashboard that displays sales data. You need to find the highest sale to set the Y-axis scale on your chart. Or maybe you're processing sensor data and need to identify peak values. Finding the maximum...
Join discussion
Jan 18 · 3 min read · If you’re having a coding interview, and that you are overwhelmed by the number of coding problems out there, you’re not alone. Especially when you are in a hurry, you want to grasp as much problem solving skills as possible, and this article ( and o...
Join discussion
Jan 6 · 7 min read · Your code works. It runs. It produces the right output. But here's the question nobody asks beginners: How well does it work? You write a function that searches through a list. It works for 10 items. It works for 100 items. But what happens when you ...
Join discussion
Jan 2 · 3 min read · LeetCode 961: N-Repeated Element in Size 2N Array is usually solved with a simple Hash Set (O(N) space) or randomized checks. But recently, I challenged myself to solve it deterministically using O(1) space. The result? A modified version of Moore’s ...
Join discussion
Dec 29, 2025 · 4 min read · Using the Two Sum exercise from LeetCode we can study how a problem can be solved with less complexity. The description of the problem is very simple: Given an array of integers nums and an integer target, return indices of the two numbers such that...
Join discussionDec 23, 2025 · 9 min read · Introduction When you first start programming, you're mostly focused on getting your code to work. Does it produce the right output? Does it handle the basic test cases? That's great, but there's another question you should be asking: how fast does i...
Join discussion
Nov 29, 2025 · 11 min read · Time and Space Complexities are fundamental concepts in computer science used to measure the performance and resource usage of an algorithm. 1. What Do Time & Space Complexities Mean? Time Complexity Time complexity measures the amount of time an al...
Join discussion
