You are the manager of a basketball team. For the upcoming tournament, you want to choose the team with the highest overall score. The score of the team is the sum of scores of all the players in the team.
However, the basketball team is not allowed to have conflicts. A conflict exists if a younger player has a strictly higher score than an older player. A conflict does not occur between players of the same age.
Given two lists,
Continue reading “[Leetcode]1626. Best Team With No Conflicts”
ages, where each
ages[i] represents the score and age of the
ith player, respectively, return the highest overall score of all possible basketball teams.
Given a binary array, task is to sort this binary array using minimum swaps. We are allowed to swap only adjacent elements
Continue reading “[Challenge]Minimum adjacent swaps required to Sort Binary array”
Given a list of non negative integers, arrange them such that they form the largest number.
Continue reading “[Leetcode]179. Largest Number”
You are given an n x n 2D
Continue reading “[Leetcode]48. Rotate Image”
matrix representing an image, rotate the image by 90 degrees (clockwise).
You have to rotate the image in-place, which means you have to modify the input 2D matrix directly. DO NOT allocate another 2D matrix and do the rotation.
We have an array of integers,
Continue reading “[Leetcode]1589. Maximum Sum Obtained of Any Permutation”
nums, and an array of
requests[i] = [starti, endi]. The
ith request asks for the sum of
nums[starti] + nums[starti + 1] + ... + nums[endi - 1] + nums[endi]. Both
endi are 0-indexed.
Return the maximum total sum of all requests among all permutations of
Since the answer may be too large, return it modulo
109 + 7.
Given an array of positive integers
Continue reading “[Leetcode]1590. Make Sum Divisible by P”
nums, remove the smallest subarray (possibly empty) such that the sum of the remaining elements is divisible by
p. It is not allowed to remove the whole array.
Return the length of the smallest subarray that you need to remove, or
-1 if it's impossible.
A subarray is defined as a contiguous block of elements in the array.
You are given an integer array
Continue reading “[Leetcode]33. Search in Rotated Sorted Array”
nums sorted in ascending order, and an integer
nums is rotated at some pivot unknown to you beforehand (i.e.,
target is found in the array return its index, otherwise, return
Given a non-empty array of numbers, a0, a1, a2, … , an-1, where 0 ≤ ai < 231.
Find the maximum result of ai XOR aj, where 0 ≤ i, j < n.
Could you do this in O(n) runtime?
Continue reading “[Leetcode]421. Maximum XOR of Two Numbers in an Array”