Everything is pros, with a good environment and working culture.
No such thing, everything is good.
There were 4 rounds focused on Data Structures and Algorithms (DSA). The topics covered included Stacks, Trees, Heaps, and Graphs. Time and space complexity were discussed in detail, with multiple follow-ups. Aim to solve LeetCode Medium and Hard
Asked me 2 LeetCode questions: 1. Maximum absolute difference between the sum of two contiguous sub-arrays. 2. Partition a set into two subsets such that the difference of subset sums is minimum.
Phone interview and then a call with a coding test. Pay attention to code; you can find it at LeetCode, where examples are provided for the codes you can use.
There were 4 rounds focused on Data Structures and Algorithms (DSA). The topics covered included Stacks, Trees, Heaps, and Graphs. Time and space complexity were discussed in detail, with multiple follow-ups. Aim to solve LeetCode Medium and Hard
Asked me 2 LeetCode questions: 1. Maximum absolute difference between the sum of two contiguous sub-arrays. 2. Partition a set into two subsets such that the difference of subset sums is minimum.
Phone interview and then a call with a coding test. Pay attention to code; you can find it at LeetCode, where examples are provided for the codes you can use.