InterviewDigestCoding Assessment Questions
7 real questions extracted from Coding Assessment rounds.
SQL query involving join operations
Offline round with 3 questions covering simple if-else logic, SQL query with join, and pattern printing. Difficulty was easy to moderate. Candidates solving at least 2 questions advanced to the technical interview.
Pattern printing problem
Offline round with 3 questions covering simple if-else logic, SQL query with join, and pattern printing. Difficulty was easy to moderate. Candidates solving at least 2 questions advanced to the technical interview.
Max Heap implementation or problem
Virtual proctored round with 2 coding questions (Greedy, Max Heap) of moderate difficulty. Shortlisted candidates proceeded to the next round.
Simple if-else logic problem
Offline round with 3 questions covering simple if-else logic, SQL query with join, and pattern printing. Difficulty was easy to moderate. Candidates solving at least 2 questions advanced to the technical interview.
Greedy algorithm problem
Virtual proctored round with 2 coding questions (Greedy, Max Heap) of moderate difficulty. Shortlisted candidates proceeded to the next round.
Solve three coding problems: one involving If-Else Logic (Medium difficulty), one requiring SQL Query with JOINs (Medium difficulty), and one involving Pattern Printing (Difficult difficulty) within 80 minutes.
Second round of the IBM On-Campus Drive 2025, conducted offline in the morning session. Candidates solved 3 coding questions within 80 minutes, covering If-Else Logic, SQL Query with JOINs, and Pattern Printing.
Solve two coding problems involving Greedy Algorithms and Max Heap within a 1-hour timeframe.
First round of the IBM On-Campus Drive 2025, conducted online and proctored. Candidates solved 2 coding questions within 1 hour, focusing on Greedy Algorithms and Max Heap.