Search for a command to run...
Articles tagged with #sorting
You are given a positive integer days representing the total number of days an employee is available for work (starting from day 1). You are also given a 2D array meetings of size n where, meetings[i] = [start_i, end_i] represents the starting and en...
You are given an array of integers nums. You are also given an integer original which is the first number that needs to be searched for in nums. You then do the following steps: If original is found in nums, multiply it by two (i.e., set original = ...
Given a 0-indexed integer array nums of length n and an integer target, return the number of pairs (i, j) where 0 <= i < j < n and nums[i] + nums[j] < target. LeetCode Problem - 2824 // This is a Java class named Solution. class Solution { public...
Given an integer array nums, move all the even integers at the beginning of the array followed by all the odd integers. Return any array that satisfies this condition. LeetCode Problem - 905 class Solution { public int[] sortArrayByParity(int[] n...
You are given a positive integer num. You may swap any two digits of num that have the same parity (i.e. both odd digits or both even digits). Return the largest possible value of num after any number of swaps. LeetCode Problem - 2231 class Solution ...
Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. LeetCode Problem - 229 import java.util.*; class Solution { public List<Integer> majorityElement(int[] nums) { // Create an ArrayList to store uniqu...
