Coding Ninjas interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Coding Ninjas
upvote
share-icon
2 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Journey
My journey began with a curiosity to explore technology and a determination to master it. I started with the basics, focusing on building strong foundations in programming and data structures. Over time, I delved into projects, like developing an e-commerce platform and an ed-tech solution, which allowed me to apply my learnings practically. Balancing my academics with internships at companies like Spyne and AlgoTutor, I gained real-world exposure to full-stack development, API integration, and scalable systems. Mentoring and teaching during my stint at Internshala further honed my skills and reinforced my understanding. While preparing for interviews, I dedicated myself to solving complex DSA problems, optimizing code, and refining my projects to showcase in interviews. The process wasn’t easy, but consistency and a growth mindset kept me going. Each step contributed to where I am today, and I believe persistence is the key to achieving any goal.
Application story
I worked as a Teaching Assistant at Coding Ninjas during my first year of college. When I noticed an SDE-1 opening on LinkedIn, I reached out to people in the company and started cold-emailing the HR and CEO. Eventually, I received a callback from the HR team, who explained the process and scheduled the interviews.
Why selected/rejected for the role?
I was rejected because I couldn't effectively explain my approach to the LLD problem. This experience taught me the importance of clear communication and structuring my thoughts when explaining solutions. It motivated me to practice mock interviews and improve my ability to articulate my problem-solving process.
Preparation
Duration: 3 Months
Topics: Data Structures, Algorithms, OOPS, System Design, DBMS, SQL, Low-Level Design, Dynamic Programming, Recursion, Problem Solving
Tip
Tip

Tip 1: Solve standard DSA problems.

Tip 2: Include at least two good projects in your resume.

Tip 3: Study the fundamentals of computer networks.

Application process
Where: Linkedin
Eligibility: NA (Salary: 12LPA)
Resume Tip
Resume tip

Tip 1: Coding profile links.
Tip 2: Projects in the resume.

Interview rounds

01
Round
Easy
Video Call
Duration60 Minutes
Interview date6 Sep 2024
Coding problem2

This round primarily focused on the basics of JavaScript and standard DSA problems. The interviewer was humble and attentive, carefully listening to my explanations. The interview was held in the evening, from 5 to 6 PM.

1. Container With Most Water

Moderate
15m average time
90% success
0/80
Asked in companies
FlipkartAmazonSAP Labs

Given a sequence of ‘N’ space-separated non-negative integers A[1],A[2],A[3],......A[i]…...A[n]. Where each number of the sequence represents the height of the line drawn at point 'i'. Hence on the cartesian plane, each line is drawn from coordinate ('i',0) to coordinate ('i', 'A[i]'), here ‘i’ ranges from 1 to ‘N’. Find two lines, which, together with the x-axis forms a container, such that the container contains the most area of water.

Note :
1. You can not slant the container i.e. the height of the water is equal to the minimum height of the two lines which define the container.

2. Do not print anything, you just need to return the area of the container with maximum water.
Example

water-diagram

For the above Diagram, the first red marked line is formed between coordinates (2,0) and (2,10), and the second red-marked line is formed between coordinates (5,0) and (5,9). The area of water contained between these two lines is (height* width) = (5-2)* 9 = 27, which is the maximum area contained between any two lines present on the plane. So in this case, we will return 3* 9=27.
Problem approach

Approach to Solve "Container With Most Water"

Two Pointer Technique:
Use two pointers, one starting at the beginning of the array and the other at the end. This technique explores all possible container widths while minimizing redundant calculations.

Calculate Area:
At each step, calculate the area formed by the vertical lines at the two pointers. The area is determined by the formula:

Area= (distance between pointers) ×min⁡(height[left], height[right])

Move the Smaller Pointer:
To maximize water storage, move the pointer pointing to the shorter vertical line inward. This is because the height of the container is limited by the shorter line, and moving it inward might lead to a taller container.

Repeat Until Pointers Meet:
Continue the process until the two pointers converge. Keep track of the maximum area encountered during this process.

This approach ensures an efficient solution with a time complexity of O(n), as each line is processed at most once.

Try solving now

2. Trapping Rain Water

Moderate
15m average time
80% success
0/80
Asked in companies
Paytm (One97 Communications Limited)MyntraPaytm (One97 Communications Limited)

You have been given a long type array/list 'arr’ of size 'n’.


It represents an elevation map wherein 'arr[i]’ denotes the elevation of the 'ith' bar.



Note :
The width of each bar is the same and is equal to 1.
Example:
Input: ‘n’ = 6, ‘arr’ = [3, 0, 0, 2, 0, 4].

Output: 10

Explanation: Refer to the image for better comprehension:

Alt Text

Note :
You don't need to print anything. It has already been taken care of. Just implement the given function.
Problem approach

The approach is mainly based on the following facts:

  • If we consider a subarray arr[left…right], we can determine the amount of water for either arr[left] or arr[right], provided we know the left max (the maximum element in arr[0…left-1]) and the right max (the maximum element in arr[right+1…n-1]).
  • If the left max is less than the right max, we can calculate the water for arr[left]. Otherwise, we can calculate it for arr[right].
  • If we calculate for arr[left], the amount of water would be left max – arr[left].
Try solving now
02
Round
Hard
Video Call
Duration60 Minutes
Interview date9 Sep 2024
Coding problem1

This round was conducted with the CTO of the company and was quite challenging. I was asked to design the schema for a TA request system, including the complete flow and requirements. The expectations for this round were extremely high, as it was the final interview.

1. System Design

Design a schema for a TA request system, including the full flow and requirements.

Problem approach

Tip 1: Practice schema design for some case studies.
Tip 2: Discuss the requirements in detail initially before providing a solution.
Tip 3: Discuss everything possible; don’t readily change the schema if any requirements change.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Which keyword is used for inheritance?

Choose another skill to practice
Similar interview experiences
company logo
Teaching Assistant
1 rounds | 1 problems
Interviewed by Coding Ninjas
678 views
0 comments
0 upvotes
company logo
Teaching Assistant
1 rounds | 2 problems
Interviewed by Coding Ninjas
747 views
0 comments
0 upvotes
company logo
Teaching Assistant
1 rounds | 2 problems
Interviewed by Coding Ninjas
908 views
0 comments
0 upvotes
company logo
Problem Setter Intern
3 rounds | 4 problems
Interviewed by Coding Ninjas
564 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
111048 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
54789 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
33527 views
6 comments
0 upvotes