Upload Button Icon Add office photos

Filter interviews by

Simplify Workforce Technologies Fullstack Developer Intern Interview Questions and Answers

Updated 21 Jul 2023

Simplify Workforce Technologies Fullstack Developer Intern Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via campus placement at ABES Institute of Technology, Ghaziabad and was interviewed in Jun 2023. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

It's just check your mind concentration.

Round 3 - Coding Test 

Arrays question will be asked

Round 4 - Technical 

(4 Questions)

  • Q1. About projects which are mentioned in resume
  • Q2. Some questions related to react like hookstate and props
  • Q3. Dsa questions i.e. find the pair of array which sum is equal to 6
  • Q4. MySQL questions creating database and some queries about this

Interview Preparation Tips

Interview preparation tips for other job seekers - Be prepared according to your resume.

Interview questions from similar companies

I was interviewed in Sep 2021.

Round 1 - Video Call 

(2 Questions)

Round duration - 45 Minutes
Round difficulty - Medium

Very fixed deadline of interview of 45 min
Interviewer was friendly.
What is the difference between tag and tag?
Difference between “==” and “===” operators in js.
Explain Hoisting in javascript.

  • Q1. Shortest path in an unweighted graph

    The city of Ninjaland is analogous to the unweighted graph. The city has ‘N’ houses numbered from 1 to ‘N’ respectively and are connected by M bidirectional roads. If a...

  • Ans. BFS
    • Store all the edges in the form of an adjacency list ADJ. if ADJ[X][j] = Y which means there is an edge from X to Y.
    • Declare a queue Q and push S in it and also declare two vectors VISITED and DISTANCE which will store whether a house is visited or not and what is a distance of the house from house S respectively.
    • We will also store the PARENT, that store the node from which we will reach the current node. It will hel...
  • Answered Anonymously
  • Q2. Dijkstra's shortest path

    You have been given an undirected graph of ‘V’ vertices (labeled 0,1,..., V-1) and ‘E’ edges. Each edge connecting two nodes (‘X’,’Y’) will have a weight denoting the distance betw...

  • Ans. Using Adjacency Matrix

    The idea is to maintain two arrays, one stores the visited nodes, and the other array stores the distance (element at index ‘i’ denotes the distance from node 0 to node ‘i’). We pick an unvisited minimum distance vertex, then update the distance of all its adjacent vertices considering the path from source to an adjacent vertex to pass through the picked minimum distance vertex. Repeat the process...

  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Indian Institute of Technology Madras. I applied for the job as Fullstack developer Intern in BangaloreEligibility criteriaNo CGPA CriteriaGoogle interview preparation:Topics to prepare for the interview - Data Structures(Arrays, Tree, Backtracking, DP, Graph), Operating Systems, OOPS, Basic System Design, Algorithms, Machine LearningTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Try to come to basic working solution as early as possible
Tip 2 : Try to ask more questions from interviewer, to clarify the question even if you know the answer
Tip 3 : Try to keep your answer generalised because there might be follow-up questions on the present question
Tip 4 : Use proper variable names(instead of i or j in loop use itr1 or itr2 etc).
Tip 5 : Practice more questions of these topics: Arrays, Tree, Backtracking, DP, Graph

Application resume tips for other job seekers

Tip 1 : Mention only those projects in which you are confident
Tip 2 : Try to keep your resume of at most 2 pages

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed in Sep 2021.

Round 1 - Video Call 

(2 Questions)

Round duration - 45 Minutes
Round difficulty - Medium

