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

Sign in Subscribe

Kunal Shaw

Insertion Sort Algorithm

Let us understand this algorithm with an analogy This algorithm works like organizing cards in your hand during a card game. Imagine you start with one card, which is considered sorted by itself since there are no other cards to compare it. Therefore, the first element is assumed to be

Selection Sort Algorithm

Definition Selection sort is a sorting algorithm that selects the smallest element from an unsorted part in each iteration and places that element at the beginning of the unsorted part. Let us understand this algorithm with an analogy Imagine a teacher organizing students in a morning assembly by height, from

Bubble Sort Algorithm

Definition Bubble Sort is a simple sorting algorithm that repeatedly steps through the list of numbers, compares adjacent numbers, and swaps them if they are in the wrong order. This process continues until the list is sorted. The largest unsorted element "bubbles up" to its correct position after

Cisco OA-1 2022

Problem Description Alice and her friends are taking part in a CISCO hackathon, where they face a programming challenge centered around strings. Their objective is to create strings of length N using the characters 'A' and 'B', ensuring that no two 'B's are

Subarray Sum Equals K

Problem Description Given an array of integer nums and an integer k, return the total number of continuous subarrays whose sum equals k. Examples : Input: nums = [0, 1, 2, 3, 4, 5, 6], k=9 Output: 2 Explanation: There are 2 subarrays whose sum is 9 i.e. [2, 3,

Range Sum Query - Immutable

Problem Statement Given an integer array nums, handle multiple queries of the following type: Calculate the sum of the elements of nums between indices left and right inclusive where left <= right. Implement the NumArray class: NumArray(int[] nums) Initializes the object with the integer array nums. int sumRange(int

Juspay OA-1 2023

Problem Description A React expert A is constantly being troubled by a React newbie B. The expert wants to block certain followers from his network in such a way that B can no longer reach out to him. In this problem, the social network is modeled as a directed graph

Morgan Stanley OA-1 2022

Problem Description In the online reselling app, Keeto, vendors can resell items with fluctuating prices. A vendor can buy an item on one day and sell it on any subsequent day, but they must sell any previously owned item before purchasing a new one. Your task is to determine the

SalesForce OA-1 2023

Problem Description You have N boxes, each containing a different number of books. Your goal is to take the minimum number of books from these boxes while following these rules: 1. You can either take all the books from a box or none at all. 2. You cannot take books

Uber OA-1 2023

Problem Description You are given a 1-indexed array of size N and need to construct a directed graph from this array such that it satisfies the following conditions: 1. Any directed edge between two nodes will have a value that defines the distance between those two nodes. These values can

Google OA-1 2023

Problem Description You are presented with an undirected tree consisting of N nodes, each assigned a specific value. Your task is to partition these nodes into the smallest number of groups possible, ensuring that no two adjacent nodes are included in the same group. For any group G, consider a

Google OA-2 2023

Problem Description You are given N toys in a shop, each with a price represented in an array A. You have a budget of C to spend on toys, and there are K broken toys that you want to avoid purchasing. For each of the Q queries, your task is

Google OA-3 2023

Problem Description You are provided with a string S made up entirely of 0's and 1's. Your task is to count the number of substrings in which the number of 1's exceeds the number of 0's. Note: A substring of a string

Google OA-4 2023

Problem Description You are presented with a matrix M that contains n rows and m columns, filled exclusively with 0's and 1's. A right-angled isosceles triangle is defined by the following criteria: * The hypotenuse must be parallel to the x-axis. * The length of the hypotenuse must

Google OA-5 2023

Problem Description You are given an array of S containing N elements. Your goal is to determine the count of distinct arrays A of N elements that satisfy the following conditions: * A[i] < A[i+1] for all 1 ≤ i < N. * The sum of the digits of A[

Google OA-6 2023

Problem Description A hybrid sequence is a sequence that can be divided into two disjoint subsequences. Every subsequence is an array. Given two arrays, A and B, of sizes N and M, respectively. You are also given a hybrid sequence S. The expression Σ (i=1 to N+M) max(

Google OA-7 2023

Problem Description You are given the following: Two integers N and K and an array A of size N. Let sequence B(B_1, B_2, ..., B_2K) of size 2K is a subsequence of array A. Let's define F(B)= (B_1 |B_2|...|B_K) ⊕ (B_

Uber OA-2 2023

Problem Description HCVs (High Capacity Vehicles) run across the city of Disney Land. Disney Land has N stops where the HCVs pick up or drop the passengers. There is a network of M bidirectional roads that connect various stops. Each road has a particular length attached to it. The Disney

Juspay OA-2 2023

Problem Description You are given a forest (it may contain a single tree or more than one tree) with N nodes. Each node has an integer value ranging from 0 to (N-1). You need to determine the depth of the forest at which the maximum number of nodes are present.

Morgan Stanley OA-2 2022

Problem Description A product manufacturing company labels all its products and manages production through an online hierarchy on their website. Each product is represented as a node in the hierarchy, where the node’s value denotes the quantity of the manufactured product. The oldest product is set as the root

Salesforce OA-2 2023

Problem Description In the game of cricket, players can score runs by hitting the ball delivered by another player (the bowler) and running between designated spots (wickets). Suppose a player is only allowed to score 1, 2, 4, or 6 runs on any ball. How many ways can the player

Cisco OA-2 2022

Problem Description Company ABC operates a corporate campus that consists of multiple buildings, which may or may not be linked to each other. Goal: Alice in figuring out the minimum number of mail rooms required to ensure all buildings are adequately serviced, considering the following constraints: Constraints: * Each building can

Morgan Stanley OA-4 2022

Problem Description An online taxi service is facing losses due to recent changes in its discount prices. To address the issue, the team has created a list of M places in a city with N routes between them. Each route has three components: 1. The pickup position ID. 2. The

Uber OA-3 2023

Problem Description Earth is now home to sentient creatures from thousands of different planets. As part of a committee maintaining the records of these visitors, you are tasked with answering queries about the guests. One evening, you receive a query from the Daily Newspaper, which is writing an article on

Juspay OA-3 2023

Problem Description You are given a forest with N nodes, where each node has an integer value from 0 to N-1. Each node's parent is described by an array, where the value at index i indicates the parent of node i. Your task is to perform a level