Tip 1:Consistent Practice: Dedicate time every day to practice coding and problem-solving on platforms like LeetCode or HackerRank. Regular practice enhances your coding skills and prepares you for technical interviews.
Tip 2: Networking and Communication: Engage in extracurricular activities and events to improve your communication skills and expand your network. Building relationships with peers, mentors, and professionals can open doors to valuable opportunities and support in your career journey.
Tip 3:Embrace Your Journey: Understand that setbacks and challenges are a natural part of growth. Trust in your abilities and have confidence that you can overcome any obstacles that come your way.
Tip 1:Tailor Your Resume: Customize your resume for each job application by highlighting relevant skills, experiences, and achievements that align with the job description. Tailoring your resume increases your chances of catching the recruiter's attention and getting noticed.
Tip 2: Keep it Concise: Keep your resume concise and focused, aiming for a one-page document whenever possible. Use bullet points to convey information efficiently and prioritize the most relevant details. A concise resume is easier for recruiters to scan and increases the likelihood of them reading it thoroughly.
Introduction, 2 DSA coding questions, 1st Question Leetcode (Two sum problem) desired optimized space and time complexity. 2nd Check Valid Parentheses using stack.
Some questions were asked from my Paytm internship work, creating test cases on scenario-based problems.



(Two sum problem) desired optimized space and time complexity.
I solved using binary search as the array was sorted.



Check Valid Parentheses using stack.
Introduction, Given an array and sample test cases and asked to understand the question by using sample test cases then code the solution.
It took time for me to understand the logic behind the sample test case. Then able to solve the question. Some questions were asked during my Paytm internship work.
Given an array and sample test cases and asked to understand the question by using sample test cases then code the solution.
It took time for me to understand the logic behind the sample test case. Then able to solve the question.
Using Map
The interviewer was very friendly. Asked Introduction, 1 DSA coding question. Sort the array in one loop without using extra space & complexity. Array with element 0,1,2. Some questions were asked from a tool I used in my internship and some scenario-based problems.



Sort the array in one loop without using extra space & complexity. Array with element 0,1,2.
Initially, I provided a solution using two pointers. Subsequently, the interviewer requested an optimization of the code. I then proceeded to count all occurrences of 0, 1, and 2, storing them in three variables. Finally, I populated the array using these counts.
Introduction, Such a long discussion, The Interview started with a DSA question, Print the total permutations string of a given string using recursions and 1 puzzle question (25 horse) famous question. Detailed discussion on Team and some behavioral questions.
I was able to answer both puzzle and coding questions.



Print the total permutations string of a given string using recursions and 1 puzzle question (25 horse) famous question.
Solved using recursions

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?