Yahoo India Web Search

Sign In

Search results

  1. leetcode.com › problems › smallest-range-iiSmallest Range II - LeetCode

    Smallest Range II - You are given an integer array nums and an integer k. For each index i where 0 <= i < nums.length, change nums [i] to be either nums [i] + k or nums [i] - k. The score of nums is the difference between the maximum and minimum elements in nums.

  2. www.geeksforgeeks.org › minimize-the-maximumMinimize the maximum difference between the heights

    Jun 26, 2023 · The idea is to increase the first i towers by k and decrease the rest tower by k after sorting the heights, then calculate the maximum height difference. This can be achieved using sorting. Illustration: Given arr [] = {1, 15, 10}, n = 3, k = 6. Array after sorting => arr [] = {1, 10, 15} At i = 1.

  3. www.geeksforgeeks.org › minimize-the-heights3351 › 1Minimize the Heights II | Practice | GeeksforGeeks

    Given an array arr[] denoting heights of N towers and a positive integer K. For each tower, you must perform exactly one of the following operations exactly once. Increase the height of the tower by K Decrease the height of the tower by K Fin

  4. github.com › main › Minimize_the_heights_II_GFGLeetcode/Minimize_the_heights_II_GFG.cpp at main ... - GitHub

    Code. Blame. 39 lines (32 loc) · 1.17 KB. /* Given an array arr [] denoting heights of N towers and a positive integer K. For each tower, you must perform exactly one of the following operations exactly once.

  5. www.youtube.com › watchMinimize the Heights II | Problem of the Day | May 30 2021 ...

    Question - https://practice.geeksforgeeks.org/problems/minimize-the-heights3351/1Telegram- https://bit.ly/30jGLHZUSE CODE - SKSAMAGFG for FLAT 10% off on al...

  6. www.geeksforgeeks.org › videos › problem-of-the-dayPROBLEM OF THE DAY : 05/12/2023 | Minimize the Heights II

    Dec 6, 2023 · In this problem, we are given, an array arr[] denoting heights of N towers and a positive integer K. For each tower, you must perform exactly one of the following operations exactly once. - Increase the height of the tower by K

  7. www.youtube.com › watchMinimize the Heights II DSA Sheet | Leetcode ... - YouTube

    Jul 25, 2023 · In this video I have explained the problem minimize the heights II. Problem link : https://tinyurl.com/4mzwdap4.

  1. Searches related to minimize the heights ii leetcode

    minimize the heights leetcode