People Tech Group Software Developer Intern Interview Questions and Answers

3 coding questions, very basic

Q1. Again DSA and DBMS questions, easy to medium easy
Add your answer

Q1. There are three technical rounds one round will be tough
Add your answer

Q1. They didn't ask me anything
Add your answer
Q2. Will give U false promises and showoff about the company
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

Timing of test start from 11 AM and everything goes well here .

Q1. OS Question
What is segmentation
Add your answer
Q2. DBMS Question
How many level of Normalization are there ?
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It happen nicely and no problem occur.

Q1. Trapping Rain Water
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. Pri...read more
Ans. Brute Force Approach
The idea here is to travel over every elevation on the map and calculate the units of water the elevation can store.
 
Here is the algorithm :
 
1. Iterate over every elevation or element and find the maximum elevation on to the left and right of it. Say, the maximum elevation on to the left of the current elevation or element that we are looking at is ‘maxLeftHeight’ and the maximum elevation on...read more
Answered by CodingNinjas
View 2 more answers
Q2. Sort 0 1 2
You have been given an integer array/list(ARR) of size 'N'. It only contains 0s, 1s and 2s. Write a solution to sort this array/list.
Note :
Try to solve the problem in 'Single Sca...read more
Ans. Sorting
Use any good sorting algorithm like Merge Sort, Quick Sort or inbuilt sorting function of different languages.
• Sort the Array and just return.
Space Complexity: O(1)Explanation:
O(1), As we are using constant space.
Time Complexity: O(nlogn)Explanation:
O(N*log(N)), where ‘N’ is the size of the array.
We are using inbuilt sort algorithm which has Overall Time Complexity O(N*log(N))
Answered by CodingNinjas
View 2 more answers

Round duration - 90 mintues
Round difficulty - Hard

Environment is very bad the intervier video call is lagging.

Q1. Compiler Design Question
. List The Sub Parts Or Phases Of Analysis Part
Add your answer
Q2. Left Rotations of An Array
You are given an array consisting of 'N' elements and you need to perform 'Q' queries on the given array. Each query consists of an integer which tells the number...read more
Ans. Rotate One Element At A Time
The idea is to create a function which would rotate the array one element at a time. This can be done by shifting the array towards left by one element and copying the first element to the end of the array. For every query repeatedly call the above function, until the desired rotation is obtained.
 
If the number of rotations required, say ‘K’, is greater than the number of elements, ‘N’,...read more
Answered by CodingNinjas
View 3 more answers

Round duration - 90 minutes
Round difficulty - Hard

Timing was 10 AM. Platform was very lagging. So overall it was not a good experience.

Q1. Topological Sort
You are given a directed acyclic graph. Your task is to find any topological sorting of the graph.
A directed acyclic graph is a directed graph with no directed cycles.
Topological sor...read more
Ans. DFS traversal of DAG
In topological sort a vertex u must come before vertex v if there is a directed edge between u and v. We can modify DFS traversal of a graph to achieve this.
 
The algorithm will be-
• We can declare a stack ‘topSort’ which will store the nodes after the topological sort.
• We also maintain an array/list ‘visited’ of size N, denoting which node is visited in a dfs traversal. Initially, all elements of ...read more
Answered by CodingNinjas
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

This round contains only 1 coding question which you have to solve in the language selected by you at the time of registration.
(Note: One can have to attempt the question in C language is he/she had selected C++ language at the time of registration).

Q1. Topological Sort
A Directed Acyclic Graph (DAG) is a directed graph that contains no cycles.
Topological Sorting of DAG is a linear ordering of vertices such that for every directed edge from vertex ‘u’...read more
Ans. Modify Depth First Search
In the Depth First Search (DFS), we start from a vertex, we first print it and then recursively call DFS for its adjacent vertices. In topological sorting, we use a  stack. We don’t print the vertex immediately, we first recursively call topological sorting for all its adjacent vertices, then push it to a stack. Finally, print contents of the stack. Note that a vertex is pushed to stack on...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 60 Minutes
Round difficulty - Easy

This is a technical interview which was held on google meet. The interviewer helps me to be comfortable. He first asked me some basic questions on OOPS concepts like function overloading and overriding. Then he asked me to explain any of my project and also put some question around it. After that he asked me one DSA question and share a google docs on which I have to code it. Then we dry run the code and he was satisfied with the solution.

Q1. Distinct Occurences
You are given two strings 'A' and 'B' of length 'N' and 'M' respectively, your task is to find the number of distinct occurrences of string 'B' i...read more
Ans. Brute Force Solution
We will start by generating all the possible subsequences of String ‘A’ using recursion. For every character there are two choices either to include it in the subsequence or not. Apply this for every character from start until we reach the end of the string. Push the subsequence into a data structure like a vector once the end of string is reached.
 
We will store all these subsequences in a data...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 60 Minutes
Round difficulty - Easy

This round is also a Technical Interview round. The main focus of interviewer was on OOPS concepts. Around 30mins he came up with OOPS questions only like abstract class, inheritance, interfaces, exception handling and alot of other topics. Then he asked some DBMS concepts like normalization and some SQL queries for which I gave him satisfactory answer. He also asked questions around Data structures like what are queues, stack, hashmap etc. In the end he asked one DSA question around Linked List.

Q1. Intersection of Linked List
You are given two Singly Linked List of integers, which are merging at some node of a third linked list.
Your task is to find the data of the node at which merging starts. If ...read more
Ans. Brute Force
• For each node in the first list, traverse the entire second list
• Check if any node in the second list coincides with the first list
  • If it does, return that node’s data
  • If it doesn’t, return -1
Space Complexity: O(1)Explanation:
O(1)
 
Since we only use constant space.
Time Complexity: O(m*n) - For 2d arraysExplanation:
O(N * M), where N and M are the lengths of the first and second linked lists respectively.&n...read more
Answered by CodingNinjas
View 2 more answers