Upload Button Icon Add office photos

PeopleStrong

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

PeopleStrong Full Stack Developer Interview Questions and Answers

Updated 27 Oct 2021

PeopleStrong Full Stack Developer Interview Experiences

1 interview found

I was interviewed in Aug 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Hard

The round was online. It had 3 coding questions to be solved.  Was asked about why are the javascript and jquery used? What is the difference between angular 8 and angular?

  • Q1. 

    Permutation In String Problem Statement

    Given two strings, str1 and str2, determine whether str2 contains any permutation of str1 as a substring.

    Input:

    str1 = “ab”
    str2 = “aoba”

    Output:

    True

    Example:

    ...
  • Ans. 

    Check if a string contains any permutation of another string as a substring.

    • Iterate through str2 with a sliding window of length str1, check if any permutation of str1 is present.

    • Use a hashmap to store the frequency of characters in str1 and str2 for comparison.

    • If the frequencies of characters in the sliding window match the frequencies of characters in str1, return True.

  • Answered by AI
  • Q2. 

    Minimum Time Problem Statement

    In a city with ‘N’ junctions and ‘M’ bi-directional roads, each junction is connected to other junctions with specified travel times. No road connects a junction to itself, ...

  • Ans. 

    The problem involves finding the minimum time to travel from a source junction to a destination junction in a city with specified travel times and green light periods.

    • Input consists of the number of test cases, number of junctions and roads, green light periods, road connections with travel times, and source/destination junctions.

    • Output should be the minimum time needed from source to destination, or -1 if destination ...

  • Answered by AI
  • Q3. 

    Rat in a Maze Problem Statement

    You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...

  • Ans. 

    Find all possible paths for a rat in a maze from start to finish, moving in 'U', 'D', 'L', 'R' directions.

    • Use backtracking to explore all possible paths in the maze.

    • Keep track of visited cells to avoid loops.

    • Recursively try moving in all directions and backtrack when reaching dead ends.

    • Return the valid paths in alphabetical order as an array of strings.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaNo criteriaPeopleStrong interview preparation:Topics to prepare for the interview - Arrays, string, oops, dbms, dyanamic programming, trees, graphsTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : practice coding questions
Tip 2 : Search and study previous interview questions

Application resume tips for other job seekers

Tip 1 : Mention the things according to role
Tip 2 : just write a clear one page resume

Final outcome of the interviewRejected

Skills evaluated in this interview

Rate your
company

🤫 100% anonymous

How was your last interview experience?

Share interview

Interview questions from similar companies

I was interviewed before Dec 2020.

Round 1 - Video Call 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round. The interviewer asked me some programming based questions and some questions on database management systems.

  • Q1. 

    Sum of Maximum and Minimum Elements Problem Statement

    Given an array ARR of size N, your objective is to determine the sum of the largest and smallest elements within the array.

    Follow Up:

    Can you achie...

  • Ans. 

    Find the sum of the largest and smallest elements in an array with the least number of comparisons.

    • Iterate through the array to find the maximum and minimum elements.

    • Keep track of the maximum and minimum elements as you iterate.

    • After iterating, sum up the maximum and minimum elements.

    • To achieve the task with the least number of comparisons, compare elements in pairs.

  • Answered by AI
  • Q2. 

    Binary Tree Construction from Parent Array

    Construct a binary tree from a given array called parent where the parent-child relationship is determined by (PARENT[i], i), indicating that the parent of node ...

  • Ans. 

    Construct a binary tree from a given parent array and perform level-order traversal.

    • Iterate through the parent array to create the binary tree using a queue data structure.

    • Keep track of the parent-child relationships and construct the tree accordingly.

    • Perform level-order traversal to print the nodes in the correct order.

  • Answered by AI
  • Q3. Can a unique key be a primary key?
  • Ans. 

    Yes, a unique key can also be a primary key.

    • A primary key must be unique, but a unique key does not necessarily have to be the primary key.

    • A table can have multiple unique keys, but only one primary key.

    • Example: In a table of employees, the employee ID can be a unique key and also the primary key.

  • Answered by AI
  • Q4. Is it better to use a normalized form for database design, or is it more efficient to store data in a single table or two tables?
  • Ans. 

    Normalized form is better for database design for data integrity and flexibility.

    • Normalized form reduces data redundancy and improves data integrity.

    • Normalized form allows for easier data updates and maintenance.

    • Denormalized form may be more efficient for read-heavy applications with complex queries.

    • Consider denormalization for performance optimization after thorough analysis.

    • Example: Normalized form for a customer and...

  • Answered by AI
