I gave a OA Codesignal test for CapitalOne Senior Software Engineer - Full Stack role. All the LeetCode discussions was accurate enough. I got 4 questions in total.
Easy array question
Can't remember the question but doesn't require much effot
Sorting deck
We would be given a deck of cards and we need to find in how many shuffle the deck will be sorted. A shuffle means picking a card from front and adding it to the end. Brute Force itself got accepted.
Grid BFS
We would be given a 2D matrix with numbers from 0 to 255 and a maxRadius we can look upon. For each (i, j) we need to got the neighbor cells on all 8 directions upto the maxRadius given. For example, for (0, 0) with maxRadius of 2, (0, 2) is a potential neighbor. We need to find the mean of all neighbors and fill a new matrix with the answers.
PS: Would feel easy if you practice a lot of graph based traversal questions
Largest Square in Histogram
Similar one as largest rectangle in histogram. Only change is we need to find the largest square instead. Brute force got TLE so we need to use monotonic stack based solution
Verdict: Got 600/600. Waiting for furthur communication.