Empowering coders, one solution at a time
Empowering coders, one solution at a time
You are given an array arr of size n consisting of non-empty strings. Find a string array answer of size n such that: Return the array answer. Example 1:Input: arr = [“cab”,”ad”,”bad”,”c”] Output: [“ab”,””,”ba”,””] Explanation: We have the following: – For the string “cab”, the shortest substring that does not occur in…
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…
Given a string s and an integer k, partition s into k substrings such that the sum of the number of letter changes required to turn each substring into a semi-palindrome is minimized. Return an integer denoting the minimum number of letter changes required. Notes Example 1:Input: s = “abcac”, k = 2 Output: 1…
You are given a 0-indexed integer array nums of length n. We want to group the indices so for each index i in the range [0, n – 1], it is assigned to exactly one group. A group assignment is valid if the following conditions hold: Return an integer denoting the minimum number of groups needed to…
You are given a 0-indexed array nums of integers. A triplet of indices (i, j, k) is a mountain if: Return the minimum possible sum of a mountain triplet of nums. If no such triplet exists, return -1. Example 1:Input: nums = [8,6,1,5,3] Output: 9 Explanation: Triplet (2, 3, 4) is a mountain triplet…
You are given a 0-indexed array nums of integers. A triplet of indices (i, j, k) is a mountain if: Return the minimum possible sum of a mountain triplet of nums. If no such triplet exists, return -1. Example 1:Input: nums = [8,6,1,5,3] Output: 9 Explanation: Triplet (2, 3, 4) is a mountain triplet…
There are N cities in a country. George is initially at the airport in city 1 and he wants to reach city N. For any city i, there is either a flight to city (i+1) or to (i+3) if it…
Given an array A[] of N integers. In each operation, Geek can increase the ith element by 1 (i.e set A[i] = A[i]+1 where 1 < i < N).The task is to calculate the minimum number of operations required such that there is no prefix in the array A[] whose sum…
You are given a 0-indexed integer array nums having length n, an integer indexDifference, and an integer valueDifference. Your task is to find two indices i and j, both in the range [0, n – 1], that satisfy the following conditions: Return an integer array answer, where answer = [i, j] if there are two such indices, and answer =…
You are given a binary string s and a positive integer k. A substring of s is beautiful if the number of 1‘s in it is exactly k. Let len be the length of the shortest beautiful substring. Return the lexicographically smallest beautiful substring of string s with length equal to len. If s doesn’t contain a beautiful substring, return an empty string. A…