Jul 20, 2025 · 6 min read · Problem Understanding LeetCode 1948-Delete Duplicate Folders in System The goal is to delete all duplicate folder subtrees. Two folders are considered duplicates if they have the same structure and folder names in their subtrees. Solution 1: Standa...
Join discussion
Jul 18, 2025 · 6 min read · Problem Statement LeetCode 2163: Minimum Difference in Sums After Removal of Elements Difficulty: Hard Topics: Array, Dynamic Programming, Heap (Priority Queue) Date: 18 July 2025 You are given a 0-indexed integer array nums consisting of 3 * n el...
Join discussion
Jul 14, 2025 · 5 min read · Problem Statement 460. LFU Cache Design and implement a data structure for a Least Frequently Used (LFU) cache. Implement the LFUCache class: LFUCache(int capacity) Initializes the object with the capacity of the data structure. int get(int key) G...
Join discussion
Jul 7, 2025 · 6 min read · LeetCode 4: Median of Two Sorted Arrays Problem Overview Finding the median of two sorted arrays is a classic problem that can be solved in multiple ways. We'll explore both an intuitive approach and an optimized solution that meets the O(log(min(m,...
Join discussion
Jul 5, 2025 · 4 min read · LeetCode 42 - Hard Companies(0-3 months): Goldman Sachs, Amazon, Google, TikTok, Bloomberg, Zopsmart, Meta, Microsoft, Snowflake, tsc The Trapping Rain Water problem is a classic algorithmic challenge that tests your understanding of array manipulat...
Join discussion
Jul 4, 2025 · 5 min read · LeetCode Link Date: 2nd July 2025 Topics: String, Dynamic Programming, Prefix Sum Problem Understanding LeetCode 3333 builds upon the simpler "Find the Original Typed String I" problem by adding a crucial constraint: we need to find strings of lengt...
Join discussion
Nov 2, 2024 · 2 min read · This one is a math problem. And I enjoyed every bit of cracking the equation. The problem was, “Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n.” At first I thought of doing recursi...
Join discussionSep 3, 2024 · 4 min read · Problem Statement Given k sorted linked lists, each containing sorted nodes, the task is to merge these lists into a single sorted linked list. For instance, if you have the following lists: List 1: 1 → 4 → 5 List 2: 1 → 3 → 4 List 3: 2 → 6 The ...
Join discussion
Jul 20, 2024 · 4 min read · Introduction Today, I took on a challenging problem from LeetCode: First Missing Positive. This hard-level question tests your algorithmic skills, requiring an O(n) time complexity solution with O(1) auxiliary space. The goal is to find the smallest ...
Join discussion