Meet Goyal - LearnYard - Free Programming & DSA Blogs | Read, Code, Excel

Sign in Subscribe

Meet Goyal

Maximum Erasure Value Solution In C++/Java/Python/JS

Problem Description You are given an array of positive integers nums and want to erase a subarray containing unique elements. The score you get by erasing the subarray is equal to the sum of its elements. Return the maximum score you can get by erasing exactly one subarray. An array

Longest Subarray of 1's After Deleting One Element Solution In C++/Java/Python/JS

Problem Description Given a binary array nums, you should delete one element from it. Return the size of the longest non-empty subarray containing only 1's in the resulting array. Return 0 if there is no such subarray. Example Example 1: Input: nums = [1,1,0,1] Output: 3

Count Pairs That Form a Complete Day II Solution In C++/Java/Python/JS

Problem Description Given an integer array hours representing times in hours, return an integer denoting the number of pairs i, j where i < j and hours[i] + hours[j] forms a complete day. A complete day is defined as a time duration that is an exact multiple of 24

Rearrange Array Elements by Sign

Problem Description You are given a 0-indexed integer array nums of even length consisting of an equal number of positive and negative integers. You should return the array of nums such that the array follows the given conditions: 1. Every consecutive pair of integers has opposite signs. 2. For all

Minimum Cost to Make Array Equal Solution In C++/Java/Python/JS

Problem Description You are given two 0-indexed arrays nums and cost consisting each of n positive integers. You can do the following operation any number of times: * Increase or decrease any element of the array nums by 1. The cost of doing one operation on the ith element is cost[