Interview questions

Minimum Operations to Make Array Equal to Target

Given two equal-length arrays, find the minimum number of operations that add or subtract 1 to every element of any chosen contiguous subarray to turn…

General practice

Minimum Operations to Make Array Modulo Alternating I

General practice

Minimum Operations to Make Array Modulo Alternating II

General practice

Minimum Operations to Make Array Non Decreasing

Companies: Amazon

Array · Greedy

Minimum Operations to Make Array Parity Alternating

General practice

Minimum Operations to Make Array Sum Divisible by K

Find the minimum number of single-unit decrements (each replaces nums[i] with nums[i]-1) needed to make the array sum divisible by k — since each operation…

General practice

Minimum Operations to Make Array Values Equal to K

Given an array and a target k, you may repeatedly pick a valid h (all elements > h must be identical) and set those elements…

General practice

Minimum Operations to Make Binary Array Elements Equal to One I

Given a binary array, find the minimum number of operations that flip any 3 consecutive bits so that all elements become 1, or return -1…

General practice

Minimum Operations to Make Binary Array Elements Equal to One II

Given a binary array where an operation toggles all elements from some chosen index to the end, find the minimum number of such suffix-flip operations…

General practice

Minimum Operations to Make Binary Palindrome

Companies: Teradata

Array · Binary Search · Bit Manipulation · Two Pointers

Minimum Operations to Make Character Frequencies Equal

Given a lowercase string s, compute the minimum number of operations (delete, insert, or change a character to its next alphabet letter — no wrap…

General practice

Minimum Operations to Make Columns Strictly Increasing

Given an m x n grid of nonnegative integers where you may increment any cell by 1, compute the minimum total increments needed so that…

General practice

Minimum Operations to Make Elements Within K Subarrays Equal

Compute for each length-x window the minimum L1 cost to make all its elements equal (choose the median), then pick k non-overlapping windows with minimum…

General practice

Minimum Operations to Make Every Element Palindromic

Companies: Google

Array · Binary Search

Minimum Operations to Make Median of Array Equal to K

Find the minimum number of ±1 operations to make the array's median equal to k. After sorting, only elements on the median side that lie…

General practice

Minimum Operations to Make Numbers Non-positive

Given an array of integers, compute the minimum number of allowed reduction operations needed to make every element non‑positive (≤ 0) — where each operation…

General practice

Minimum Operations to Make Subarray Elements Equal

Given an integer array and a target subarray length k, find the minimum number of ±1 operations needed to make all elements of some contiguous…

General practice

Minimum Operations to Make the Array Alternating

Choose one value for all even indices and another (different) value for all odd indices so the array satisfies equal values by parity and adjacent…

General practice

Minimum Operations to Make the Array Beautiful

General practice

Minimum Operations to Make the Array Increasing

Compute the minimum number of +1 operations to make an integer array strictly increasing; the optimal solution is a left-to-right greedy scan that raises any…

General practice

Minimum Operations to Make the Array K-Increasing

Partition the array into k independent subsequences of indices i, i+k, i+2k, ...; each subsequence must be non-decreasing for the array to be K-increasing, so…

General practice

Minimum Operations to Make the Integer Zero

Given num1 and num2, you may repeatedly subtract values of the form 2^i + num2 (i in [0,60]); find the minimum number of such operations…

General practice