I liked the way Grokking the coding interview organized problems into learnable patterns. However, the course is expensive and the majority of the time the problems are copy-pasted from leetcode. As the explanations on leetcode are usually just as good, the course really boils down to being a glorified curated list of leetcode problems.
So below I made a list of leetcode problems that are as close to grokking problems as possible.
| Searching is a fundamental task in various processes, much like finding a specific product on a store shelf. Let's consider two common ways we approach this task: | |
| 1. Linear Search: Imagine you're looking for a particular brand of toilet soap in a store. In this method, you start from one end of the shelf and examine each item, one by one, until you find what you need. While straightforward, this approach can be time-consuming, especially if the shelf contains numerous products. In the world of algorithms, this is akin to a Linear Search, with a time complexity of O(N) and minimal memory usage (O(1)). | |
| 2. Binary Search: Now, picture the same shelf, but this time all the products are organized in alphabetical order. In a Binary Search approach, you would start by checking the item in the middle. If it's not what you're looking for, you can immediately eliminate half of the remaining products because you know whether the target item should be before or after the middle. This method significantly reduces the numbe |
| We're diving into code review, but we'll keep it simple by addressing four key questions: | |
| 1. What is it, | |
| 2. Why it's crucial, | |
| 3. When to do it, and | |
| 4. How it's done. | |
| Let's get started. | |
| What is code review? | |
| Code review is part of software development lifecycle which helps to detect logical bugs, ensure coding standard, consistency and quality |
