407. Trapping Rain Water II
Given an m x n integer matrix heightMap representing the height of each unit cell in a 2D elevation map, return the volume of water […]
1368. Minimum Cost to Make at Least One Valid Path in a Grid
Given an m x n grid. Each cell of the grid has a sign pointing to the next cell you should visit
Reverse a linked list
Given the head of a linked list, the task is to reverse this list and return the reversed head. Examples: Input: head: 1 ->
2683. Neighboring Bitwise XOR
A 0-indexed array derived with length n is derived by computing the bitwise XOR (⊕) of adjacent values in a binary array original of length n. Specifically, for each index i in the range [0,
Product array puzzle
Given an array, arr[] construct a product array, res[] where each element in res[i] is the product of all elements in arr[] except arr[i]. Return this resultant array, res[].Note: Each
2425. Bitwise XOR of All Pairings
You are given two 0-indexed arrays, nums1 and nums2, consisting of non-negative integers. There exists another array, nums3, which contains the bitwise XOR of all pairings of integers
Largest subarray of 0’s and 1’s
Given an array arr of 0s and 1s. Find and return the length of the longest subarray with equal number of 0s and 1s. Examples: Input:
2429. Minimize XOR
Given two positive integers num1 and num2, find the positive integer x such that: x has the same number of set bits as num2, and The value x
Longest Subarray with Sum K
Given an array arr[] containing integers and an integer k, your task is to find the length of the longest subarray where the
2657. Find the Prefix Common Array of Two Arrays
You are given two 0-indexed integerpermutations A and B of length n. A prefix common array of A and B is an array C such that C[i] is equal to the count of numbers that are present
Equilibrium Point
Given an array of integers arr[],the task is to find the first equilibrium point in the array. The equilibrium point in an array
3223. Minimum Length of String After Operations
You are given a string s. You can perform the following process on s any number of times: Choose an index i in the string such