Round 2 - Video Call 

Round duration - 60 minutes
Round difficulty - Medium

The interviewer had good work experience. She was polite and calm. After brief introduction she straight jumped into my current projects and she covered my entire CV.

Round 3 - Video Call 

(4 Questions)

Round duration - 45 minutes
Round difficulty - Easy

This was a technical round involving questions on OOPS concepts and puzzles.

  • Q1. What is the total number of squares on a chessboard?
  • Ans. 

    There are 204 squares on a chessboard.

    • The chessboard has 64 squares in total.

    • Each square can be divided into smaller squares, such as 1x1, 2x2, 3x3, etc.

    • The total number of squares can be calculated by adding the squares of all sizes together.

  • Answered by AI
  • Q2. What is C++?
  • Ans. 

    C++ is a high-level programming language known for its efficiency, flexibility, and performance.

    • C++ is an object-oriented language with features like classes, inheritance, and polymorphism.

    • It allows low-level memory manipulation through pointers.

    • C++ is used in developing system software, game engines, and high-performance applications.

  • Answered by AI
  • Q3. What is the difference between deep copy and shallow copy?
  • Ans. 

    Deep copy creates a new copy of an object with all nested objects also copied, while shallow copy creates a new copy of an object with references to nested objects.

    • Deep copy creates a new object and recursively copies all nested objects, resulting in a completely independent copy.

    • Shallow copy creates a new object but only copies references to nested objects, so changes in nested objects will reflect in both the origina...

  • Answered by AI
  • Q4. What are template classes? Can you write a program for the assignment operator '=' for a template class such that it behaves differently for 'int' and 'char *'?
  • Ans. 

    Template classes are classes that can work with any data type. Assignment operator can be overloaded to behave differently for different data types.

    • Template classes allow for writing generic classes that can work with any data type.

    • Overloading the assignment operator allows for custom behavior based on the data type.

    • Example: template <class T> class MyClass { T data; public: MyClass& operator=(const T& ot...

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

This was a 30 minute HR round. The interviewer asked me a number of questions to know more about me.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPASAP Labs interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Naukri.com and was interviewed before Sep 2020. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Filters in MVC, Interface and abstraction, Views in sql, Some scenerion

Interview Preparation Tips

Interview preparation tips for other job seekers - Just be confident and explain your though in any language. All were telephonic.
Interview experience
5
Excellent
Difficulty level
Hard
Process Duration
6-8 weeks
Result
Selected Selected

I applied via Job Fair and was interviewed before Mar 2022. There were 11 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 Resume tips
Round 2 - Aptitude Test 

Screening of profile based on prior experience

Round 3 - Coding Test 

Develop the process for cyberdefense

Round 4 - Group Discussion 

Group discussion with Manager and VP

Round 5 - Case Study 

Explain the profile and develop the cases that you have proposed for clearing this interview

Round 6 - Assignment 

Discussion on assignments that has been solved till now

Round 7 - HR 

(1 Question)

  • Q1. Discussion on salary and family background
Round 8 - One-on-one 

(4 Questions)

  • Q1. Managerial round to know how a canal did are handles or manages team
  • Q2. Discussion about your next steps to grow in IT carrier
  • Q3. Discussion about how do you grow your carrier in building this society
  • Q4. How much salary do you expect from this company
Round 9 - Technical 

(1 Question)

  • Q1. Technical knowledge on the profile that was assigned by HR
Round 10 - Technical 

(1 Question)

  • Q1. Technical HR to handle the candidate knowledge and provide necessary growth to candidate based on the profile on knowledge the candidate carries
Round 11 - One-on-one 

(1 Question)

  • Q1. Salary and Final discussion with HR and Manager.

Interview Preparation Tips

Interview preparation tips for other job seekers - SAP is good company . Please never leave this company before knowing your profile and work that you are assigned to.

I was interviewed before Dec 2020.

Round 1 - Video Call 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a 60 minute technical round involving questions based on data structures, OOPS concepts, DBMS and projects that I had mentioned in my resume.

  • Q1. 

    Nth Fibonacci Number Problem Statement

    Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.

    Input:

    ...
  • Ans. 

    Calculate the Nth Fibonacci number efficiently using recursion or dynamic programming.

    • Implement a recursive function to calculate the Nth Fibonacci number.

    • Use memoization to store previously calculated Fibonacci numbers for efficiency.

    • Consider using dynamic programming to optimize the solution.

    • Handle edge cases such as N = 1 or N = 2 separately.

    • Ensure the solution works efficiently for large values of N (up to 10000).

  • Answered by AI
  • Q2. Can you provide a program demonstrating operator overloading in OOP?
  • Ans. 

    Operator overloading in OOP allows custom behavior for operators like +, -, *, etc.

    • Operator overloading is a feature in OOP that allows defining custom behavior for operators

    • Example: Overloading the + operator to concatenate strings or add two numbers

    • Example: Overloading the * operator to perform matrix multiplication

  • Answered by AI
  • Q3. What is function overloading?
  • Ans. 

    Function overloading is when multiple functions have the same name but different parameters or return types.

    • Allows multiple functions with the same name but different parameters or return types

    • Helps improve code readability and maintainability

    • Example: int add(int a, int b) and float add(float a, float b)

  • Answered by AI
  • Q4. What are the differences between C and C++?
  • Ans. 

    C is a procedural programming language while C++ is a multi-paradigm programming language with object-oriented features.

    • C is a procedural programming language while C++ supports both procedural and object-oriented programming.

    • C does not support classes and objects while C++ does.

    • C does not have built-in support for exception handling while C++ does.

    • C does not have namespaces while C++ does.

    • C does not have function over

  • Answered by AI
Round 2 - HR 

(1 Question)

Round duration - 45 minutes
Round difficulty - Easy

HR round that lasted for 45 minutes. Did brainstorming on puzzles and HR asked questions to know more about me.
Tips : During HR, think before you speak, they can catch any word that you speak. Prepare well for aptitude, as they shortlist less people after the test. Ask good questions during the end of the interviews. It might impress them. So prepare for it before going for the interview. Lastly, don’t be nervous, HRs are only trying to make you nervous during the interview as a part of the stress test.

  • Q1. How can you measure 45 minutes using two identical wires?

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPASAP Labs interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Dec 2020.

Round 1 - Video Call 

(5 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a 60 minute technical round where the interviewer asked programming based questions and questions on DBMS concepts.

  • Q1. 

    Maximum of All Subarrays of Size k

    Given an array of 'N' non-negative integers and an integer 'K', your task is to find the maximum elements for each subarray of size 'K'.

    Input:

    The first line contains...
  • Ans. 

    Find the maximum elements for each subarray of size 'K' in an array of non-negative integers.

    • Iterate through the array and maintain a deque to store the indices of elements in decreasing order.

    • Pop elements from the deque if they are out of the current window of size 'K'.

    • The front of the deque will always have the index of the maximum element in the current window.

  • Answered by AI
  • Q2. Can you explain the ACID properties in the context of database management systems?
  • Ans. 

    ACID properties are a set of properties that guarantee the reliability of transactions in database management systems.

    • Atomicity ensures that either all operations in a transaction are completed successfully or none of them are. For example, transferring money from one account to another should either be completed in full or not at all.

    • Consistency ensures that the database remains in a consistent state before and after ...

  • Answered by AI
  • Q3. What is write-ahead logging in DBMS?
  • Ans. 

    Write-ahead logging is a technique used in DBMS to ensure that changes are recorded in the log before they are applied to the database.

    • Write-ahead logging ensures that changes are first written to the log file before being applied to the database to maintain data integrity.

    • It helps in recovering the database in case of a system crash or failure by replaying the log entries to bring the database back to a consistent sta...

  • Answered by AI
  • Q4. What are the deadlock avoidance schemes?
  • Ans. 

    Deadlock avoidance schemes are strategies used to prevent deadlocks in a system.

    • Banker's algorithm: Ensures that the system will never enter an unsafe state by keeping track of available resources and only granting a request if it does not lead to a deadlock.

    • Wait-die and Wound-wait: Two deadlock prevention schemes used in transaction processing systems to avoid deadlocks by allowing transactions to wait or abort based ...

  • Answered by AI
  • Q5. What is a clustered index?
  • Ans. 

    A clustered index is a type of index that sorts and stores the data rows in the table based on their key values.

    • Defines the order in which data is physically stored in a table

    • Only one clustered index per table

    • Helps in improving the performance of queries that involve range searches or sorting

    • Example: Clustered index on a table's primary key

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a 60 minute technical round where the interviewer asked data structure based questions, questions on OOPS and OS concepts.

  • Q1. What is a virtual function in C++?
  • Ans. 

    A virtual function in C++ is a function that is declared within a base class and is redefined by a derived class.

    • Virtual functions allow a function to be overridden in a derived class.

    • They are used in polymorphism to achieve runtime binding.

    • The base class function must be declared as virtual for dynamic binding to occur.

    • Example: virtual void display() = 0; // pure virtual function

  • Answered by AI
  • Q2. Can you explain the malloc() and free() operations in the context of memory management in C?
  • Ans. 

    malloc() is used to dynamically allocate memory in C, while free() is used to release allocated memory.

    • malloc() allocates a block of memory of specified size and returns a pointer to the beginning of the block.

    • free() deallocates the memory previously allocated by malloc() or calloc().

    • Example: int *ptr = (int*)malloc(5 * sizeof(int)); // Allocates memory for 5 integers

    • Example: free(ptr); // Deallocates the memory alloca

  • Answered by AI
  • Q3. What is structure padding?
  • Ans. 

    Structure padding is the concept of adding empty bytes to a structure to align its data members on memory boundaries.

    • Structure padding is done to optimize memory access and improve performance.

    • Padding is necessary because most processors require data to be aligned on specific memory boundaries for efficient access.

    • For example, if a structure contains a char followed by an int, padding may be added after the char to ali

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR based round that lasted for 30 minutes. The interviewer asked question to know more about me.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPASAP Labs interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Dec 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

Online test had 6 parts-psychometric test, aptitude, logical, English, computer skills and 2 coding questions. Time given to us was 90 minutes. Paper was quite lengthy and of average difficulty level. I was able to complete all the sections, but only one coding question.

  • Q1. 

    Reverse the String Problem Statement

    You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.

    Example:

    Input:
    STR = "abcde"
    Output:
    "e...
  • Ans. 

    Reverse a given string containing alphabets, numbers, and special characters.

    • Iterate through the string from the end to the beginning and append each character to a new string.

    • Use built-in functions like reverse() or StringBuilder in languages like Python or Java for efficient reversal.

    • Handle special characters and numbers while reversing the string.

    • Ensure to consider the constraints provided in the problem statement.

    • T...

  • Answered by AI
Round 2 - Face to Face 

(6 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Firstly the interviewer asked me to introduce myself after he introduced himself. Since i went there as experienced guy he asked me about my workings in the current company. After that,he asked some programming questions, tested my concepts of DBMS and OOPS, and some puzzles.

  • Q1. 

    BFS Traversal in a Graph

    Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...

  • Ans. 

    BFS traversal in a disconnected graph starting from vertex 0.

    • Implement BFS algorithm to traverse the graph starting from vertex 0.

    • Explore neighbor nodes first before moving to the next level neighbors.

    • Consider the bidirectional nature of edges in an undirected graph.

    • Output the BFS traversal sequence for each test case in a separate line.

  • Answered by AI
  • Q2. 

    Prime Numbers Identification

    Given a positive integer N, your task is to identify all prime numbers less than or equal to N.

    Explanation:

    A prime number is a natural number greater than 1 that has no po...

  • Ans. 

    Identify all prime numbers less than or equal to a given positive integer N.

    • Iterate from 2 to N and check if each number is prime

    • Use the Sieve of Eratosthenes algorithm for efficient prime number identification

    • Optimize by only checking up to the square root of N for divisors

  • Answered by AI
  • Q3. What is BCNF (Boyce-Codd Normal Form) in database management systems?
  • Ans. 

    BCNF is a normal form in database management systems that ensures all determinants are candidate keys.

    • BCNF stands for Boyce-Codd Normal Form.

    • It is a stricter version of 3NF (Third Normal Form).

    • In BCNF, every determinant must be a candidate key.

    • It helps in reducing redundancy and anomalies in the database.

    • Example: If a table has columns A, B, and C, and A determines B and B determines C, then it is not in BCNF unless A

  • Answered by AI
  • Q4. What is the difference between C and C++?
  • Ans. 

    C is a procedural programming language while C++ is an object-oriented programming language with features like classes and inheritance.

    • C is a procedural programming language, while C++ is a multi-paradigm language with support for object-oriented programming.

    • C does not support classes and objects, while C++ does.

    • C uses structures for data organization, while C++ uses classes.

    • C does not have features like inheritance an...

  • Answered by AI
  • Q5. How can you make 3 cuts to divide a round cake into 8 equal pieces?
  • Q6. How can you calculate 45 minutes using only 2 candles?
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Again 2nd round started with an introduction from both sides. Then he started asking questions from resume itself. Working in the current company and all the projects that i have done. Few simple puzzles, OOPs concepts (with proper explanation and coding) and some database related questions(questions were easy you just need to brush up the basics). Some keywords related questions from C,C++,Java(usual questions like static ,final, abstract etc.). That was the 2nd round. Then I was called for the 3rd Round. Before 3rd round they also served tasty lunch.

  • Q1. 

    Right View of Binary Tree

    Given a binary tree of integers, your task is to output the right view of the tree.

    The right view of a binary tree includes the nodes that are visible when the tree is observed...

  • Ans. 

    The task is to output the right view of a binary tree, which includes the nodes visible when observed from the right.

    • Traverse the tree level by level and keep track of the rightmost node at each level.

    • Use a queue for level order traversal and a map to store the rightmost nodes.

    • Print the values of the rightmost nodes stored in the map as the right view of the tree.

  • Answered by AI
  • Q2. You have 3 bulbs in one room and 3 switches in another room. The challenge is to determine which switch controls which bulb, with the constraint that you can only enter the bulb room once.
Round 4 - Face to Face 

(1 Question)

Round duration - 45 minutes
Round difficulty - Easy

After that he asked me what I knew about SAP and there products(Please do read all about SAP and there products-not all but at least some famous products like ERP). Then he asked me one puzzle.

  • Q1. You have 2 eggs and a building with 100 floors. What is the minimum number of attempts needed to find the highest floor from which an egg can be dropped without breaking?
Round 5 - Face to Face 

(1 Question)

Round duration - 45 minutes
Round difficulty - Easy

The round started with our Introduction to each other. After that interviewer asked me whether I do online shopping or not. I said yes then he asked me to design the online shopping portal using ER-Diagram . Then he asked me to create all the tables and populate it with data. Later on he asked me to normalize it. After all of this he asked me some simple puzzles and current salary and notice period. That was the 4th round.
After that I was asked to attend the final round and before 5th round they served snacks and tea to all of us.

  • Q1. Can you design an ER diagram for an online shopping portal?
  • Ans. 

    Yes, I can design an ER diagram for an online shopping portal.

    • Entities: User, Product, Order, Payment, Cart

    • Relationships: User places Order, Order contains Product, Payment for Order, User has Cart

    • Attributes: User (id, name, email), Product (id, name, price), Order (id, date), Payment (id, amount)

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPASAP Labs interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The test had a time limit. Every 10 minutes you had to do at least 4 questions. It was quite fast paced. The questions were from basic coding, aptitude and debugging.
Tips: Learn to be fast at coding. Practice a lot of aptitude questions. Have a decent knowledge of basic coding.

  • Q1. 

    Reverse Linked List Problem Statement

    Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.

    Input:

    The first line of input is an intege...
  • Ans. 

    Reverse a singly linked list by altering the links between nodes.

    • Iterate through the linked list and reverse the links between nodes

    • Use three pointers to keep track of current, previous, and next nodes

    • Update the next pointer of each node to point to the previous node

  • Answered by AI
  • Q2. 

    Longest Substring Without Repeating Characters Problem Statement

    Given a string S of length L, determine the length of the longest substring that contains no repeating characters.

    Example:

    Input:
    "abac...
  • Ans. 

    Find the length of the longest substring without repeating characters in a given string.

    • Use a sliding window approach to keep track of the longest substring without repeating characters.

    • Use a hashmap to store the index of each character as it appears in the string.

    • Update the start index of the window when a repeating character is found.

    • Calculate the maximum length of the substring as the window slides through the strin

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer started off by asking basic sorting questions. Followed by data structures and algorithms. And DBMS related questions in the end.
Tips: Have a good presence of mind. Understand the question asked properly. Be confident and keep discussing. Don't get nervous and solve the questions incorrectly. Have good grip over topics like sorting, DS, Algorithms and DBMS.

  • Q1. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other.

    • Consider edge cases like when X or Y is the root node.

    • Implement a recursive or iterative solution to find the LCA efficiently.

  • Answered by AI
  • Q2. 

    Next Permutation Problem Statement

    You are given a permutation of 'N' integers. A sequence of 'N' integers is considered a permutation if it includes all integers from 1 to 'N' exactly once. Your task is ...

  • Ans. 

    The task is to rearrange a given permutation of 'N' integers to form the lexicographically next greater permutation.

    • Iterate from right to left to find the first element that is smaller than the element to its right.

    • Swap this element with the smallest element to its right that is greater than it.

    • Reverse the elements to the right of the swapped element to get the lexicographically next greater permutation.

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

The round was based around my over all personality. They checked how would I be an asset to their company. They analyzed my core values and capabilities of working in a team.
Tips: Show that you are willing to work in a team. Be confident and polite. Express your feelings and passion towards your job and the company. Explain your college extra curricular activities well.

Interview Preparation Tips

Eligibility criteriaAbove 7 cgpaSAP Labs interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Dec 2020.

Round 1 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a technical interview round which lasted for 60 minutes. Questions based on DSA, OS and DBMS were discussed.

  • Q1. 

    Factorial of a Number Problem Statement

    You are provided with an integer 'N'. Your task is to calculate and print the factorial of 'N'. The factorial of a number 'N', denoted as N!, is the product of all ...

  • Ans. 

    Calculate and print the factorial of a given integer 'N'.

    • Iterate from 1 to N and multiply each number to calculate factorial

    • Handle edge cases like N=0 or N=1 separately

    • Use recursion to calculate factorial efficiently

  • Answered by AI
  • Q2. 

    Covid Vaccination Distribution Problem

    As the Government ramps up vaccination drives to combat the second wave of Covid-19, you are tasked with helping plan an effective vaccination schedule. Your goal is...

  • Ans. 

    Maximize the number of vaccines administered on a specific day while adhering to certain rules.

    • Given n days, maxVaccines available, and a specific dayNumber, distribute vaccines to maximize on dayNumber

    • Administer positive number of vaccines each day with a difference of 1 between consecutive days

    • Ensure sum of vaccines distributed does not exceed maxVaccines

    • Output the maximum number of vaccines administered on dayNumber

  • Answered by AI
  • Q3. What is a semaphore?
  • Ans. 

    A semaphore is a synchronization construct used to control access to a shared resource by multiple processes or threads.

    • Semaphores can have an integer value representing the number of available resources.

    • They can be used to implement mutual exclusion and synchronization between processes.

    • Examples include binary semaphores (mutexes) and counting semaphores.

    • Operations on semaphores include wait (P) and signal (V).

  • Answered by AI
  • Q4. What is the difference between RDBMS and DBMS?
  • Ans. 

    RDBMS is a type of DBMS that manages data in a structured format using tables with relationships.

    • RDBMS enforces referential integrity through foreign keys, while DBMS does not.

    • RDBMS supports ACID properties (Atomicity, Consistency, Isolation, Durability), while DBMS may not.

    • RDBMS allows for normalization of data to reduce redundancy, while DBMS does not have this feature.

    • Examples of RDBMS include MySQL, Oracle, SQL Ser...

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

A 60 minute technical round to test programming concepts. Questions on DBMS, OOPS, OS were also discussed.

  • Q1. 

    Bubble Sort Problem Statement

    Sort the given unsorted array consisting of N non-negative integers in non-decreasing order using the Bubble Sort algorithm.

    Input:

    The first line contains an integer 'T' r...
  • Ans. 

    Bubble Sort algorithm is used to sort an array of non-negative integers in non-decreasing order.

    • Iterate through the array and compare adjacent elements, swapping them if they are in the wrong order.

    • Repeat this process until the array is sorted.

    • Time complexity of Bubble Sort is O(n^2) in worst case.

    • Space complexity of Bubble Sort is O(1) as it is an in-place sorting algorithm.

  • Answered by AI
  • Q2. 

    Merge Sort Problem Statement

    You are given a sequence of numbers, ARR. Your task is to return a sorted sequence of ARR in non-descending order using the Merge Sort algorithm.

    Explanation:

    The Merge Sort...

  • Ans. 

    Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.

    • Divide the input array into two halves recursively until each array has only one element.

    • Merge the sorted halves to produce a completely sorted array.

    • Time complexity of Merge Sort is O(n log n).

    • Example: Input: [3, 1, 4, 1, 5], Output: [1, 1, 3, 4, 5]

  • Answered by AI
  • Q3. What is normalization in the context of database management systems?
  • Ans. 

    Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.

    • Normalization involves breaking down a database into smaller, more manageable tables.

    • It helps in reducing data redundancy by storing data in a structured way.

    • There are different normal forms such as 1NF, 2NF, 3NF, BCNF, etc., each with specific rules to follow.

    • Normalization ensures data integrity and reduces th...

  • Answered by AI
Round 3 - HR 

Round duration - 40 minutes
Round difficulty - Easy

This was a HR round. The interviewer asked me a number of questions about myself and gave a puzzle as well to solve.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPASAP Labs interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 100 minutes
Round difficulty - Easy

Sections in test :
1 Psychometric Test
2. Analytical Aptitude
3 Logical Reasoning
4 Two coding Questions
5.Pattern Recognition
6.Essay writing

Tips :

1. Do the coding Question first ,they are mot important ,if your code doesn't run you are disqualified.
2. Practice on leetcode. 
3. Sectional Cutoff

  • Q1. 

    Level Order Traversal Problem Statement

    Given a binary tree of integers, return the level order traversal of the binary tree.

    Input:

    The first line contains an integer 'T', representing the number of te...
  • Ans. 

    The task is to implement a function that returns the level order traversal of a binary tree given in level order.

    • Create a queue to store nodes for level order traversal

    • Start with the root node and enqueue it

    • While the queue is not empty, dequeue a node, print its value, and enqueue its children

    • Repeat until all nodes are traversed

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a technical round where the interviewer asked me questions on data structures, database management system, SQL queries, cloud computing concepts and puzzles. We also had a discussion on our projects.

  • Q1. 

    Floyd Warshall Algorithm Problem

    You are given a directed weighted graph with 'N' vertices, labeled from 1 to 'N', and 'M' edges. Each edge connects two nodes 'u' and 'v' with a weight 'w', representing t...

  • Ans. 

    The Floyd Warshall algorithm is used to find the shortest paths between all pairs of vertices in a graph, including graphs with negative edge weights.

    • The algorithm works by considering all pairs of vertices and all intermediate vertices to find the shortest path.

    • It can handle graphs with negative edge weights, but not negative weight cycles.

    • The time complexity of the algorithm is O(N^3), where N is the number of vertic...

  • Answered by AI
  • Q2. What would be the database design for an ATM system?
  • Ans. 

    The database design for an ATM system should include tables for users, accounts, transactions, and ATM machines.

    • Create a table for users with fields like user_id, name, pin, etc.

    • Create a table for accounts with fields like account_id, user_id, balance, etc.

    • Create a table for transactions with fields like transaction_id, account_id, amount, date, etc.

    • Create a table for ATM machines with fields like atm_id, location, sta

  • Answered by AI
  • Q3. What is the difference between public and private cloud?
  • Ans. 

    Public cloud is shared infrastructure available to anyone, while private cloud is dedicated infrastructure for a single organization.

    • Public cloud is accessible to multiple organizations or users, while private cloud is exclusive to a single organization.

    • Public cloud services are provided over the internet, while private cloud services can be hosted on-premises or in a dedicated data center.

    • Public cloud offers cost-effe...

  • Answered by AI
Round 3 - Face to Face 

(5 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round that lasted for 60 minutes. Questions on data structures, DBMS, OS and puzzles were discussed.

  • Q1. 

    Reverse Linked List Problem Statement

    Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.

    Input:

    The first line of input is an intege...
  • Ans. 

    Reverse a singly linked list by altering the links between nodes.

    • Iterate through the linked list and reverse the links between nodes

    • Use three pointers to keep track of current, previous, and next nodes

    • Update the links between nodes to reverse the list

    • Return the head of the reversed linked list

  • Answered by AI
  • Q2. What is the difference between a primary key and a unique key in a database management system?
  • Ans. 

    Primary key uniquely identifies each record in a table, while unique key ensures that all values in a column are distinct.

    • Primary key does not allow NULL values, while unique key allows one NULL value.

    • A table can have only one primary key, but multiple unique keys.

    • Primary key is automatically indexed, while unique key may or may not be indexed.

    • Example: In a table of students, student ID can be a primary key as it uniqu...

  • Answered by AI
  • Q3. Write a query to find the nth highest salary in a database.
  • Ans. 

    Query to find the nth highest salary in a database

    • Use the ORDER BY clause to sort salaries in descending order

    • Use the LIMIT clause to specify the nth highest salary

    • Consider handling cases where there may be ties for the nth highest salary

  • Answered by AI
  • Q4. What is the difference between AES and DES ciphers?
  • Ans. 

    AES is a more secure and efficient cipher compared to DES.

    • AES has a block size of 128 bits, while DES has a block size of 64 bits.

    • AES supports key sizes of 128, 192, or 256 bits, while DES supports only 56-bit keys.

    • AES is considered more secure and efficient than DES due to its stronger encryption algorithm and larger key sizes.

  • Answered by AI
  • Q5. You have a torch and a bridge that can only hold two people at a time. Four people need to cross the bridge at night, and they have only one torch. Each person walks at a different speed. When two people c...
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

The lady was tough and showed her intent in the PPT as well. She asked a number of questions to know more about me.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPASAP Labs interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

PeopleStrong Interview FAQs

How to prepare for PeopleStrong Full Stack Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at PeopleStrong. The most common topics and skills that interviewers at PeopleStrong expect are Full Stack, Java, Angularjs, NoSQL and Spring Boot.

Recently Viewed

PHOTOS

InsuranceDekho

3 office photos

LIST OF COMPANIES

Credit Bajaar

Overview

SALARIES

Kutumbh Care

SALARIES

Kutumbh Care

JOBS

Michael Page International

No Jobs

JOBS

Neointeraction Design

No Jobs

REVIEWS

PeopleStrong

No Reviews

SALARIES

Kutumbh Care

SALARIES

Kutumbh Care

JOBS

BestPeers Infosystem

No Jobs

Tell us how to improve this page.

Anonymously discuss salaries, work culture, and many more

Get Ambitionbox App

Interview Questions from Similar Companies

SAP Interview Questions
4.2
 • 309 Interviews
Randstad Interview Questions
3.8
 • 259 Interviews
Team Lease Interview Questions
3.9
 • 200 Interviews
Ramco Systems Interview Questions
3.9
 • 64 Interviews
Experis IT Interview Questions
3.0
 • 48 Interviews
CIEL HR Interview Questions
4.0
 • 47 Interviews
Darwinbox Interview Questions
3.9
 • 43 Interviews
View all
PeopleStrong Full Stack Developer Salary
based on 5 salaries
₹10 L/yr - ₹15 L/yr
38% more than the average Full Stack Developer Salary in India
View more details

PeopleStrong Full Stack Developer Reviews and Ratings

based on 2 reviews

5.0/5

Rating in categories

4.1

Skill development

4.1

Work-life balance

4.0

Salary

4.1

Job security

4.1

Company culture

4.1

Promotions

4.1

Work satisfaction

Explore 2 Reviews and Ratings
Senior Recruitment Associate
221 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Recruitment Associate
181 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Recruitment Specialist
126 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Payroll Specialist
94 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Principal Consultant
72 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare PeopleStrong with

Darwinbox

3.9
Compare

SAP

4.2
Compare

Ramco Systems

3.9
Compare

greytHR

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