In modern JavaScript, there are often several ways to achieve the same result. A common LeetCode problem, Concatenation of Array, asks us to take an array nums and return a new array that is twice as long, consisting of nums followed by nums. While the task is simple, the way we solve it reveals a […]
January 7, 2026 | Data Structure, Javascript | No comments
The Valid Anagram problem is a classic interview challenge that tests your ability to manage data frequency. While there are many ways to solve it, the journey from using a flexible Map to a high-performance Int32Array reveals a lot about how JavaScript works under the hood. 1. The Foundation: Using a JavaScript Map The most […]
January 7, 2026 | Data Structure, Javascript | No comments
Before we understand LSM, let’s understand the key concepts of SS Tables SS Tables LSM Algorithm Storage of data Compaction Retrieval of data References
June 30, 2025 | Data Structure | No comments
Bitwise OR (|) if either of the bits is 1, it gives 1, else it shows 0 Bitwise AND (&) if both bits are 1, it gives 1, else it shows 0. Bitwise XOR(^) if corresponding bits are different, it gives 1, else it shows 0. Bitwise Complement(~) with all bits inverted, which means it […]
September 27, 2024 | Data Structure | No comments