There was a complete of 4 rounds.
Spherical 1: HackerRank Check
- Two questions have been requested. One was under medium query. Given an array of 1 and -1, return the utmost size of the subarray whose product is 1.
- One other query was to seek out the utmost rising contiguous sum in an array of components
Spherical 2: Technical Interview
- https://leetcode.com/issues/longest-substring-without-repeating-characters/
Spherical 3: Technical Interview
- https://leetcode.com/issues/word-break/
Spherical 4: System design Interview
- Design amazon warehouse stock the place shares must be reordered to vendor mechanically when it reaches a threshold
Ready for the interview suggestions and consequence!
