Empowering coders, one solution at a time
Empowering coders, one solution at a time
Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string “”. Example 1: Input: strs = [“flower”,”flow”,”flight”] Output: “fl” Example 2: Input: strs = [“dog”,”racecar”,”car”] Output:…
Given an integer array nums of length n and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution. Example 1: Input: nums = [-1,2,1,-4],…
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 happiness of length n, and a positive integer k. There are n children standing in a queue, where the ith child has happiness value happiness[i]. You want to select k children from these n children in k turns. In each turn, when you select a child, the happiness value of all the children that have not been…
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 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…