Problem statement In the problem ” Sort Integers by The Number of 1 Bit,” we are given an array arr. Our task is to sort the elements in the array according to the number of 1 bit in the binary representation of the number in ascending order. If two or …
Problem statement In the problem ” Plus One” we are given an array where each element in the array represents a digit of a number. The complete array represents a number. The zeroth index represents the MSB of the number. We can assume that there is no leading zero in …
Problem statement In the problem ” Check If N and Its Double Exist” we are given an array of n elements. Array length is greater than or equal to two. Our task is to check if there exists a pair in the array such that the first value is double …
Problem statement In the problem ” Day of the Year” we are given a string that contains a date in the format YYYY-MM-DD. Our task is to return the day number of that date. If the given date is 2020-01-05. This is 5th January 2020 which is the 5th day …
Problem Statement In Special Positions in a Binary Matrix problem a matrix of size n*m is given in which there are only two type of values 1s and 0s. A cell position is called special if value of that cell is 1 and values in all the cells in that …
Problem statement In the problem ” Water Bottles” we are given two values namely” numBottle” which will store the total number of full water bottles and “numExchange” which will store the total number of empty water bottles we can exchange at a time and get a full water bottle. After …
In the problem “Maximum Product of Two Elements in an Array”, our goal is to find two indices i and j in a given array of integers a, such that the product (a[i] – 1) * (a[j] – 1) is maximum. The array has at least 2 elements and all …
Problem statement In the problem ” Mean of Array After Removing Some Elements” we are given an array. All the elements of the array are positive integers. The size of the array is multiple of 20. Our task is to find the mean of the array excluding the smallest 5% …
The goal of this problem is to swap nodes of a given linked list in pairs, that is, swapping every two adjacent nodes. If we are allowed to swap just the value of the list nodes, the problem would be trivial. So, we are not allowed to modify the node …
In this problem, we have to return the kth largest element in an unsorted array. Note that the array can have duplicates. So, we have to find the Kth largest element in the sorted order, not the distinct Kth largest element. Example A = {4 , 2 , 5 , 3 …