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

SDE - 1

PhenomPeople

3 rounds | 3 Coding problems

Samir Musa Sayyed

Fresher | Dec 2021

Selected

Interview preparation journey

Preparation

Duration: 8 months

Topics: Data Structures, Algorithms, JavaScript, NodJs, DBMS

Tip

Tip 1 : Practice Data Structures
Tip 2 : Do some awesome industry level projects
Tip 3 : Be confident during interview

Application process

Where: Coding Ninjas

Eligibility: Above 8 Cgpa, Passout after 2019

Resume tip

Tip 1 : Add projects with GitHub links in projects
Tip 2 : Add only those things which will help you during interview

Interview rounds

Round

Medium

Online Coding Interview

Duration90 minutes

Interview date23 Dec 2021

Coding problem1

Some aptitude questions are there and 2 problem solving questions

1. Balanced parentheses

Moderate

10m average time

90% success

0/80

Asked in companies

Given an integer ‘N’ representing the number of pairs of parentheses, Find all the possible combinations of balanced parentheses with the given number of pairs of parentheses.

Note :

Conditions for valid parentheses:
1. All open brackets must be closed by the closing brackets.

2. Open brackets must be closed in the correct order.

For Example :

()()()() is a valid parentheses.
)()()( is not a valid parentheses.

Problem approach

I used the approach of +1 for open braves and -1 for closed braces, any where if i found count negative during iterating through the string i would return false

If after interation count is more than 0 return false

Else return true

Try solving now

Round

Medium

Video Call

Duration50 Minutes

Interview date23 Dec 2021

Coding problem1

Interviewer discussed some dsa questions which was in a 1 st round and gave me some problems to solve

1. Longest Unique Substring

Moderate

30m average time

65% success

0/80

Asked in companies

Given a string input of length n, find the length of the longest substring without repeating characters i.e return a substring that does not have any repeating characters.

Substring is the continuous sub-part of the string formed by removing zero or more characters from both ends.

Problem approach

I used set and had two variables i and j both initially assigned zero. I added each character into the set and incremented j as index if that particular character is not present in the string ; else if present , the character is removed till the repeating character from ith index till the jth index. The final length of the set is the answer.

Try solving now

Round

Easy

Online Coding Interview

Duration20 minutes

Interview date24 Dec 2021

Coding problem1

HR asked me some managerial questions.