Ankit Kumar Mishra

2D-Arrays IV

We’ve covered how to add and subtract two matrices, print the upper and lower triangles of a matrix, and print both the left and right diagonals. These fundamental matrix operations serve as the building blocks for more complex algorithms. But did we miss to traverse the 2d-array in the

2D-Arrays III

Now that we've explored fundamental matrix operations—such as printing row-wise and column-wise, calculating sums, and identifying maximum and minimum values—let's dive deeper into specific matrix structures. One important concept is the classification of matrices based on their triangular properties. This leads us to the

2D- Arrays II

As we have learnt the two types of traversal techniques that we can perform in a matrix. Now, it's very important for us to apply those in questions. Before , moving further we must make sure we are perfect with the row-wise and the column wise traversals. Q6. Maximum

2D-Arrays I

Having covered the theoretical basics of 2D-Arrays in our previous discussion , let's now apply our basics in solving and understanding 2D-concepts more !! Q1. How to Print 2D array/matrix row-wise ? Example Input : mat[][] = {{1, 2, 3,4}, {5, 6, 7,8}, {9,10,11,12}} Output : Row-wise: 1

My Calendar II

Problem Description You are implementing a program to use as your calendar. We can add a new event if adding the event will not cause a triple booking. A triple booking happens when three events have some non-empty intersection (i.e., some moment is common to all the three events.

Shifting Letters II

Problem Description You are given a string s of lowercase English letters and a 2D integer array shifts where shifts[i] = [start i, end i, direction i]. For every i, shift the characters in s from the index start i to the index end i (inclusive) forward if direction i

Car Pooling

Problem Description There is a car with capacity empty seats. The vehicle only drives east (i.e., it cannot turn around and drive west). You are given the integer capacity and an array trips where trips[i] = [numPassengers i, from i, to i] indicates that the ith trip has numPassengers

Pongal Bunk

Problem Description Given a number N, which is the size of array where indices are from 1 to N . Initially all the elements of array are 0 . Q queries are given . Each query contains two variables L and R . For each query you have to perform the following operation: for

Points That Intersect With Cars

Problem Description You are given a 0-indexed 2D integer array nums representing the coordinates of the cars parking on a number line. For any index i, nums[i] = [start i, end i] where start i is the starting point of the ith car and end i is the ending point

Maximum Population Year

Problem Description You are given a 2D integer array logs where each  logs[i] = [birth i, death i] indicates the birth and death years of the ith person. The population of some year x is the number of people alive during that year. The ith person is counted in year

Find All Good Indices

Problem Description You are given a 0-indexed integer array nums of size n and a positive integer k.We call an index i in the range k <= i < n - k good if the following conditions are satisfied: 1. The k elements that are just before the index

Movement of Robots

Problem Description Some robots are standing on an infinite number line with their initial coordinates given by a 0-indexed integer array nums and will start moving once given the command to move. The robots will move a unit distance each second. You are given a string s denoting the direction

Check if two numbers are co-prime or not Solution In C++/Java/Python/JS

Description Two numbers A and B are said to be Co-Prime or mutually prime if the Greatest Common Divisor of them is 1. You have been given two numbers A and B, find if they are Co-prime or not. Example Input : 2 3 Output : Co-Prime Input : 4 8 Output : Not

Product of the Last K Numbers

Design an algorithm that accepts a stream of integers and retrieves the product of the last k integers of the stream. Implement the ProductOfNumbers class: ProductOfNumbers() Initializes the object with an empty stream. void add(int num) Appends the integer num to the stream. int getProduct(int k) Returns the

Removing Minimum Number of Magic Beans

Problem Description You are given an array of positive integers beans, where each integer represents the number of magic beans found in a particular magic bag. Remove any number of beans (possibly none) from each bag such that the number of beans in each remaining non-empty bag (still containing at

Product of Array Except Self

Problem Description Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer. You must write an

Substring with Concatenation of All Words

Problem Description You are given a string s and an array of strings words. All the strings of words are of the same length. A concatenated string is a string that exactly contains all the strings of any permutation of words concatenated. For example, if words = ["ab","

Minimum Window Substring

Problem Description Given two strings s and t of lengths m and n respectively, return the minimum window substring of  s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "". The testcases will be

Substrings of Size Three with Distinct Characters Solution In C++/Python/Java/Javascript

Problem Description A string is good if there are no repeated characters. Given a string s , return the number of good substrings of length three in s . Note that if there are multiple occurrences of the same substring, every occurrence should be counted. What is a substring? A substring is

Max Consecutive Ones III Solution In C++/Python/Java/JS

Problem Description Given a binary array nums and an integer k, return the maximum number of consecutive 1's in the array if you can flip at most k 0s. Binary Array: An array with only 0s or 1s. Explanation You're given an array of binary values

Longest Repeating Character Replacement

Problem Description You are given a string s with all Upper Case characters (‘A,’’ B,’….’Z’) and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform this operation at most k times. Return the length of

Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit

Problem Description Given an array of integers nums and an integer limit, return the size of the longest non-empty subarray such that the absolute difference between any two elements of this subarray is less than or equal to the limit. What is a Subarray ? It's a sequence of

Minimum Size Subarray Sum

Problem Description Given an array of positive integer nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal to the target. If there is no such subarray, return 0 instead. What is a Subarray ? It's a sequence of

Count the Number of Substrings With Dominant Ones

Problem Description You are given a binary string s. A string is called a good substring if it has dominant ones, i.e., if the number of ones in the string is greater than or equal to the square of the number of zeros in that particular substring. Return the

Longest Substring Without Repeating Characters

Problem Description You will be given a string. Find the longest substring of the string s such that each character in that particular substring is unique. What is a Substring? A substring is a contiguous sequence of characters within a string. For a string s = "abcdef", a substring