## Minimum cost to empty Array where cost of removing an element is 2^(removed_count) * arr[i]

Given an array arr[], the task is to find the minimum cost to remove all elements from the array where cost of removing an element… Read More »

- Speed up Code executions with help of Pragma in C/C++
- Minimum Cost to make all array elements equal using given operations
- Minimum cost to empty Array where cost of removing an element is 2^(removed_count) * arr[i]
- Balance the parentheses for the given number N
- Minimum cost to colour a Tree with no 3 adjacent vertices having same colour
- Minimize sum of smallest elements from K subsequences of length L
- Maximize 3rd element sum in quadruplet sets formed from given Array
- Maximize array sum by X increments when each element is divided by 10
- Minimum operations required to make all Array elements divisible by K
- Maximize the division result of Array using given operations
- Hyperparameters Optimization methods - ML

Given an array arr[], the task is to find the minimum cost to remove all elements from the array where cost of removing an element… Read More »

Given an array arr[] of size N, the task is to find the minimum possible sum by extracting the smallest element from any K subsequences… Read More »

Given an array a[], integer K and an integer X (which is initially initialized to 0). Our task is to find the minimum number of… Read More »

Hyper Parameters are those parameters which we set for training. Hyperparameters have major impacts on accuracy and efficiency while training the model. Therefore it needed… Read More »

Given a tree with N nodes value from 0 to (N – 1) and a 2D array arr[][] of size dimensions 3xN, where arr[i][j] denotes… Read More »

Given an array arr[] consisting of N non-negative elements and an integer X, the task is to make X increments such that the value of… Read More »

Given an array arr[] of N integers, the task is to find the maximum value possible remaining in the array by repeating the following two… Read More »

Given an array arr[] of positive integers and three integers A, R, M, where The cost of adding 1 to an element of the array… Read More »

Given an array arr containing N values describing the priority of N jobs. The task is to form sets of quadruplets (W, X, Y, Z)… Read More »

Given a number N, the task is to insert the minimum number of opening and closing parenthesis into the number N such that the resultant… Read More »

The primary goal of a compiler is to reduce the cost of compilation and to make debugging produce the expected results. Not all optimizations are… Read More »

Optimization algorithms are the highly efficient algorithms which focus on finding solutions to highly complex optimization problems like travelling salesman problems, scheduling problems, profit maximization… Read More »

We have discussed loop unrolling. The idea is to increase performance by grouping loop statements so that there are less number of loop control instruction… Read More »