Young Men Christian Association (YMCA) Placement Interview Questions

Difficult level medium

• Q1. Lru cache using hashmap and doubly linked list
  View Answers (1)

• Q1. Hotel bookings possible question from interviewbit
  Add Answer

Round duration - 180 Minutes
Round difficulty - Hard

This was an online technical round on the SHL platform. The link of the test was shared to us around 3 PM. 
There were 4 sections and each section had limited time. You can NOT go back to the question you have already attempted. 
The webCam was not on. 
Section 1: Automata/ Debugging
Section 2: Coding
Section 3: Amazon Principles/Personality Based
Section 4: Aptitude/Verbal

• Q1. Favourite Operation - Problem Statement Ninja has studied the bitwise operations ‘AND’ and ‘XOR’. He received an assignment that involves these operations and ...read more
  Add Answer
• Q2. Critical Connection Problem Statement In a network with 'N' system nodes, identified from 0 to N-1, and 'M' connections, determine all critical connections. A ...read more
  Add Answer

Round duration - 50 Minutes
Round difficulty - Easy

Time: 9 am to 10 am
Mode of Interview: Amazon Chime Video
LiveCode: To write code, it was not a compiler.
The interviewer was very nice.

• Q1. Product Of Array Except Self Problem Statement You are provided with an integer array ARR of size N . You need to return an array PRODUCT such that PRODUCT[i] ...read more
  Add Answer

Round duration - 50 Minutes
Round difficulty - Medium

Time: 3 pm to 4 pm
Mode of Interview: Amazon Chime Video
LiveCode: To write code, it was not a compiler
The interviewer was time adamant and not very supportive. A shadow interviewer was also there.

• Q1. LRU Cache Design Question Design a data structure for a Least Recently Used (LRU) cache that supports the following operations: 1. get(key) - Return the value ...read more
  Add Answer

Round duration - 90 minutes
Round difficulty - Medium

• Q1. String Transformation Problem Statement Given a string str of length N, perform a series of operations to create a new string: Select the smallest character fr...read more
  Add Answer
• Q2. Counting Derangements Problem A derangement is a permutation of 'N' elements, where no element appears in its original position. For instance, a derangement of...read more
  Add Answer

Round duration - 60 minutes
Round difficulty - Medium

1 hour online interview. 
Slot was given prior via email.
The HR contacted me via email and simultaneously provided me a link where I had to write the codes during my interview

