The technical questions I was asked included: 1. What is CI/CD, and what CI/CD tools have you used? 2. How to use ArgoCD to deploy applications on Kubernetes? 3. How are Helm files structured in an application, and how do you use Helm? 4. How to troubleshoot a...

## Problem 1: Maximum Palindromes After Swaps **Problem Description:** Given an integer `n` and a string array `arr` of size `n` containing lowercase letters. You can perform the following operation any number of times: Choose two different strings and swap on...

## Question 1: Session Counting Given arrays of timestamps for user events and corresponding user IDs, find the total number of sessions across all users. A session for a user is defined as a contiguous sequence of events such that no two consecutive events fo...

I had three rounds for the IBM on-campus drive. There were two coding assessments and a final technical and HR interview. **Round 1: Online Coding Assessment (1 hour)** This round had two problems of moderate difficulty. * The first question covered greedy alg...

## Problem Description The problem involves calculating the total time during which at least one process is running, given a list of processes with their start and end times (inclusive). This requires merging overlapping intervals and summing their lengths. ``...

For the first question, I was asked to find the minimum increment value to make an array non-decreasing by incrementing non-adjacent elements. I implemented a solution that first checks for consecutive descents, which would make it impossible to solve. Then, I...

The second question was: Given an integer array, a 'spike' is defined as an element strictly greater than its adjacent left and right elements. A 'dip' is defined as an element strictly less than its adjacent left and right elements. The first and last element...

### Recommended Preparation #### Coding Practice - Focus on array problems and sliding window variations. - Practice implementing Merge Intervals from scratch.

The online assessment consisted of two coding problems: ## Question 1: Maximum Concurrent Processes **Problem Description:** Given a set of logs, each containing a start and end time (both inclusive), representing the active period of a process. Find the maxim...