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 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 the head of a singly linked list, return the middle node of the linked list. If there are two middle nodes, return the second middle node. Example 1: Input: head = [1,2,3,4,5] Output: [3,4,5] Explanation: The middle node of the list is node 3.…
You are given an integer array heights representing the heights of buildings, some bricks, and some ladders. You start your journey from building 0 and move to the next building by possibly using bricks or ladders. While moving from building i to building i+1 (0-indexed), Return the furthest building index…
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…
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 =…