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

Sign in Subscribe

Kunal Shaw

Salesforce OA-3 2023

Problem Description After defeating Dr. Eggman, Sonic the Hedgehog has returned to the Green Hill Zone. The forest critters make him the de facto king for his victory. However, the oxygen levels in the zone are unstable, and Sonic needs to evacuate his subjects to a safe area as soon

Cisco OA-3 2022

Problem Description Sherlock Airlines has introduced a unique method to manage travelers who don't plan ahead and often try to book the same seat numbers at the travel desk, causing delays since only one person can occupy a seat. The seating arrangement consists of seats in a straight

Uber OA-4 2023

Problem Description You are tasked with ensuring that the prices of cars, initially arranged in a line, become non-decreasing as quickly as possible. The price of each car is given as an array. You can perform operations over multiple chances to adjust the car prices. At each chance X, you

Juspay OA-4 2023

Problem Description You are given a forest with N nodes, where each node has an integer value from 0 to N-1. For two given nodes x1 and x2, your task is to find their nearest common ancestor. The forest can consist of one or more trees. The root of each

Salesforce OA-4 2023

Problem Description Kitty is locked inside a horror house where there are distinct random words written on the wall. Inside the house, Kitty encounters a ghost who offers to help on one condition. The ghost will give Kitty a word, and Kitty must determine whether she can create this word

Morgan Stanley OA-3 2022

Problem Description An online streaming application wishes to analyze the popularity of web series streaming on their platform. Each web series is given a unique ID, and users vote for their favorite series. To analyze popularity, the marketing team has selected N users (with IDs from 0 to N-1) and

Cisco OA-4 2022

Problem Description You have four jugs, labeled [J1, J2, J3, J4], with capacities [C1, C2, C3, C4] and initial water amounts of [S1, S2, S3, S4]. The objective is to determine how many steps are required to reach the final state of [F1, F2, F3, F4] by transferring water between

Morgan Stanley OA-5 2022

Problem Description You are given two lists of positive integers. Write an algorithm to calculate the number of elements that are not common between the two lists. Input Format 1. The first line of the input consists of an integer, listinput1_size, representing the number of elements in the first

Juspay OA-5 2023

Problem Description You are given a maze with N cells. Each cell may have multiple entry points but not more than one exit (i.e., entry/exit points are unidirectional doors like valves). You need to find the sum of the largest sum cycle in the maze. * Each cell is

SalesForce OA-5 2023

Problem Description You are given an M * N binary matrix representing the shape of an item that is supposed to be packed for shipping. The item is contiguous, meaning it consists of a connected group of 1s, either horizontally or vertically. The shipping agency only has rectangular boxes available, and

Cisco OA-5 2022

Problem Description Find the maximum number of elements in a given array that sum up to a given target. Input: 1. The first line specifies the number of elements in the array 2. The second line specifies the target. 3. The third lines contain the elements of the array (Integers)

Morgan Stanley OA-6 2022

Problem Description A company sells products at N outlets, which are connected to each other by a series of roads. There is only one way to travel between any two outlets. Each outlet has a unique ID, and when the inventory of a certain product reaches a minimum level, K

Juspay OA-6 2023

Problem Description You are given a maze with N cells, where each cell may have multiple entry points but no more than one exit (i.e., entry/exit points are unidirectional like valves). The cells are numbered from 0 to N-1. You are tasked with finding the nearest meeting cell

SalesForce OA-6 2023

Problem Description Tom wants to catch Jerry by digging M holes on a straight track. Each hole has a certain depth, and digging a one-unit deep hole takes one unit of time. Since Tom is lazy, he asks N fellow cats to help him dig the holes. Tom assigns each

Cisco OA-6 2022

Problem Description A grocery store needs to select a set of apples where the weight difference between the largest and smallest apple is no more than k. Given the range k, find the maximum number of apples that can be selected from the input set of N apples. Input Format:

Cisco OA-7 2022

Problem Description Given an encoded string s, return its decoded string. The encoding rule is k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note that k is guaranteed to be a positive integer. You may assume that the input string is

Google OA-8 2024

Problem Description You have an infinitely long array initialized with zeros. You are given two integers, N and K, and for the next N lines, you will receive three integers L, R, and X. This indicates that you need to add X to every element in the array from index

Morgan Stanley OA-7 2022

Problem Description You are given an array that contains integers in ascending order followed by integers in descending order. All integers in the array are unique and appear only once. Your task is to compute the product of the sum of the values in the ascending part and the sum

Uber OA-5 2023

Problem Description It is the year 2050, and humans have evolved into two supernatural species: Alpha (Alph) and Beta (Bts). Yakohama, the kingdom of the Alpha group, is under threat from Beta members who plan to attack through a secret path in the forest. Akari, the king of Yakohama, must

Juspay OA-7 2023

Problem Description You are given a maze with N cells, where each cell may have multiple entry points but no more than one exit. The cells are numbered from 0 to N-1. The task is to find the node with the maximum weight. The weight of a node is defined

SalesForce OA-7 2023

Problem Description Alex is on an adventure and needs to cross a stone bridge where each stone is labeled with a random string of characters (S). He can only jump onto stones that are labeled with special characters, which are defined as any characters that are not letters (i.e.

Cisco OA-8 2022

Problem Description Given an integer array nums, find the subarray with the largest sum, and return its sum. Constraints: * 1 < nums.length <= 10^5 * -10^4 < nums[i] <= 10^4 Test Case Example 1 Input: nums = [-2, 1, -3, 4, -1, 2, 1, -5, 4] Output:

Google OA-9 2024

Problem Description You are given the following: * A tree with N nodes. * An array A that represents the value of each node. * A non-negative integer K. You are allowed to perform the following operation at most once: 1. Select a node r and make it the new root of the

Morgan Stanley OA-8 2022

Problem Description You are given an array of size n. You need to remove elements from the array in such a way that exactly three adjacent elements are removed in one turn. The elements that can be removed must satisfy the following conditions: * The second element is k greater than

Uber OA-6 2023

Problem Description Samuel has gifted Tina the Magical Dice Game for her birthday. This game involves a strip of T cells, where some cells are empty (denoted by 0), and some are blocked (denoted by 1). Tina and Samuel decide to play a competitive game on this strip. The game