Latest Posts in Leetcode
3728. Stable Subarrays With Equal Boundary and Interior Sum | LeetCode Solution
Raunit Verma- inLeetcodeYou are given an integer array capacity. A subarray capacity[l..r] is considered stable if: Its length is at least 3. The first and last elements are each equal to the sum of all elements strictly between them (i.e., capacity[l] = capacity[r] = capacity[l + 1] + capacity[l + 2] + ... + capacity[r - 1]). Return an integer denoting the number of stable subarrays.
89. Gray Code - LeetCode Solution | C++ | Go | Kotlin | Java | JS | TS | Python
Raunit Verma- inLeetcodeExplore the Gray Code problem on LeetCode with comprehensive solutions and explanations in various programming languages. Perfect for coding enthusiasts!
287. Find the Duplicate Number Solution | Leetcode | Binary Search
Raunit Verma- inLeetcodeGiven an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive. There is only one repeated number in nums, return this repeated number. You must solve the problem without modifying the array nums and using only constant extra space.
1482. Minimum Number of Days to Make m Bouquets Solution | Leetcode | Binary Search
Raunit Verma- inLeetcodeYou are given an integer array bloomDay, an integer m and an integer k. You want to make m bouquets. To make a bouquet, you need to use k adjacent flowers from the garden. The garden consists of n flowers, the ith flower will bloom in the bloomDay[i] and then can be used in exactly one bouquet. Return the minimum number of days you need to wait to be able to make m bouquets from the garden. If it is impossible to make m bouquets return -1.
878. Nth Magical Number Solution | LeetCode | Binary Search
Raunit Verma- inLeetcodeA positive integer is magical if it is divisible by either a or b. Given the three integers n, a, and b, return the nth magical number. Since the answer may be very large, return it modulo 109 + 7.