Summary
I recently took a Codesignal assessment for Visa and unfortunately did not pass. I encountered two specific coding problems, and I'm sharing them to help others prepare.
Full Experience
I just completed the Codesignal assessment for Visa and failed. I want to share the exact questions I received to help others who are preparing for this assessment. I hope this helps you.
Interview Questions (2)
Given a string text, count the number of substrings of length 3 where the first and last characters are the same.
Examples:
text = ""->0text = "abc"->1(for "abc")text = "abcxccc"->2(for "abc" and "ccc")
Given a list of numbers readings, for each number, repeatedly add its digits until the result is a single digit (its digital root). Finally, return the maximum digital root found among all numbers in the list.
Example:
readings = [123, 456, 789, 101]- 123 -> 1+2+3 = 6
- 456 -> 4+5+6 = 15
- 789 -> 7+8+9 = 24
- 101 -> 1+0+1 = 2
- 6 (stays 6)
- 15 -> 1+5 = 6
- 24 -> 2+4 = 6
- 2 (stays 2)
[6, 6, 6, 2]. The maximum is 6.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.
Summary
I recently participated in an Online Assessment for a Summer internship role at VISA. The assessment, conducted on CodeSignal, consisted of four coding challenges that I had 70 minutes to complete.
Full Experience
I received information from our placement cell about VISA's Summer internship role on campus. After a couple of reschedules, the Online Assessment (OA) was finally set for October 24th. The OA was conducted on CodeSignal and comprised 4 questions, totaling 600 marks, with a time limit of 70 minutes. We received the access link a day prior but were required to take the assessment at the scheduled time in our college lab.
Interview Questions (4)
Given an integer n, print a square pattern where the outer border is formed by asterisks (*) and the inner part is filled with hyphens (-). For n=4 the output should be:
****
*--*
*--*
****
Given a list of strings, for each string, reverse it only if both its first and last characters are vowels. The first and last vowel characters themselves should remain in their original positions. If the condition is not met, the string should remain unchanged.
Examples:
Input: ["abcde", "acvbn", "Etuilo"]
Output: ["adcbe", "acvbn", "Eliuto"]
Given an array of numbers, find the total count of 'soowath' subsequences. A subsequence is 'soowath' if it consists of numbers with alternating parity (odd, even, odd, ...) OR if all numbers are odd OR if all numbers are even.
Examples of 'soowath' sequences:
- 1 2 3 4 (alternating)
- 1 3 5 7 (all odd)
- 2 3 4 7 (alternating)
- 4 8 2 6 (all even)
Examples of NON-'soowath' sequences:
- 1 2 4
- 2 3 5
For input = [1, 2, 3, 4], the output should be 10. The 'soowath' subsequences are: (1), (1,2), (1,2,3), (1,2,3,4), (2), (2,3), (2,3,4), (3), (3,4), (4).
The constraint is 10^5, requiring a linear time complexity solution.