Greedy

You are given an array apple of size n and an array capacity of size m.

Given an integer array nums of 2n integers, group these integers into n pairs (a1, b1), (a2, b2), ..., (an, bn) such that the sum of min(ai, bi) for all i is maximized.

Assume you are an awesome parent and want to give your children some cookies.

You are given an integer array prices representing the prices of various chocolates in a store.

You have a long flowerbed in which some of the plots are planted, and some are not.

A permutation perm of n + 1 integers of all the integers in the range [0, n] can be represented as a string s of length n where: Given a string s, reconstruct the permutation perm...

You are given an integer money denoting the amount of money (in dollars) that you have and another integer children denoting the number of children that you must distribute the...

There is a bag that consists of items, each item has a number 1, 0, or -1 written on it.

You are given a string num, representing a large integer.

Given an integer array nums, return the largest perimeter of a triangle with a non-zero area, formed from three of these lengths.

You are given a string time in the form of hh:mm, where some of the digits in the string are hidden (represented by ?).

At a lemonade stand, each lemonade costs $5.

You are given a string s consisting of lowercase English letters, and you are allowed to perform operations on it.

Given a string s containing only digits, return the lexicographically smallest string that can be obtained after swapping adjacent digits in s with the same parity at most once.

Given a string s which consists of lowercase or uppercase letters, return the length of the longest palindrome that can be built with those letters.

You are given an integer array nums of length n, and an integer array queries of length m.

You are given a string array words and a binary array groups both of length n.

You are given a non-negative integer array nums.

Given an integer array nums and an integer k, modify the array in the following way: You should apply this process exactly k times.

You are given a positive integer num consisting only of digits 6 and 9.

You are given an integer num.

You are given a binary string s that contains at least one '1'.

You are given a 0-indexed integer array nums and an integer k.

You are given an integer array nums.

You are assigned to put some amount of boxes onto one truck.

You have a water dispenser that can dispense cold, warm, and hot water.

A shop is selling candies at a discount.

We have n chips, where the position of the ith chip is position[i].

You are given a string s consisting of lowercase English letters, and an integer k.

You are entering a competition, and are given two positive integers initialEnergy and initialExperience denoting your initial energy and initial experience respectively.

You are given a string s consisting of n characters which are either 'X' or 'O'.

There are n availabe seats and n students standing in a room.

You are given two strings current and correct representing two 24-hour times.

You are given a string word containing distinct lowercase English letters.

You are given an integer array nums (0-indexed).

Given the array nums, obtain a subsequence of the array whose sum of elements is strictly greater than the sum of the non included elements in such subsequence.

You are given a positive integer num consisting of exactly four digits.

There is a special typewriter with lowercase English letters 'a' to 'z' arranged in a circle with a pointer.

Given an array of integers arr, return true if we can partition the array into three non-empty parts with equal sums.

You are given a string number representing a positive integer and a character digit.

Balanced strings are those that have an equal quantity of 'L' and 'R' characters.

Given a positive integer num, split it into two non-negative integers num1 and num2 such that: Return the minimum possible sum of num1 and num2.

There are n houses evenly lined up on the street, and each house is beautifully painted.

Given a string s, return true if the s can be palindrome after deleting at most one character from it.

You are given a strictly increasing integer array rungs that represents the height of rungs on a ladder.

You are given two integer arrays nums1 and nums2 both of the same length.

You are given two strings s and t consisting of only lowercase English letters.

You are given an integer array nums and an integer k.

You are given a positive integer k.

Given an integer array of even length arr, return true if it is possible to reorder arr such that arr[2 * i + 1] = 2 * arr[2 * i] for every 0 <= i < len(arr) / 2, or false...

You are given a 0-indexed array nums of distinct integers.

Your country has an infinite number of lakes.

You start with an initial power of power, an initial score of 0, and a bag of tokens given as an integer array tokens, where each tokens[i] denotes the value of tokeni.

You are given an integer array prices where prices[i] is the price of a given stock on the ith day.

You are given an array prices where prices[i] is the price of a given stock on the ith day, and an integer fee representing a transaction fee.