• Q1. Mike and Mobile Keypad Problem Mike, a young math enthusiast, is playing with his mom’s mobile phone, which has a keypad with 12 buttons (10 digits: 0-9, and 2...read more
  Add Answer
• Q2. Maximum Subarray Sum Problem Statement Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array. Example: Inp...read more
  View Answers (41)
• Q3. Maximum Sum of Non-Adjacent Elements Given an array/list of ‘N’ integers, your task is to return the maximum sum of the subsequence where no two elements are a...read more
  Add Answer
• Q4. Trapping Rainwater Problem Statement You are given an array ARR of long type, which represents an elevation map where ARR[i] denotes the elevation of the i th ...read more
  Add Answer

Round duration - 60 minutes
Round difficulty - Medium

• Q1. Strongly Connected Components (Tarjan’s Algorithm) Problem Statement Given an unweighted directed graph with V vertices and E edges, your task is to identify a...read more
  Add Answer
• Q2. Stock Trading Maximum Profit Problem Given the stock prices for 'N' days, your goal is to determine the maximum profit that can be achieved. You can buy and se...read more
  Add Answer

Round duration - 60 minutes
Round difficulty - Easy

This was a one hour round in which I was first told to introduce myself and then moved to questions.

• Q1. Permutation in String Problem Statement Determine if the string str2 contains a permutation of the string str1 as one of its substrings. Input: The first line ...read more
  Add Answer
• Q2. Sort 0s, 1s, and 2s Problem Statement You are provided with an integer array/list ARR of size 'N' which consists solely of 0s, 1s, and 2s. Your task is to writ...read more
  Add Answer

Round duration - 60 minutes
Round difficulty - Medium

This was based more on my communication skills rather than my technical skills. The interviewer didn't only focus on whether I knew the answer or not but if I was able to communicate my knowledge to the interviewer.

It was more of theory based interview
Questions are as follows:-
1. What are SQL and acid properties?

2. How does a website start?

3. What are deadlocks with real life examples? Give necessary conditions for deadlock. 
-> Real life examples were must. 

4. What is virtual function?

5. Tell me the most challenging this while you made your project. ( I had to pick my project on my own) 

6. Tell me the most interesting feature you found working on a language. 

7. Technical question on structures in C as I used it in my project. The interviewer asked if the structure for a linked list is changed as:-
struct node

{
int data;
struct next; 
};
I explained how this won't work as struct will be created again and again which will lead to memory limit exceeded.

• Q1. Delete Alternate Nodes from a Singly Linked List Given a Singly Linked List of integers, remove all the alternate nodes from the list. Input: The first and the...read more
  Add Answer

Round duration - 90 minutes
Round difficulty - Medium

• Q1. Count Inversions Problem Statement Given an integer array ARR of size N , your task is to find the total number of inversions that exist in the array. An inver...read more
  Add Answer
• Q2. Postfix Expression Evaluation Problem Statement Given a postfix expression, your task is to evaluate the expression. The operator will appear in the expression...read more
  Add Answer

Round duration - 40 minutes
Round difficulty - Medium

• Q1. String Rearrangement Problem Statement You are given a string of lowercase characters. The objective is to rearrange (reorder) the string so that no two adjace...read more
  Add Answer
• Q2. Pair Sum Problem Statement Given an integer array ARR of size N and an integer S , your task is to return a list of all pairs of elements such that the sum of ...read more
  Add Answer

Round duration - 40 minutes
Round difficulty - Medium

• Q1. Find Number of Islands You are provided with a 2-dimensional array/list of size N rows by M columns, containing ones (1) and zeroes (0). Here, 1 represents lan...read more
  Add Answer
• Q2. Triplets in a Sorted Doubly Linked List Given a sorted doubly linked list of distinct nodes, determine how many triplets in the list have a sum equal to a give...read more
  Add Answer

Round duration - 90 Minutes
Round difficulty - Easy

The round was scheduled at 10 AM on 2nd August, 2019, But it started a little late due to some issues in Lab devices. The test started in a full screen mode and no one was allowed to exit full screen mode.

• Q1. Remainder When Divided By 11 Problem Statement Determine the remainder when a given number, 'N' in the form of a string, is divided by 11. Input: The first lin...read more
  Add Answer
• Q2. Missing Number Problem Statement You are provided with an array named BINARYNUMS consisting of N unique strings. Each string represents an integer in binary, c...read more
  Add Answer

Round duration - 60 Minutes
Round difficulty - Medium

It was a F2F interview. The interviewer was very friendly and was working as an SDE II in Consumers team. He started with quick intro of himself and then asked mine. Then jumped into coding question. He was monitoring my every single activity throughout the interview and told me ignore whenever I type something on my laptop.

• Q1. Fish Eater Problem Statement In a river where water flows from left to right, there is a sequence of 'N' fishes each having different sizes and speeds. The siz...read more
  View Answers (1)
• Q2. Fishmonger Toll Optimization Problem A fishmonger needs to transport goods from a port to a market, crossing multiple states each requiring a toll. The goal is...read more
  Add Answer

Round duration - 75 Minutes
Round difficulty - Medium

It was a F2F interview. The interviewer was very friendly and was working as an SDE III in Payments team. He started with quick intro of himself and then asked mine. He asked me about the project I mentioned in my resume and some questions regarding the project. Then jumped into coding question. He was monitoring my every single activity throughout the interview.

• Q1. Battalions and Tanks Problem Statement Given 'N' battalions and 'M' tanks, along with an array representing the number of soldiers in each battalion, you need ...read more
  Add Answer
• Q2. Diagonal Traversal of a Binary Tree Given a binary tree of integers, find its diagonal traversal. Refer to the example for clarification on diagonal traversal....read more
  Add Answer