Platform Commons interview experience Real time questions & tips from candidates to crack your interview

Angular developer

Platform Commons
upvote
share-icon
3 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Journey
I focused on building a strong foundation in data structures, algorithms, and system design through consistent practice on platforms like LeetCode. In parallel, I worked on real-world projects that involved developing scalable applications, integrating APIs, and managing databases, which not only strengthened my problem-solving skills but also gave me hands-on experience in full-stack development.
Preparation
Topics: JavaScript, Node.js, Express.js, React.js, MySQL, REST APIs
Application process
Where: Coding Ninjas Placement Cell
Eligibility: NA, (Salary package: 5.5 LPA)

Interview rounds

01
Round
Easy
Online Coding Interview
Duration
Interview date13 May 2025
Coding problem1

1. Move Zeroes

Given an integer array nums, write an algorithm to move all 0s to the end of the array while maintaining the relative order of the non-zero elements. The operation should be performed in-place without making a copy of the array.

Problem approach

I applied a two-pointer technique: one pointer was used to iterate through the array, while the other tracked the position to place the next non-zero element. This allowed me to shift all non-zero elements to the front while preserving their order. After that, I filled the remaining positions in the array with zeroes.

02
Round
Medium
Online Coding Interview
Duration
Interview date20 May 2025
Coding problem1

1. Move Zeroes to the End of Array While Maintaining Order

Given an integer array nums, the task is to move all zeroes to the end of the array while keeping the relative order of the non-zero elements unchanged.

Problem approach

I implemented a two-pointer approach where all non-zero elements were shifted to the front while preserving their relative order. After that, the remaining positions in the array were filled with zeroes.

03
Round
Medium
Online Coding Interview
Duration
Interview date21 May 2025
Coding problem1

1. Move Zeroes to the End

Given an integer array nums, rearrange it so that all zeroes are moved to the end while preserving the relative order of the non-zero elements.

Problem approach

I solved this problem using the two-pointer technique. One pointer was used to track the position for placing non-zero elements, while the other iterated through the array. All non-zero elements were shifted to the front while maintaining their relative order, and once done, the remaining positions in the array were filled with zeroes.

Here's your problem of the day

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

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
8518 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
3320 views
0 comments
0 upvotes
company logo
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
2580 views
0 comments
0 upvotes
Software Engineer
1 rounds | 1 problems
Interviewed by Platform Commons
123 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Angular developer
2 rounds | 7 problems
Interviewed by HCL Technologies
1790 views
0 comments
0 upvotes