Misc

Solving a programming exercise is one thing; becoming the engineer everyone turns to is another. Somewhere between “junior” and “subject matter expert” there is a path—but when you start out, nobody hands you a map. This article lays out eight free GitHub repositories, in order, that together cover your developer roadmap: from choosing what to learn, to interviewing, to understanding systems deeply and building something of your own. Phase 1 — Finding Your Path Every developer starts curious and a little overwhelmed. You need clarity before anything else: what to …

Anthropic—the company that builds Claude—sends every engineering candidate an email before their interview: “Note that use of AI tools during this interview is not permitted.” Meanwhile, Meta hands you Claude, GPT-5, and Gemini inside the interview and says “go ahead, use them all.” Both companies still test you on algorithms and data structures. Google puts “experience with data structures and algorithms” in every job posting, from intern to senior staff. OpenAI does the same. So if the companies building AI still want you to know algorithms, what does that tell …

Smart Interview Grind offers a personalized study plan for interview preparation, addressing common issues found in generic approaches like LeetCode Premium. By tailoring plans to individual timelines, skills, and target companies, it provides week-by-week problem schedules and company-specific insights. Users receive lifetime access, ensuring optimal preparation regardless of changing circumstances.

Ever wondered where those zeros and ones that computers supposedly work with are actually located? While you’re writing code in high-level programming languages, the system quietly manipulates these binary digits behind the scenes. Understanding bit manipulation can make your programs very, very fast – and that’s exactly why tech companies love engineers who master these concepts. What Are Bits and Why Should You Care? A bit is the smallest form of memory that can be occupied in a computer. Simply put, it’s either set (1) or not set (0) – …

Let us try to understand this problem statement first. We are in charge of a fancy circus and 2 kangaroos have to jump on a number line. The interesting part is that both the kangaroos have a different start position, and different jump distances. It is a little tricky to understand, the problems asks to calculate the number line jumps such that both the kangaroos are at the same position. We will try to simplify this using some diagrams, and see how the kangaroos actually jump. In the given test …

Question: Given an integer N, find all the prime factors of the number. Input: N = 45 Output: 3 5 Finding prime factors of any numbers is a very important concept in number theory. One sample problem is available here in which we have to find the largest prime factor. The mathematical concept behind this problem is simple. We start with ‘2’ and keep dividing the original number to get rid of composite factors. Continue this process until the number is no longer divisible by 2. This means that at …

Question: Given an integer N, find the prime numbers in that range from 1 to N. Input: N = 25Output: 2, 3, 5, 7, 11, 13, 17, 19, 23 We have several ways of finding prime numbers. Some of the methods are discussed in the these posts. Method 1 Method 2 Method 3 In this post we will find the first N prime numbers using the Sieve of Eratosthenes. This technique is helpful in scenarios when we have to give immediate results and we need to query the prime numbers …

Question: Find the sum of even fibonacci numbers upto a limit N. Input:100Output: 44 Fibonacci numbers are a miracle of Math and are defined as:- Thus the Fibonacci series can be given as0, 1, 1, 2, 3, 5, 8, 13, 21… Let us try to understand the question. We need to find all the Fibonacci numbers till a limit ‘N’ and then sum only the even numbers in them.Example:N = 10 Fibonacci numbers: 0, 1, 1, 2, 3, 5, 8 Sum of even numbers: 2 + 8 = 10 N …

Question: If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below ‘N’ Input: N = 100 Output: 2318 The most naive approach to solve this problem will be Iterate over each number till N If the number is divisible by 3 or 5, add it to the sum Print the sum This approach can work well to numbers …

Question: Given an integer N, convert it into a string of words. Input: N = 345 Output: three hundred forty five This is one of the most common problems that we come across in out daily lives. We need to input a number from the user and print it in words. First, we perform a number of checks on the input string. If it is in any way invalid, the result is the empty string (“”). Next, we take note of whether or not the string begins with a ‘-‘. …