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

Sign in Subscribe

Md Kamran

Coming Soon..

Hold tight! Our team is working on more articles. We're constantly trying to bring new articles every week.

Coming Soon..

Hold tight! Our team is working on more articles. We're constantly trying to bring new articles every week.

Coming Soon..

Hold tight! Our team is working on more articles. We're constantly trying to bring new articles every week.

Coming Soon..

Hold tight! Our team is working on more articles. We're constantly trying to bring new articles every week.

Coming Soon..

Hold tight! Our team is working on more articles. We're constantly trying to bring new articles every week.

Coming Soon..

Hold tight! Our team is working on more articles. We're constantly trying to bring new articles every week.

Coming Soon..

Hold tight! Our team is working on more articles. We're constantly trying to bring new articles every week.

Coming Soon..

Hold tight! Our team is working on more articles. We're constantly trying to bring new articles every week.

Next Greater Element I

Problem Description We are given two arrays: nums1 (smaller) and nums2 (larger). For each element in nums1, find where it appears in nums2. Once you find it in nums2, look to the right of its position to find the next element that is larger. If no such element exists, return

Reverse String

Problem Description You are required to write a function that reverses a string, where the input string is given as an array of characters s. Example Input: s = ["a","b","c","d","e"] Output: ["e","d"

Oracle OA-1 2022

Problem Description Aaron is constructing a non-decreasing sequence seq (as defined: either strictly increasing or remaining the same, but never decreasing) of pebbles. Each element in the sequence represents the number of pebbles in a stack that Brian, his friend, has created. However, Aaron's mischievous younger brother, Tim,

JP Morgan OA-1 2022

Problem Description You need to write the following function: int ProductOfSums(int arr[], int n); The function takes an integer array arr of size n as input, where: 1. The first portion of the array (starting from index 0 up to some index i) is sorted in ascending order. 2.

Flipkart OA-1 2023

Problem Description Alex and Jordan are coding friends. Jordan decides to practice more since Alex is initially ahead. They each complete a certain number of problems daily. Your task is to find the minimum number of days required for Jordan to solve more problems than Alex. If Jordan can never

Intuit OA-1 2023

Problem Description A college passout named Bob is returning to his own college for hiring candidates for the company he works for. Bob is very excited to go back to his college but realizes after entering that his college has changed a lot. After becoming a university, there are a

Zomato OA-1 2022

Problem Description Imagine you have a special typing machine with the following keys: Key 1: Prints the letter 'A' on the screen. Key 2: (Ctrl-A) Selects everything that has been printed on the screen. Key 3: (Ctrl-C) Copies the selected content to a clipboard. Key 4: (Ctrl-V) Pastes

BNY Mellon OA-1 2023

Problem Description A data analyst is given an array stockPrices[], representing the prices of a stock over the past n days. The task is to select a subsequence of stock prices, referred to as selectedDays. This subsequence is considered balanced if the following condition holds: For any i > 0,

JP Morgan OA-2 2022

Problem Description Write a function: int MinSizeArray(int* arr, int n, int k); Parameters: * The function takes in an array arr of n positive integers and a positive integer k as inputs. Task: Remove elements from the array based on the following rules: 1. In one turn, exactly three consecutive

Oracle OA-2 2023

Problem Description You are given three integers A, B, and C. You have an expression as ((A|X)&(B|X)) = C. The task is to determine if a number X exists such that the expression holds and if it does then, print the minimum value of X else print

Flipkart OA-2 2023

Problem Description A schedule for an upcoming tech conference has been released, listing the start and end times of each session. Once a session begins, attendees cannot enter or leave the room. Moving between sessions takes no time. The task is to determine the maximum number of sessions a single

Intuit OA-2 2023

Problem Description Chef enters the kitchen which consists of N linear blocks where each block contains only 1 ingredient from a list of ingredients. Chef has to prepare the dish using one ingredient I. To prepare the dish D, the first task for Chef is to group blocks of all

Zomato OA-2 2022

Problem Description Given three integers A, B, and C, the goal is to compute the sum of all possible numbers that can be formed using the digit 4 up to A times, the digit 5 up to B times, and the digit 6 up to C times. Note: Output the

BNY Mellon OA-2 2023

Problem Description Lily is guiding a group of young students for an upcoming Mathematics Challenge in honor of Women's Day. In one of her lessons, she decides to teach the students about modulo arithmetic. She takes an array of numbers and asks the girls to perform the following

Oracle OA-3 2023

Problem Description Alice has an integer array A of length N. However, due to a virus, some digits in these integers have been replaced by uppercase English letters from 'A' to 'J'. For example, let us suppose an integer was "1221321", and due to

Flipkart OA-3 2023

Problem Description A networking company is implementing procedures to manage network traffic. The network server is connected to N devices (numbered from 0 to N-1). The server receives messages from each of these N devices, which are then transmitted in different possible sequences. The team has generated M possible sequences

JP Morgan OA-3 2023

Problem Description You are provided with a string str of length n. Your task is to find and print the largest integer found within the string. An integer is formed by consecutive digit characters in the string. Note: * If no integer is present in the string, print -1. * If the