IBM Coding Assessment 2 - On campus
Summary
I took the second coding assessment for an on‑campus interview at IBM, which included a problem about finding strictly increasing contiguous slopes of size K and a framework bug‑fixing task.
Interview Experiences & Insights
IBM Coding Assessment 2 - On campus
IBM Online Assessment -On Campus-2 Coding Problems
IBM Coding Assessment Question | Similar Strings Based on Character Frequency Difference ≤ 3
IBM India Online Assessment (OA) | Application developer-Cloud fullstack
IBM (Application Developer-Cloud FullStack) - Coding Assesment tricky question
12 more experiences below
I took the second coding assessment for an on‑campus interview at IBM, which included a problem about finding strictly increasing contiguous slopes of size K and a framework bug‑fixing task.
I completed the IBM online assessment, which consisted of two coding problems.
I faced this similarity‑checking problem during an IBM coding assessment and described my frequency‑counting solution.
I completed a 60‑minute HackerRank online assessment for an Application Developer – Cloud Full‑Stack role at IBM India, which consisted of two coding problems.
I took an IBM Application Developer coding assessment that featured a tricky question about counting ideal numbers in a given range.
I experienced an hour-long interview with IBM for an AI Developer Entry Level role, which included a string manipulation problem and a challenging REST API integration problem where I had to fetch and process movie data.
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.
I participated in an IBM Online Assessment where I encountered two algorithm problems, 'Maximize Decryption Value' and 'Maximum Distinct Split Sum'. I was unable to solve them efficiently due to time complexity issues.
I attended the IBM Campus Hiring Drive for an Associate System Engineer role as a final-year B.Tech student. The process involved multiple assessment and interview rounds, and despite receiving a background verification request, I was not ultimately selected.
I participated in an IBM US coding assessment for a Data Science role, which focused on designing an API rate-limiting system.
This post details an Online Assessment (OA) at IBM, featuring a problem to find the length of the longest bitonic subarray.
I participated in a six-round on-campus recruitment drive by IBM for an ASE position, which included online coding tests, communication assessments, group discussions, and technical and HR interviews, encountering coding problems similar to LeetCode's Repeated DNA Sequences and Single Element in a Sorted Array.
I interviewed for a Summer Intern position at IBM, going through a screening round and an HR round. I successfully got shortlisted after the screening round and received the final selection after the HR round, being selected along with seven of my batchmates.
I successfully cleared my on-campus interview for an ISDL role at IBM in 2024, which consisted of two comprehensive technical rounds and a combined HR round, covering a wide range of computer science fundamentals and specific project discussions.
I successfully navigated an online test and two interview rounds for the Associate Consultant role at IBM India, securing a full-time offer. The process tested my coding skills, technical knowledge in DBMS, OOP, concurrency, and problem-solving abilities.
I successfully secured an offer for the Associate Consultant position at IBM in India. The interview process involved an online coding and English test, followed by two rounds of interviews focusing on technical and object-oriented programming concepts, as well as problem-solving.
I navigated IBM's recruitment process for a Software Developer role as a fresher, which generally consisted of an aptitude test, comprehensive technical interviews, and a final HR discussion. The technical rounds particularly emphasized Data Structures and Algorithms through several classic LeetCode problems.