Tip 1: Focus on strengthening your fundamentals in Data Structures, OOPS, DBMS, and basic programming concepts before moving to advanced topics.
Tip 2: Practice coding regularly and participate in mock interviews to improve problem-solving speed, confidence, and communication skills.
Tip 1: Keep your resume concise (preferably one page) and highlight relevant technical skills, projects, and internships that align with the job description.
Tip 2: Be honest about the skills you mention and ensure you can confidently explain every project, technology, or achievement listed on your resume.
Timing: Conducted during regular working hours (not late night).
Environment: Smooth and well-organized process; professional and comfortable atmosphere.
Significant Activity: Online assessment followed by interview shortlisting; timely communication from the placement cell.
Interviewer: Friendly and professional; focused on understanding concepts and thought process rather than just final answers.
Remember Coffman conditions – Mutual Exclusion, Hold & Wait, No Preemption, Circular Wait.
Practice basic scheduling numericals and formula for waiting time.



String 'S' is NOT case sensitive.
Let S = “c1 O$d@eeD o1c”.
If we ignore the special characters, whitespaces and convert all uppercase letters to lowercase, we get S = “c1odeedo1c”, which is a palindrome. Hence, the given string is also a palindrome.
Use two-pointer approach or reverse string and compare. Time complexity O(n).



Input: ‘n’ = 5, ‘a’ = [1, 2, 3, 4, 5]
Output: [4, 2]
The second largest element after 5 is 4, and the second smallest element after 1 is 2.
Traverse array once while maintaining two variables (largest and second largest). Time complexity O(n).
Timing: Conducted during normal working hours via scheduled video call (not late night).
Environment: Professional and smooth; the interviewer ensured proper connectivity and made the candidate comfortable before starting.
Significant Activity: Focused on problem-solving approach; asked to explain logic clearly and discuss time & space complexity. Some follow-up questions were based on the optimized approach.
Interviewer: Friendly, patient, and interactive; gave hints when required and mainly evaluated conceptual clarity and structured thinking rather than just the final answer.
Difference between process and thread. (Learn)
Focus on memory sharing, overhead, and execution context.



a) Duplicate elements may be present.
b) If no such element is present return -1.
Input: Given a sequence of five numbers 2, 4, 5, 6, 8.
Output: 6
Explanation:
In the given sequence of numbers, number 8 is the largest element, followed by number 6 which is the second-largest element. Hence we return number 6 which is the second-largest element in the sequence.
Traverse the array once while maintaining two variables (largest and second largest). Update them accordingly without sorting.
Time Complexity: O(N)
Space Complexity: O(1)



A majority element is an element that occurs more than floor('N' / 2) times in the array.
Use Moore’s Voting Algorithm to find the candidate in O(N) time and O(1) space, then verify if it appears more than N/2 times.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?