It was an on-campus opportunity that we received. The first round was an online assessment consisting of three questions, LeetCode easy to medium level. Eighteen people were shortlisted out of 250-300 people.

I went for the online assessment held on campus. The DSA questions asked were regarding DP and arrays.

1. Maximum sum of non-adjacent elements (DP): Difficulty converting a list to an array.
2. Affected by virus (DFS-based) like the island problem: Difficulty in making a list of lists into a 2D matrix.
3. Robber 2 caves: Given maximizing the number of coins taken without getting caught.
4. Square sum: The occurrences of letters in a given string and removing some occurrences according to a given number, making this sum as minimum as possible: Difficulty in map get values for char/integer type maps and performing operations on them, also difficulty in traversing through characters in a string and implementing the charAt method.