Shubham Learnyard - LearnYard - Free Programming & DSA Blogs | Read, Code, Excel (Page 3)

Sign in Subscribe

Shubham Learnyard

Count Number of Nice Subarrays Solution In C++/Python/java/JS

Problem Description: Given an array of integers nums and an integer k. A continuous subarray is called nice if there are k odd numbers on it. Return the number of nice sub-arrays. Examples: Input: nums = [1,1,2,1,1], k = 3 Output: 2 Explanation: The only sub-arrays with 3

Count of Interesting Subarrays

Problem Description: You are given a 0-indexed integer array nums, an integer modulo, and an integer k. Your task is to find the count of subarrays that are interesting. A subarray nums[l..r] is interesting if the following condition holds: Let cnt be the number of indices i in

Continuous Subarray Sum

Problem Description: Given an integer array nums and an integer k, return true if nums has a good subarray or false otherwise. A good subarray is a subarray where: its length is at least two, and the sum of the elements of the subarray is a multiple of k. Examples:

Count Number of Bad Pairs Solution In C++/Java/Python/JS

Problem Description: You are given a 0-indexed integer array nums. A pair of indices (i, j) is a bad pair if i < j and j - i ≠ nums[j] - nums[i]. Return the total number of bad pairs in nums. Examples: Input: nums = [4, 1, 3, 3] Output:

Make Sum Divisible by P

Problem Description Given an array of positive integers 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

Calculate the LCM and GCD of Two Numbers Solution In C++/Java/Python/JS

Problem Description: Given two integers A and B, find their Greatest Common Divisor (GCD) and Least Common Multiple (LCM). The GCD (Greatest Common Divisor) of two numbers is the largest number that divides both A and B without leaving a remainder. The LCM (Least Common Multiple) of two numbers is

Subarray Sums Divisible by K

Problem Description: Given an integer array nums and an integer k, return the number of non-empty subarrays that have a sum divisible by k. A subarray is a contiguous part of an array. Examples: Input: nums = [4,5,0,-2,-3,1], k = 5 Output: 7 Explanation: There are 7

Find Good Days to Rob the Bank

Problem Description: You and a gang of thieves are planning on robbing a bank. You are given a 0-indexed integer array security, where security[i] is the number of guards on duty on the ith day. The days are numbered starting from 0. You are also given an integer time.

Sum of Absolute Differences in a Sorted Array

Problem Description You are given an integer array nums sorted in non-decreasing order. Build and return an integer array result with the same length as nums such that result[i] is equal to the summation of absolute differences between nums[i] and all the other elements in the array. In

Minimum Penalty for a Shop

Problem Description You are given the customer visit log of a shop represented by a 0-indexed string customers consisting only of characters 'N' and 'Y': if the ith character is 'Y', it means that customers come at the ith hour whereas 'N'

Minimum Remove to Make Valid Parentheses

Problem Description Given a string s of '(' , ')' and lowercase English characters. Your task is to remove the minimum number of parentheses ( '(' or ')', in any positions ) so that the resulting parentheses string is valid and return any valid string. Formally, a parentheses string

Minimum Add to Make Parentheses Valid

Problem Description A parentheses string is valid if and only if: It is the empty string, It can be written as AB (A concatenated with B), where A and B are valid strings, or It can be written as (A), where A is a valid string. You are given a

Asteroid Collision

Problem Description We are given an array asteroids of integers representing asteroids in a row. For each asteroid, the absolute value represents its size, and the sign represents its direction (positive meaning right, negative meaning left). Each asteroid moves at the same speed. Find out the state of the asteroids

Equal Row and Column Pairs Solution In C++/Python/java/JS

Equal Row and Column Pairs Problem Description: Given a 0-indexed n x n integer matrix grid, return the number of pairs (ri, cj) such that row ri and column cj are equal. A row and column pair is considered equal if they contain the same elements in the same order

Matrix Similarity After Cyclic Shifts Solution In C++/Python/java/JS

Matrix Similarity After Cyclic Shifts Problem Description: You are given an m x n integer matrix mat and an integer k. The matrix rows are 0-indexed. The following process happens k times: Even-indexed rows (0, 2, 4, ...) are cyclically shifted to the left. Odd-indexed rows (1, 3, 5, ...) are cyclically

Shift 2D Grid-Problem-Description

Shift 2D Grid Solution in C++/Java/Python/JS

Shift 2D Grid Problem Description: Given a 2D grid of size m x n and an integer k, you need to shift the grid k times. In one shift operation: Element at grid[i][j] moves to grid[i][j + 1] Element at grid[i][n - 1] moves to

Minimum Operations to Write the Letter Y on a Grid Solution In C++/Python/java/JS

Minimum Operations to Write the Letter Y on a Grid Problem Description: You are given a 0-indexed n x n grid where n is odd, and grid[r][c] is 0, 1, or 2. We say that a cell belongs to the Letter Y if it belongs to one of