My Visa CodeSignal Experience (Bangalore November 2025)
Summary
I recently completed the Visa CodeSignal test in Bangalore in November 2025 and wanted to share the four coding questions asked to help others prepare. The test consisted of easy to medium Data Structures and Algorithms problems.
Full Experience
I recently took the Visa CodeSignal test, hoping to share my experience and the questions I encountered to help others preparing for similar assessments. The test was conducted for a role in Bangalore in November 2025.
The CodeSignal test featured four coding questions, with varying difficulty levels. I've tried my best to recall and explain these questions, though the exact wording or minor details might not be 100% precise.
Overall, I found the test to be on the easier side. My general advice would be to focus on easy to medium level Data Structures and Algorithms problems, particularly those involving arrays, strings, and basic simulation logic.
Interview Questions (4)
You’re given a matrix with cells of different colors (represented by numbers). Each color “grows” simultaneously in all four directions (up, down, left, right) at the same pace. If two adjacent cells have the same color, they pop and turn into 0. You need to determine the final state of the matrix after all the growth and popping are done.
(Something along these lines — not 100% exact, didn’t get much time on this one.)
A straightforward question: Given a student’s mark, return the grade based on the range: 90–100 → A, 80–<90 → B, 70–<80 → C, and so on.
You start at position 0 and are given an endpoint and positions of e-scooters along the line. Each e-scooter can travel exactly 10 units. A person walks until they find an available scooter. If they take one, they must travel exactly 10 points with it. You need to calculate how much total distance the person traveled using scooters.
endpoint = 20
scooters = [7, 4, 14]
Given an array of states [0,0,0,...] and a sequence of operations ["L", "L", "C1", "C10", "L", ...], apply them as follows: "L" → Find the first 0 from the left and flip it to 1. "C<index>" → Flip the value at that index back to 0 (ignore its current value). Finally, return the resulting state as a string, e.g., "10011000".
Preparation Tips
For preparation, I'd recommend focusing on easy to medium difficulty Data Structures and Algorithms questions. Specifically, practice problems involving arrays, strings, and basic simulation techniques. The test wasn't overly challenging, so a solid grasp of these fundamental areas should be sufficient.