Tip 1 : Solve basic DSA problems daily on online platforms.
Tip 2 : Practice at least 300 Questions.
Tip 3 : Do AI-ML based projects.
Tip 1: Do not put false things on resume.
Tip 2: Add achievements and experiences into your resume.
Technical MCQ, English Test and Cognitive Assessment, total 50 MCQs.
Technical assessment consisted of topics like data structures, algorithms, fundamentals of database, cloud, and networking.
English test included grammar based MCQs & English Speaking Assessment which included Speaking on given topics, Reading given text or paragraph, etc,.
This round consisted of solving 2 DSA based coding questions of easy to medium level within 45 minutes.



Given an unsorted array of integers, the task is to find the number of subarrays having a sum exactly equal to a given number k.
nput : arr[] = [2, 3, 5], k = 5
Output : 2
I had solved this problem using prefix sum with a hash map for an optimal O(n) approach.
1) Initialize a map to store prefix sum frequencies.
2) Iterate through the array while keeping a running sum.
3) Check if (prefix_sum - k) exists in the map to count valid subarrays.
4) Update the map with the current prefix sum.



Given an array of strings strs, group the anagrams together. You can return the answer in any order.
When 2 string contains same letters with same frequency then this strings are called anagrams of each other.
I created a unordered_map which has the key is the sorted version of the word & the value is a list of words that share the same sorted form.
Then iterate Over the Strings:
Sort each word alphabetically.
Use the sorted word as a key to insert into the hash map.
Finally return the Result.
A panel of 2 person asked questions based on OS, DBMS, OOPS, Project Discussion, and some HR questions like about family background, hobbies, goals & achievements.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?