Parth Universal Software Developer Intern Interview Questions and Answers

There was coding test

Q1. 2 technical rounds
Add your answer
Q2. Merge sort algorithm
Ans. 
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them separately, and then merges them back together in sorted order.
• Divide the input array into two halves

• Recursively sort each half

• Merge the sorted halves back together
Answered by AI
Add your answer

Q1. Leetcode Easy question
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.

Chrome and Firefox Browser automation

Log file tail last n lines where n is configurable. Followup question on how you can optimize it further incase log file size is in TBs and incase it is cluster of servers

Q1. Detailed Technical background check and discussion on past projects.
Add your answer
Q2. Messaging queue and best practices
Ans. 
Messaging queues are used to manage asynchronous communication between different components of a system.
• Use a reliable messaging queue system like RabbitMQ or Apache Kafka

• Ensure messages are properly formatted and serialized

• Implement message acknowledgement and retry mechanisms

• Monitor queue health and performance

• Consider message ordering and partitioning for scalability

• Avoid long-running tasks in message handlers
Answered by AI
Add your answer
Q3. Binary Search Tree twisted question
Add your answer
Q4. Map Reduce concept for solving dictionary keywords
Ans. 
MapReduce is a programming model for processing large data sets in parallel.
• MapReduce divides the input data into chunks and processes them in parallel.

• It consists of two phases: Map and Reduce.

• Map function takes input data and converts it into key-value pairs.

• Reduce function takes the output of Map as input and combines the values with the same key.

• It is used for solving dictionary keywords by mapping each word to a k...read more
Answered by AI
Add your answer

MCQ based Questions from topics of DSA , web development

Q1. Asked us to live code tail -f unix command
Ans. 
Implementing the 'tail -f' command to continuously monitor and display new lines added to a file.
• Use 'open' to access the file in read mode.

• Utilize 'seek' to move to the end of the file initially.

• Implement a loop to read new lines as they are added.

• Use 'time.sleep()' to pause between reads to avoid busy waiting.

• Handle file rotation by checking if the file has been recreated.
Answered by AI
Add your answer

Machine coding round

Q1. TCP/IP related questions, what happens when you search a webpage?
Add your answer
Q2. Past projects discussions
Add your answer

Q1. Behavioural questions on how would you tackle a particular scenario
Add your answer

Normal 3 leetcode medium questions

Machine coding round to design tail -f

Q1. Questions on internal working of os
Add your answer
Q2. Questions on projects
Add your answer