Leetcode 1235: Maximum Profit in Job SchedulingWe have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i].Aug 30, 2024Aug 30, 2024
Leetcode 1234: Replace the Substring for Balanced StringYou are given a string s of length n containing only four kinds of characters: 'Q', 'W', 'E', and 'R'.Aug 29, 2024Aug 29, 2024
Leetcode 1224: Maximum Equal FrequencyGiven an array nums of positive integers, return the longest possible length of an array prefix of nums, such that it is possible to remove…Aug 22, 2024Aug 22, 2024
Leetcode 1192: Cirtical Connections in a NetworkThere are n servers numbered from 0 to n - 1 connected by undirected server-to-server connections forming a network where connections[i] =…Jul 20, 2024Jul 20, 2024
Leetcode 1187: Make Array Strictly IncreasingGiven two integer arrays arr1 and arr2, return the minimum number of operations (possibly zero) needed to make arr1 strictly increasing.Jul 16, 2024Jul 16, 2024
Leetcode 1092: Shortest Common SupersequenceGiven two strings str1 and str2, return the shortest string that has both str1 and str2 as subsequences. If there are multiple valid…May 14, 2024May 14, 2024
Leetcode 1072: Flip Columns For Maximum Number of Equal RowsYou are given an m x n binary matrix matrix.May 3, 2024May 3, 2024
Leetcode 1049: Last Stone Weight IIYou are given an array of integers stones where stones[i] is the weight of the ith stone.Apr 24, 2024Apr 24, 2024
Leetcode 1029: Two city SchedulingA company is planning to interview 2n people. Given the array costs where costs[i] = [aCosti, bCosti], the cost of flying the ith person to…Apr 5, 2024Apr 5, 2024
Leetcode 3102: Minimize Manhattan DistancesYou are given a 0-indexed array points representing integer coordinates of some points on a 2D plane, where points[i] = [xi, yi].Mar 31, 2024Mar 31, 2024