Very fixed deadline of interview of 45 min
Interviewer was friendly.
What is the difference between tag and tag?
Difference between “==” and “===” operators in js.
Explain Hoisting in javascript.

  • Q1. Shortest path in an unweighted graph

    The city of Ninjaland is analogous to the unweighted graph. The city has ‘N’ houses numbered from 1 to ‘N’ respectively and are connected by M bidirectional roads. If a...

  • Ans. BFS
    • Store all the edges in the form of an adjacency list ADJ. if ADJ[X][j] = Y which means there is an edge from X to Y.
    • Declare a queue Q and push S in it and also declare two vectors VISITED and DISTANCE which will store whether a house is visited or not and what is a distance of the house from house S respectively.
    • We will also store the PARENT, that store the node from which we will reach the current node. It will hel...
  • Answered Anonymously
  • Q2. Dijkstra's shortest path

    You have been given an undirected graph of ‘V’ vertices (labeled 0,1,..., V-1) and ‘E’ edges. Each edge connecting two nodes (‘X’,’Y’) will have a weight denoting the distance betw...

  • Ans. Using Adjacency Matrix

    The idea is to maintain two arrays, one stores the visited nodes, and the other array stores the distance (element at index ‘i’ denotes the distance from node 0 to node ‘i’). We pick an unvisited minimum distance vertex, then update the distance of all its adjacent vertices considering the path from source to an adjacent vertex to pass through the picked minimum distance vertex. Repeat the process...

  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Indian Institute of Technology Madras. I applied for the job as Fullstack developer Intern in BangaloreEligibility criteriaNo CGPA CriteriaGoogle interview preparation:Topics to prepare for the interview - Data Structures(Arrays, Tree, Backtracking, DP, Graph), Operating Systems, OOPS, Basic System Design, Algorithms, Machine LearningTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Try to come to basic working solution as early as possible
Tip 2 : Try to ask more questions from interviewer, to clarify the question even if you know the answer
Tip 3 : Try to keep your answer generalised because there might be follow-up questions on the present question
Tip 4 : Use proper variable names(instead of i or j in loop use itr1 or itr2 etc).
Tip 5 : Practice more questions of these topics: Arrays, Tree, Backtracking, DP, Graph

Application resume tips for other job seekers

Tip 1 : Mention only those projects in which you are confident
Tip 2 : Try to keep your resume of at most 2 pages

Final outcome of the interviewRejected

Skills evaluated in this interview

Simplify Workforce Technologies Interview FAQs

How many rounds are there in Simplify Workforce Technologies Fullstack Developer Intern interview?
Simplify Workforce Technologies interview process usually has 4 rounds. The most common rounds in the Simplify Workforce Technologies interview process are Resume Shortlist, Aptitude Test and Coding Test.
What are the top questions asked in Simplify Workforce Technologies Fullstack Developer Intern interview?

Some of the top questions asked at the Simplify Workforce Technologies Fullstack Developer Intern interview -

  1. Dsa questions i.e. find the pair of array which sum is equal t...read more
  2. Some questions related to react like hookstate and pr...read more
  3. MySQL questions creating database and some queries about t...read more

Tell us how to improve this page.

Interview Questions from Similar Companies

Google Interview Questions
4.4
 • 862 Interviews
Amdocs Interview Questions
3.8
 • 528 Interviews
Zoho Interview Questions
4.3
 • 511 Interviews
Quess Interview Questions
3.9
 • 392 Interviews
SAP Interview Questions
4.2
 • 304 Interviews
KPIT Technologies Interview Questions
3.5
 • 293 Interviews
Salesforce Interview Questions
4.1
 • 270 Interviews
View all
Senior Software Engineer
34 salaries
unlock blur

₹8 L/yr - ₹18.4 L/yr

Software Engineer
28 salaries
unlock blur

₹7 L/yr - ₹15 L/yr

Python Developer
7 salaries
unlock blur

₹4.1 L/yr - ₹12.9 L/yr

Technical Support Engineer
7 salaries
unlock blur

₹2.7 L/yr - ₹6 L/yr

Senior QA Engineer
6 salaries
unlock blur

₹6 L/yr - ₹10 L/yr

Explore more salaries
Compare Simplify Workforce Technologies with

Team Lease

3.9
Compare

Quess

3.9
Compare

PeopleStrong

3.4
Compare

Kelly Services

4.3
Compare
Did you find this page helpful?
Yes No
write
Share an Interview