← Back to Directory

Boston Consulting Group

Large Enterprises

Screna has 4 Boston Consulting Group interview write-ups. The most reported round is the technical phone screen (4).

4 interview notes · updated Jun 2026

Boston Consulting Group·AI Engineer·Technical Phone Screen

Jun 2026
BCG AI Engineer interview with a math/logic puzzle that felt more like a coding challenge than anything AI-related. Just the one question shared here but it was a bit of a curveball.
  • Given a specific month and day, along with the moon phase on January 1st, calculate what moon phase it would be on that date. Assume standard month lengths and a cycle of 8 repeating phases.

“Took me a minute to even parse what they were asking.”

View Post

Boston Consulting Group·AI Engineer·Technical Phone Screen

May 2026
BCG AI Engineer interview with a string manipulation coding question. Pretty straightforward on the surface but worth thinking through the edge cases carefully.
  • Given a sequence of letters, count how many times consecutive characters differ, treating uppercase and lowercase as the same letter.

“My first instinct was to just iterate and compare neighbors after lowercasing everything, which works fine.”

View Post

Boston Consulting Group·AI Engineer·Technical Phone Screen

May 2026
BCG AI Engineer interview with a grid simulation problem that's trickier to implement cleanly than it looks on paper.
  • You're given a 2D grid of colored bubbles. Any bubble with at least 2 neighbors of the same color (up, down, left, right) pops. All qualifying bubbles pop at the same time, popped cells become 0, and remaining bubbles above fall down to fill the gaps. Implement this.

“The simultaneous popping part is what gets you if you're not careful.”

View Post

Boston Consulting Group·AI Engineer·Technical Phone Screen

Apr 2026
BCG AI Engineer interview with a coding round that leaned more algorithmic than I expected. One question on array parity patterns that took me a minute to fully wrap my head around.
  • Given an integer array, count all contiguous subarrays where every pair of adjacent elements alternates between odd and even. Subarrays of length 1 count too.

“My first instinct was to reach for a brute force O(n^2) scan and I started talking through it before realizing there's a cleaner linear pass.”

View Post