Parth Universal Software Developer Intern Interview Questions and Answers

Round duration - 60 Minutes
Round difficulty - Easy

The platform was HackerEarth time duration was 1 hour.
2 Coding questions were asked, 30 minutes for each were allotted.

Q1. 
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...read more
Ans. Brute Force
In the brute force approach, we will use two nested loops. The outer loop is used to select the starting index of the substring and the inner loop is used to fix the ending index of the substring. After selecting the substring, we will use another loop (or a method) to check whether the substring contains all unique characters or not using a HashSet.
Space Complexity: O(n)Explanation:
O(L), where L is the len...read more
Answered Anonymously
View 1 more answer
Q2. 
Triplets with Given Sum Problem
Given an array or list ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a specified number K.
Explanation:
A t...read more
Ans. Brute Force
• The most trivial approach would be to find all triplets of the array and count all such triplets whose ‘SUM’ = 'K'.
• We can find the answer using three nested loops for three different indexes and check if the values at those indexes sum up to 'K'.
• Create a set  to keep the track of triplets we have visited. Run first loop from i = 0 to i = ‘N’ - 3, second loop from j = i + 1 to j = ‘N’ - 2 and third loop ...read more
Answered Anonymously
Add your answer

Round duration - 120 Minutes
Round difficulty - Hard

This was a 2 hours round, with the following problem statement. At the end of the allotted time you had give a demo and explain your implementation.

Round duration - 45 Minutes
Round difficulty - Medium

The platform was Zoom, time duration was 45 mins. Started with Tell me something about yourself. I told them, that I like solving algorithms and real life problems.

Round duration - 20 Minutes
Round difficulty - Easy

Interviewer was very friendly. Asked few questions about myself and then asked questions about what I know about the company.

Round duration - 120 Minutes
Round difficulty - Medium

Q1. 
Inorder Traversal of Binary Tree
You are provided with a Binary Tree composed of 'N' nodes, each holding integer values. Your task is to compute the Inorder traversal of this binary tree.
Example:
For t...read more
Ans. 
The task is to find the in-order traversal of a given binary tree.
• Implement a recursive function to perform in-order traversal of the binary tree

• Start from the left subtree, then visit the root node, and finally visit the right subtree

• Use an array to store the values of the nodes in the in-order traversal
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

Interview on google meet

Q1. Given two tables, how would you return an inner join on a common column (key)?
Ans. 
The inner join operation combines rows from two tables based on a common column (key).
• Use the JOIN keyword in the SQL query to perform an inner join.

• Specify the common column (key) in the ON clause of the join.

• The result will contain only the matching rows from both tables.
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

Q1. 
Search in a Row-wise and Column-wise Sorted Matrix Problem Statement
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...read more
Ans. 
Given a sorted matrix, find the position of a target integer in the matrix.
• Iterate through each row and column of the matrix

• Compare the target integer with the current element

• If the target integer is found, return the position

• If the target integer is not found, return {-1, -1}
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

The platform was HackerEarth time duration was 1 hour.
2 Coding questions were asked, 30 minutes for each were allotted.

Q1. 
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...read more
Ans. 
The problem asks to find the length of the longest substring without repeating characters in a given string.
• Use a sliding window approach to iterate through the string and keep track of the characters seen so far.

• Maintain a set to check for duplicate characters within the current substring.

• Update the maximum length of the substring whenever a duplicate character is encountered.

• Continue the process until the end of the ...read more
Answered by AI
Add your answer
Q2. 
Find All Triplets with Zero Sum
Given an array Arr consisting of N integers, find all distinct triplets in the array that sum up to zero.
Explanation:
An array is said to have a triplet {Arr[i], Arr[j],...read more
Ans. 
The task is to find all distinct triplets in an array that add up to zero.
• Iterate through the array and fix the first element of the triplet.

• Use two pointers approach to find the other two elements that sum up to the negative of the fixed element.

• Skip duplicate elements to avoid duplicate triplets.

• Return the list of triplets found.
Answered by AI
Add your answer

Round duration - 120 Minutes
Round difficulty - Hard

This was a 2 hours round, with the following problem statement. At the end of the allotted time you had give a demo and explain your implementation.

Round duration - 45 Minutes
Round difficulty - Medium

The platform was Zoom, time duration was 45 mins. Started with Tell me something about yourself. I told them, that I like solving algorithms and real life problems.

Round duration - 90 minutes
Round difficulty - Medium

3 DSA questions, 2 SQL questions
On the DoSelect platform, which was good

Q1. 
Matrix Chain Multiplication Problem
Given 'N' 2-dimensional matrices and an array ARR of length N + 1, where the first N integers denote the number of rows in each matrix and the last integer represents t...read more
Ans. 
It was a straightforward application of the matrix multiplication approach of DP
Answered Anonymously
Add your answer
Q2. 
Linear Probing in Hashing
Hashing is a technique to map large non-negative integers to smaller indices using a hash function. In the context of collision resolution in hash tables, 'Linear Probing' is emp...read more
Ans. Linear Probing
The approach is pretty simple. We just need to find the mapping index and if it is occupied, we need to search for the next available index.
 
The algorithm for the same is as follows:
• Create an array HASH_TABLE of size N.
• Initialise every value of HASH_TABLE as -1.
• Loop for each KEY:
  • Initialize HASH = KEY % N
  • If HASH_TABLE[ HASH ] is already occupied, we perform:
    • while(HASH_TABLE[ HASH ] != -1):
      • HASH = ( HAS...read more
Answered Anonymously
View 1 more answer

Round duration - 60 minutes
Round difficulty - Easy

Started off with introductions and projects related questions.
Basic javascript and CSS property-related questions.
An easy DSA question

Q1. 
Pair Sum Problem Statement
You are given an array of integers 'ARR' with a length 'N' and a specific integer 'Target'. Your objective is to determine and return all pairs of elements within the array whos...read more
Ans. Hashing Solution
• We can store the frequency of every element in the array in a hashmap.
• We will loop over every index i, and check the frequency of (Target - ARR[i]) is the hashmap:
  • If (Target - ARR[i]) is equal to ARR[i], we will check if frequency of ARR[i] . If it is greater than 1 then we will decrease the frequency of ARR[i] by 2 and add a pair (ARR[i] , ARR[i]) to our answer.
  • Else, if the frequency of ARR[i] and Targ...read more
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

Introduction and two easy to medium DSA questions

Q1. 
Implementing Queue with Two Stacks
Your task is to implement a queue using two stacks. You are provided with ‘Q’ queries and need to handle them, where each query falls under one of these two operations:
...read more
Ans. Making the Enqueue operation costly
In this approach, we make sure that the oldest element added to the queue stays at the top of the stack, the second oldest below it and so on. To achieve this, we will need two stacks. 
 
First stack('STK1') is the main stack being used to store the data, while the second stack('STK2') is to assist and store data temporarily during various operations.
 
Following steps will...read more
Answered Anonymously
Add your answer
Q2. 
Roman Numeral to Integer Conversion
Convert a string representing a Roman numeral into its integer equivalent and return the result.
Explanation:
Roman numerals are represented by seven different symbol...read more
Ans. Recursive Approach
The key idea is to follow the rules of roman numbers which are as follows:
 
• The roman digits I, X and C are repeated up to three times in succession to form the numbers.
• When a digit of lower value is written to the right or after a digit of higher value, the values of all the digits are added.
• When a digit of lower value is written to the left or before a digit of higher value, then the value of th...read more
Answered Anonymously
Add your answer