Shiprocket Private Limited Interview Questions, Process, and Tips

Find the length of the longest substring without repeating characters.

• Use a sliding window approach to keep track of the longest substring without repeating characters.

• Use a hashmap to store the index of each character as you iterate through the string.

• Update the start index of the window when a repeating character is encountered.

Yes, I thrive under pressure and have successfully managed high-stress situations in the past.

• I have experience handling tight deadlines and demanding projects

• I remain calm and focused under pressure, finding solutions efficiently

• I prioritize tasks effectively to manage workload during stressful times

Use dynamic programming to find the shortest path sum with negative integers allowed in a matrix.

• Implement dynamic programming to store the minimum sum at each cell

• Consider negative integers when calculating the sum of the path

• Start from the top left cell and iterate through the matrix to find the shortest path sum

Count the number of islands in a given grid of '1's and '0's.

• Iterate through the grid and for each '1' encountered, perform a depth-first search to mark all connected '1's as visited.

• Increment the island count for each new island encountered.

• Consider edge cases like grid boundaries and handling visited cells.