Tip 1: Build strong fundamentals in Data Structures and Algorithms and practice consistently rather than cramming.
Tip 2: Work on 2–3 meaningful projects to understand real-world problem-solving and system flow.
Tip 3: Revise core CS subjects like OOP, Operating Systems, and DBMS with a focus on concepts, not memorization.
Tip 1: Include relevant projects and clearly explain your role, tech stack, and impact.
Tip 2: Keep the resume concise (preferably one page) and tailor it to the job role.



Input: ‘N’ = 5, ‘TARGET’ = 5
‘BOOK’ = [4, 1, 2, 3, 1]
Output: YES
Explanation:
Sam can buy 4 pages book and 1 page book.
Step 1: I first understood the problem and identified that checking all possible subarrays using a brute-force approach would work but would take O(N²) time.
Step 2: I explained this initial approach and then analyzed its time complexity, realizing it was not optimal for large inputs.
Step 3: I then optimized the solution by using a linear-time approach, where I maintained a running sum and reset it whenever it became negative.
Step 4: This optimized approach reduced the time complexity to O(N) and handled all edge cases efficiently.
Step 5: I clearly explained the logic, time complexity, and why the optimized solution was better, which helped demonstrate both problem-solving and optimization skills.



Anagrams are defined as words or names that can be formed by rearranging the letters of another word. Such as "spar" can be formed by rearranging letters of "rasp". Hence, "spar" and "rasp" are anagrams.
'triangle' and 'integral'
'listen' and 'silent'
Since it is a binary problem, there is no partial marking. Marks will only be awarded if you get all the test cases correct.
Step 1: I first clarified the problem requirements and confirmed that the comparison should be based on character frequency, not order.
Step 2: I checked the lengths of both strings. If the lengths were different, I concluded immediately that they cannot be anagrams.
Step 3: I created a frequency map to count occurrences of each character in the first string.
Step 4: I traversed the second string and decreased the corresponding character counts from the map.
Step 5: Finally, I verified that all character frequencies were zero, which confirmed that both strings are anagrams.
Step 6: I explained the time and space complexity of the solution and why this approach is efficient for large inputs.
The HR round focused on understanding my background, motivation for joining the company, career goals, strengths and weaknesses, and how I handle challenges and teamwork. The discussion was conversational and aimed at evaluating cultural fit, communication skills, and attitude rather than technical depth.
Tip 1: Be honest and confident while answering; avoid scripted or memorized responses.
Tip 2: Clearly explain your career goals and align them with the company’s values and role.
Tip 3: Communicate calmly, listen carefully, and structure your answers with real-life examples.

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