Author name: Admin

Not a Subset Sum

gfg-potd

Given a sorted array arr[] of positive integers, find the smallest positive integer such that it cannot be represented as the sum […]

1590. Make Sum Divisible by P

leetcode-potd

Given an array of positive integers nums, remove the smallest subarray (possibly empty) such that the sum of the remaining elements is divisible by p. It is not allowed

Majority Vote

gfg-potd

You are given an array of integer nums[] where each number represents a vote to a candidate. Return the candidates that have

Rotate and delete

gfg-potd

Given an array arr integers. Assume sz to be the initial size of the array. Do the following operations exactly sz/2 times. In every kth (1<= k <=

Total count

gfg-potd

You are given an array arr[] of positive integers and a threshold value k. For each element in the array, divide it into

Scroll to Top