Srijan Jain - LearnYard - Free Programming & DSA Blogs | Read, Code, Excel

Sign in Subscribe

Srijan Jain

4Sum Solution In C++/Java/Python/JS

Problem Description Given an array nums of nn integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that: 0 ≤ a,b,c,d < n a,b,c and d are distinct indices nums[a] + nums[b] + nums[c] + nums[d]

Variables in C++ (Part III)

Welcome back to our series on variables in C++! In our previous article, we explored the concepts of variable scope and lifetime, learning how variables are accessed and how long they exist in memory. Now, let’s take a deeper dive into memory allocation—the process of assigning and managing

Variables in C++(PART-II)

Welcome back! If you’ve read our previous article on variables in C++, you already know what variables are, why we need them, how to define and declare them, and the key rules for naming them. But have you ever wondered where in your program you can access the variables

Input & Output Basics in C++

So far in our C++ journey, we’ve explored the basics of variables, data types, and how to perform operations on them. We’ve also delved into the concepts of scope and lifetime, understanding where variables exist and how long they stay in memory. Now that you’re comfortable with

Maximum Size of a Set After Removals Solution In C++/Java/Python/JS

Problem Description You are given two 0-indexed integer arrays nums1 and nums2 of even length n. You must remove n / 2 elements from nums1 and n / 2 elements from nums2. After the removals, you insert the remaining elements of nums1 and nums2 into a set s. Return the maximum possible

Card Flipping Game Solution In C++/Java/Python/JS

Problem Description You are given two 0-indexed integer arrays fronts and backs of length n, where the ith card has the positive integer fronts[i] printed on the front and backs[i] printed on the back. Initially, each card is placed on a table such that the front number is

Alphabet Board Path Solution In C++/Java/Python/JS

Problem Description On an alphabet board, we start at position (0, 0), corresponding to character board[0][0]. Here, board = ["abcde", "fghij", "klmno", "pqrst", "uvwxy", "z"]. We may make the following moves: 'U' moves our position

Pairs of Songs With Total Durations Divisible by 60 Solution In C++/Java/Python/JS

Problem Description You are given a list of songs where the ith song has a duration of time[i] seconds. Return the number of pairs of songs for which their total duration in seconds is divisible by 60. Formally, we want the number of indices i, j such that i

Brick Wall Solution In C++/Java/Python/JS

Problem Description There is a rectangular brick wall in front of you with n rows of bricks. The ith row has some number of bricks each of the same height (i.e., one unit) but they can be of different widths. The total width of each row is the same.

Split the Array to Make Coprime Products Solution In C++/Java/Python/Javascript

Problem Description You are given a 0-indexed integer array nums of length n. A split at an index i where 0 <= i <= n - 2 is called valid if the product of the first i + 1 elements and the product of the remaining elements are coprime. For example,

4Sum II Solution In C++/Java/Python/Javascript

Problem Description Given four integer arrays nums1, nums2, nums3, and nums4 all of length n, return the number of tuples (i, j, k, l) such that: 0 <= i, j, k, l < n nums1[i] + nums2[j] + nums3[k] + nums4[l] == 0 Examples: Input : nums1 = [1,2], nums2 = [-2,

Count Artifacts That Can Be Extracted Solution In C++/Java/Python/Javascript

Problem Description There is an n x n 0-indexed grid with some artifacts buried in it. You are given the integer n and a 0-indexed 2D integer array artifacts describing the positions of the rectangular artifacts where artifacts[i] = [r1i, c1i,r2i, c2i] denotes that the ith artifact is buried

Sort Colours Solution In C++/Java/Python/JS

Problem Description Given an array nums with nn objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors appearing in the order red, white, and blue. We will use the integers 0, 1, and 2 to represent the colors:

3Sum Closest Solution In C++/Java/Python/JS

Problem Description Given an integer array nums of length n and an integer target, find three integers in nums such that the sum is closest to the target. Return the sum of the three integers. You may assume that each input would have exactly one solution. Examples: Input : nums = [-1,

3 Sum Solution In C++/Java/Python/JS

Problem Description Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets. Examples: Input : nums = [-1, 0, 1,

Two Sum Solution In C++/Java/Python/JS

Problem Description Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input will have exactly one solution, and you may not use the same element twice. You can return the answer