CapitalOne OA | Senior Software Engineer - Full Stack (India)

capitalone logo
capitalone
Senior Software Engineer - Full StackIndiaOngoing
September 18, 20259 reads

Summary

I successfully completed the CapitalOne Senior Software Engineer - Full Stack Online Assessment via CodeSignal, achieving a perfect score of 600/600, and I'm currently awaiting further communication regarding the next steps.

Full Experience

I recently took the CapitalOne Senior Software Engineer - Full Stack Online Assessment (OA) through CodeSignal. My preparation based on LeetCode discussions proved to be quite accurate and helpful for this test. The assessment comprised a total of four coding questions, covering various data structures and algorithms. I managed to score a perfect 600/600 on the assessment, and now I'm eagerly waiting to hear back about the subsequent interview rounds.

Interview Questions (3)

Q1
Sort Deck by Shuffling
Data Structures & Algorithms

Given a deck of cards, the task is to determine the minimum number of shuffles required to sort the deck. A single shuffle operation involves picking the card from the front of the deck and moving it to the end.

Q2
Grid Neighbor Mean Calculation
Data Structures & Algorithms

I was given a 2D matrix containing numbers ranging from 0 to 255, along with a maxRadius. For each cell (i, j) in the matrix, I needed to calculate the mean of all its neighbor cells. Neighbors are defined as any cell within the maxRadius in all 8 directions. For instance, for (0, 0) with a maxRadius of 2, (0, 2) would be considered a potential neighbor. The final output required filling a new matrix with these calculated mean values for each corresponding cell.

Q3
Largest Square in Histogram
Data Structures & Algorithms

This problem was presented as a variation of the classic 'Largest Rectangle in Histogram' problem. The objective was to find the largest square that can be formed within a given histogram.

Preparation Tips

My preparation involved reviewing LeetCode discussions, which proved accurate for understanding the types of problems asked. Specifically, familiarity with graph traversal algorithms (like BFS) and techniques involving monotonic stacks would be highly beneficial, as these were directly applicable to the problems encountered.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!