This is a test.
Urd grgh htrg gfgh gtgy
I had a Skype interview which involved questions from basic DS and algorithms, like tree search, sorting, and string matching. Then, I was asked questions pertaining to my field of interest (Android).
I had a software engineer interview at Flipkart. The round included two DSA questions, which involved the concepts of min-heap and max-heap, and one question related to dynamic programming (DP). Following that, there was a hiring manager round.
The interview happened through GRID. It consisted of two DSA rounds followed by one HR round. The technical rounds were mainly focused on DP and graphs, covering LeetCode Medium and Medium-Hard level problems. The HR round delved into my grid project
I had a Skype interview which involved questions from basic DS and algorithms, like tree search, sorting, and string matching. Then, I was asked questions pertaining to my field of interest (Android).
I had a software engineer interview at Flipkart. The round included two DSA questions, which involved the concepts of min-heap and max-heap, and one question related to dynamic programming (DP). Following that, there was a hiring manager round.
The interview happened through GRID. It consisted of two DSA rounds followed by one HR round. The technical rounds were mainly focused on DP and graphs, covering LeetCode Medium and Medium-Hard level problems. The HR round delved into my grid project