Problem Summary You are given an integer array nums and an integer k. In one operation, you may choose any element and add or subtract any positive integer from it, but the cost of the operation equals the amount you add or subtract. Your task is to compute the minimum total cost needed so that…

Problem Summary You are given an integer array nums.In one operation, you may increment or decrement any element by exactly 1. Your task is to compute the minimum number of operations required to make all elements in the array distinct. ExampleInput: Output: Explanation: You can change the last 2 to 3 using 1 operation, resulting…

Problem Summary You are given an integer array nums.Your task is to determine whether the array can be partitioned into two subsets such that the sum of elements in both subsets is equal. ExampleInput: nums = [1,5,11,5]Output: trueExplanation: The array can be split into [1,5,5] and [11]. Input: nums = [1,2,3,5]Output: falseExplanation: Equal partition is…

Problem Summary You are given an integer array nums.Your task is to compute the sum of XOR of every possible subset of nums. Formally:For all subsets S of the array, computexor(S)and return the sum of all these values. ExampleInput: nums = [1,3]Subsets are:[] -> 0[1] -> 1[3] -> 3[1,3] -> 1 ^ 3 = 2Sum…

Problem Summary You are given the root of a binary tree.Your task is to return the lowest common ancestor (LCA) of all the tree’s deepest leaves. A deepest leaf is any node that has the maximum depth in the entire tree. ExampleInput: Deepest leaf is 4, so the answer is node 4. Another example: Deepest…

Problem Summary You are given an integer array nums. You must choose three indices i < j < k such that the value is maximized. Return the maximum possible value of this expression. Constraints Understanding the Expression We want to maximize: The constraints are: Important Observations If (nums[i] – nums[j]) is negative, multiplying with positive…

Problem Summary You are given a 2D array questions, where each entry is: If you solve question i: If you skip question i, you earn nothing and simply move to the next one. Your task is to compute the maximum points you can earn. ExampleInput: Output: Explanation:You can solve question 0 (earn 3), then must…

Problem Summary You are given an n x n binary grid where: You may change at most one 0 to 1. Your task is to return the size of the largest island you can achieve after performing at most one such change. An island is a group of 1s connected 4-directionally. ExampleInput: Output: 3 Explanation:Turning…

Problem Summary Given an integer array nums, return the length of the longest strictly increasing subsequence (LIS). A subsequence does not need to be contiguous, but must keep the original order. ExampleInput: nums = [10, 9, 2, 5, 3, 7, 101, 18]Output: 4Explanation: A possible LIS is [2, 3, 7, 18]. Input: nums = [0,…

Problem Summary You are given an array of pairs, where each pair is a two-element array [a, b]. A pair [a, b] can be chained with [c, d] if and only if: Your task is to find the maximum length of a chain you can form. ExampleInput: [[1,2], [2,3], [3,4]]Output: 2Explanation: You can form the…