IBM · OA
Not reportedIBM Full-Time SWE OA Questions: 1 Experience
A 2026 IBM full-time software engineer OA with two coding questions: counting valid peaks and valleys in an array, and timing the last ball off a table.
At a glance
- Process: an online assessment (OA) with two coding questions, after applying online (report 01)
- Asked recently: a count of valid peaks or valleys that the candidate likens to LeetCode 324, and the time when the last ball leaves a table (report 01)
- Difficulty: the candidate rated it average (report 01)
- Practise first: Count Peaks and Valleys, Last Object Exit Time
Coverage: One candidate with a PhD, changing jobs, who applied online for a full-time general software engineering role. The report covers the OA only. It gives October to December 2026 as the interview period, places the OA in the month before the post, and went up on November 19, 2026.
What came up
Both questions were coding tasks: one about peaks and valleys in an array, one about balls moving off a table (report 01).
Questions we found
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| Count the valid peaks or valleys, a relative of LeetCode 324 (practice) | 1 | Oct 2026 |
| Last time a ball leaves the table (practice) | 1 | Oct 2026 |
1 detailed candidate timeline, loops, and screens
01: Full-time software engineer, two-question OA
Report date: November 19, 2026 · Interview period: 2026 Q4 (the OA was the month before the post) · Role: Software engineer, changing jobs · Degree listed: PhD · Channel: Applied online · Candidate's rating: Neutral experience, average difficulty · Result: Not stated (marked as other)
OA: two coding questions
- The first question reminded the candidate of LeetCode 324, Wiggle Sort II, but it asked for the number of valid peaks or valleys. The candidate doesn't say what makes a peak or valley valid, or whether the array is rearranged first. FastPrep's practice version, Count Peaks and Valleys, counts them in the array as given and sets the rule itself: equal neighbours merge into one flat stretch, a stretch counts when the nearest different values on both sides are both lower (a peak) or both higher (a valley), and the two ends never count.
- The second question gave a table and the positions and speeds of some balls, and asked for the moment the last ball leaves the table. The report gives no table size and says nothing about balls meeting. FastPrep's IBM version of this task is Last Object Exit Time, where the table is a line segment and two objects that collide swap velocities.
Result
The candidate doesn't say how the OA went or what happened next.
Common questions
What is on the IBM full-time OA?
In report 01, two coding questions: counting valid peaks or valleys in an array, and finding when the last ball leaves a table.
How hard is the IBM software engineer OA?
The one candidate here rated it average (report 01).
Keep practicing
- OA question 1: Count Peaks and Valleys (report 01).
- OA question 2: Last Object Exit Time (report 01).
- More IBM questions: the IBM coding question bank. It needs sign-in.
- IBM interview page: every IBM question on one IBM interview page.
- Hiring insights: the IBM hiring insights page.
- More firsthand reports: browse the Experience feed.
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.