IBM ASE Coding Interview
Summary
I had a coding assessment for IBM's ASE pooled placement, which involved two significant coding challenges related to array manipulation and identifying unstable processes based on timestamps and limits.
Full Experience
I had the coding assessment for IBM. This was for Pooled placement for university students. This was offline Hackerrank exam.
I was given 2 coding questions.
Straight to the questions:
Interview Questions (2)
Max Subarray with Equal 0s/1s and Prefix Condition
You are given an array with only 0 and 1. You have to return the length of the maximum subarray that satisfies the following 2 conditions:
- No. of 0's and No. of 1's should be equal.
- Prefix of the subarray should never have the No. of 0's more than No. of 1's. i.e. No. of 1's can be more than or equal to No. of 0's.
Example:
Input:
arr = [1, 0, 1, 1, 0, 0, 1]
Output:
6
As [1, 0, 1, 1, 0, 0] is the most longest valid answer.
Count Unstable Processes
You are given Process, its timestamp, and its limit. You are to find the No. of Unstable processes and return it.
A process is considered Unstable if the process has atleast one increasing and atleast one decreasing limit according to the timestamps.
Timestamps are given in seconds.
Example:
Input:
process = ["A", "B", "A", "C", "D", "A"]
timestamp = [10, 25, 30, 35, 15, 20]
limit = [20, 18, 10, 8, 30, 27]
Output:
1
As Process "A" has 20->27->10, which has 1 increasing and 1 decreasing limit. Therefore, 1 is the answer.