Empowering coders, one solution at a time
Empowering coders, one solution at a time
You are given an array apple of size n and an array capacity of size m. There are n packs where the ith pack contains apple[i] apples. There are m boxes as well, and the ith box has a capacity of capacity[i] apples. Return the minimum number of boxes you need to select to redistribute these n packs of apples into boxes. Note that, apples…
![[Solved] 3ple Newton's Triwizard Contest with Java](https://realcoder.techss24.com/wp-content/uploads/2022/11/Solved-3ple-Newtons-Triwizard-Contest-with-Java-768x504.png "[Solved] 3ple Newton's Triwizard Contest with Java")
You are given a positive integer N. Print “Yes” if N is a multiple of 3, otherwise print “No”. Input The input consists of a single integer N. Constraints:1 ≤ N ≤ 1000 Output If N is a multiple of…
![[Solved] Closest Friends Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/09/Solved-Closest-Friends-Contest-Problem.png "[Solved] Closest Friends Contest Problem")
There are N persons standing in a line from left to right. This line is represented with an array of size N and the elements of the array are the height of the persons. For each person the closest friend is the…
![[Solved] Maximum Deletions on a String LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/10/Solved-Maximum-Deletions-on-a-String-LeetCode-Contest-Problem-768x512.png "[Solved] Maximum Deletions on a String LeetCode Contest Problem")
You are given a string s consisting of only lowercase English letters. In one operation, you can: Delete the entire string s, or Delete the first i letters of s if the first i letters of s are equal to the following i letters in s, for any i in the range 1 <= i <= s.length / 2. For example,…
![[Solved] Minimize XOR LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/10/Solved-Minimize-XOR-LeetCode-Contest-Problem-768x514.png "[Solved] Minimize XOR LeetCode Contest Problem")
Given two positive integers num1 and num2, find the integer x such that: x has the same number of set bits as num2, and The value x XOR num1 is minimal. Note that XOR is the bitwise XOR operation. Return the integer x. The test cases are generated such that x is uniquely determined. The number of set…
![[Solved] Maximum Sum of an Hourglass LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/10/Solved-Maximum-Sum-of-an-Hourglass-LeetCode-Contest-Problem-768x510.png "[Solved] Maximum Sum of an Hourglass LeetCode Contest Problem")
You are given an m x n integer matrix grid. We define an hourglass as a part of the matrix with the following form: Return the maximum sum of the elements of an hourglass. Note that an hourglass cannot be rotated and must be entirely contained within the matrix.…
![[Solved] Minimum At Pop Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/09/Solved-Minimum-At-Pop-Contest-Problem.png "[Solved] Minimum At Pop Contest Problem")
Now, we’ll try to solve a famous stack problem. You are given an array A of size N. You need to push the elements of the array into a stack and then print minimum in the stack at each pop Input Format:The first…
![[Solved] Maximum Segment Sum After Removals LeetCode Contest](https://realcoder.techss24.com/wp-content/uploads/2022/08/Solved-Maximum-Segment-Sum-After-Removals-LeetCode-Contest.png "[Solved] Maximum Segment Sum After Removals LeetCode Contest")
You are given two 0-indexed integer arrays nums and removeQueries, both of length n. For the ith query, the element in nums at the index removeQueries[i] is removed, splitting nums into different segments. A segment is a contiguous sequence of positive integers in nums. A segment sum is the sum of every element in a segment. Return an integer array answer, of length n,…
![[Solved] Shifting Letters II LeetCode Contest](https://realcoder.techss24.com/wp-content/uploads/2022/08/Solved-Shifting-Letters-II-LeetCode-Contest.png "[Solved] Shifting Letters II LeetCode Contest")
You are given a string s of lowercase English letters and a 2D integer array shifts where shifts[i] = [starti, endi, directioni]. For every i, shift the characters in s from the index starti to the index endi (inclusive) forward if directioni = 1, or shift the characters backward if directioni = 0. Shifting a character forward means replacing it…
![[Solved] Time Needed to Rearrange a Binary String LeetCode Contest](https://realcoder.techss24.com/wp-content/uploads/2022/08/Solved-Time-Needed-to-Rearrange-a-Binary-String-LeetCode-Contest.png "[Solved] Time Needed to Rearrange a Binary String LeetCode Contest")
You are given a binary string s. In one second, all occurrences of “01” are simultaneously replaced with “10”. This process repeats until no occurrences of “01” exist. Return the number of seconds needed to complete this process. Time Needed to Rearrange a Binary String LeetCode Contest Example 1: Input: s = “0110101”…