IBM Senior Cloud & AI Engineer | Bengaluru | Ghosted
- Location
- Bengaluru
- Posted
- 5 Nov 2026
Summary
I interviewed for a Senior Cloud & AI Engineer position at IBM in Bengaluru, completed two technical rounds covering Kubernetes, concurrency in Go, and a LeetCode sliding‑window problem, but was later ghosted by the recruiter and the position was closed.
How it went
Hey everyone,
So I had interview for senior cloud and AI engineer. Basically they did initial HR screening.
Post that I had two technical rounds. First round basically had discussion with a senior guy. Discussion was around k8s and RAG. Also there was a coding question on concurrency in which I had to write Go code and print even odd using two goroutines alternately.
Second round also was heavily geared towards k8s and its architecture. Then a leetcode medium on sliding window. One of the easy medium. Finding longest substring with no repeating characters problem. (Leetcode # 3)
Post these two rounds, recruiter ghosted me. Like he would not even pick calls. No email. Nothing. Refreshed web page of job id post 3 days after 2nd technical round and it stated that the position got closed.
Very unprofessional behaviour from IBM HRs. Atleast communicate properly!
Questions asked (2)
- 01
Print Even and Odd Numbers Using Two Goroutines Alternately
Data Structures & Algorithms · Medium
Write a Go program that creates two goroutines: one prints even numbers and the other prints odd numbers. The two goroutines must coordinate so that the output sequence alternates between odd and even numbers (e.g., 1, 2, 3, 4, ...). Use channels or other synchronization mechanisms to achieve the alternating behavior.
- 02
Longest Substring Without Repeating Characters
Data Structures & Algorithms · Medium
Open the problemGiven a string s, find the length of the longest substring without repeating characters.
Example:
- Input: "abcabcbb"
- Output: 3
- Explanation: The answer is "abc", with the length of 3.
The problem is typically solved using a sliding window technique.