Status: 2023 Grad - Tier 1
Position: SDE at MNC
Date: 2nd Week December
Talent Acquisition team reached out to me over email.
HackerRank Assessment - One easy, one medium LC question
Round 1 - CoderPad Interview
1. Given integer array of size n and startIndex. arr[i] >= 0. Starting from arr[startIndex], follow each element to the index it points to. If there is a cycle return its length, otherwise return -1;
2. Given a M x N matrix, you start with bottom-left cell and should end at top-right corner of matrix, each cell has some coins, return the maximum no. of coins possible to collect.Superday - Four rounds were scheduled with a break of 15 mins
- DSA
- Software Engineering Practices
- Software Design and Architecture
- Hiring Manager Round
Round 1 : DSA
1. https://leetcode.com/problems/candy/ - Couldn't finish coding
2. https://leetcode.com/problems/coin-change-ii/description/ - Finished recursive solution with memoization, couldn't complete the optimized iterative DP.Result : Didn't proceed to next rounds.
Suggestions : Practice consistently, don't lose touch with DSA problems. All the best!
Comments (1)