SDE - Intern

Tip 1: Keep it clear and structured: Start with a brief background (education), move to your key skills (tech stack), and then mention what you’re currently focusing on. Avoid long stories—keep it crisp and relevant to the role.

Tip 2: Highlight what matters for the role: Focus on skills and experiences that align with the job. For example, if it’s a backend role, mention your work with Node.js, APIs, or projects instead of unrelated details.

Tip 3:Sound natural and confident: Since it’s a telephonic round, your voice matters more than body language. Speak at a steady pace, avoid rushing, and make sure you sound engaged and confident rather than memorized.

Tip 1: Keep it relevant, not academic-heavy: Don’t list every subject you studied. Focus only on key subjects like DSA, DBMS, or OOP that are relevant to the job role.

Tip 2: Connect your tech stack to real work: Instead of just naming technologies (like Node.js, MongoDB), briefly mention how you used them—projects, APIs, or real-world applications.

Tip 3: Show progression, not just knowledge: Explain how you moved from learning basics in college to actually applying them in projects or practical work. This shows growth and hands-on experience.

Tip 1:Don’t stay silent while solving. Keep explaining your thought process step by step.

Tip 2:Before jumping to a solution, restate the question in your own words.
This shows understanding and avoids mistakes.

Tip 3:Most puzzles look complex but are simple when divided.

Step 1: I first carefully understood the problem statement of Furthest Building You Can Reach and identified that at each step we need to decide whether to use bricks or ladders to move to the next building.

Step 2: My initial approach was greedy—I tried to use bricks for every upward climb and reserve ladders for larger jumps, but I realized that deciding this upfront without tracking previous climbs could lead to a suboptimal result.

Step 3: I then refined my approach by keeping track of all the height differences where climbing was required. I used a min-heap to store these climbs so that I could always assign ladders to the largest jumps and use bricks for smaller ones.

Step 4: While iterating through the buildings, I pushed each positive height difference into the heap. If the heap size exceeded the number of ladders, I used bricks for the smallest climb (by removing it from the heap).

Step 5: If at any point the bricks became negative, I concluded that it was not possible to move further and returned the current index as the answer. This optimized approach worked efficiently, and the interviewer was satisfied with the solution and explanation.

Tip 1: Keep your answer concise and to the point.
Tip 2: Study basic system design.