Online Assessment DSA Questions (Google, Amazon, Cisco, etc)

Sign in Subscribe

Accenture OA-12 2024

Problem Description A poet has asked for assistance in writing poems. He has given you a string S and a dictionary D. Your task is to find, from the dictionary, a word which rhymes best with S. Words are said to rhyme when the last syllables of the words are

Accenture OA-11 2024

Problem Description Bob goes to a supermarket to buy candies represented by an array A for a Halloween party. His mother gave him M amount of money. Due to the festive season, there are several offers in the supermarket. One such offer useful for Bob is, if the price of

Accenture OA-10 2024

Problem Description Jack has an array A of length N. He wants to label whether the number in the array is even or odd. Your task is to help him find and return a string with labels "even" or "odd" in sequence according to which the

Accenture OA-9 2024

Problem Description You are given a string array S that contains the names of some files along with their versions. Your task is to find and return the latest version out of all the files that are correctly named in the array. A file is considered correct if it follows

Accenture OA-8 2024

Problem Description Ian has been given an array A of length N. He wants to find the sum of elements at even positions after reversing the array. Your task is to help him find and return an integer value representing the sum of the array elements present at even positions

Accenture OA-7 2024

Problem Description You are given a string array of length N . Your task is to find and return an integer value representing the maximum permutation count of the strings after removing all the vowels from every element in the string array. Notes: * If a string has no permutable characters (all

Accenture OA-6 2024

Problem Description Alex is exploring a series and she came across a special series in which * f(N) = f(N-1) * f(N-1) + f(N-2) * f(N-2) * where, f(0) = 1 and f(1) = 1 Your task is to help Alex find and return an integer value representing the Nth number

Accenture OA-5 2024

Problem Description Noah is given an integer array A of length N. He must perform the following operations on the array: * Select any integer pair/s from the given array with their sum equal to 18. * From this selection, choose the pair with the maximum product such that the first

Accenture OA-4 2024

Problem Description You are given an array A of length N. Your task is to find and return an integer value representing the difference between the sum of elements at odd index and XOR of elements at even index. Input Format: * input1: An integer N, representing the length of array.

Accenture OA-3 2024

Problem Description Jack has an array A of length N. He wants to label whether the number in the array is even or odd. Your task is to help him find and return a string with labels "even" or "odd" in sequence according to which the

Accenture OA-2 2024

Problem Description Daniel has a ball. He wants to find the ball's rebound height , which he dropped from height H with an initial velocity V. After the Nth rebound the final velocity of the ball is Vn . Your task is to help him and return an integer value

Accenture OA-1 2024

Problem Description You are given a string S of length N. Your friend wants to know the number of times his favorite letter C occurs in the string. Your task is to help your friend find and return an integer value representing the number of times a character occurs in

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

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,

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

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

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

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

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