Persistent Systems SDE Interview Questions and Answers

Present a solution for a machine learning problem and create a PowerPoint presentation.

Q1. DSA ARRAY QUESTIONS EASY TO MEDIUM LEVEL
Add your answer

Q1. 3 EMERGING TECHNOLOGIES
Add your answer

Round duration - 180 minutes
Round difficulty - Medium

It was a long round of around 3 hours divided into 2 parts 
1. Aptitude(MCQ)
2. Coding(Subjective)

Q1. Maximum meetings
You are given the schedule of N meetings with their start time Start[i] and end time End[i]. But you have only 1 meeting room. So, you need to tell the meeting numbers you can organize in...read more
Ans. 
1. Sort all pairs(Meetings) in increasing order of the second number(Finish time) of each pair.
2. Select the first meeting of the sorted pair as the first Meeting in the room and push it into the result vector and set a variable time_limit(say) with the second value(Finishing time) of the first selected meeting.
3. Iterate from the second pair to the last pair of the array and if the value of the first element(Starting ...read more
Answered by CodingNinjas
View 1 more amswer
Q2. Partition to K equal sum subsets
You are given an array of 'N' integers, and a positive integer 'K'. You need to determine if it is possible to divide the array into 'K' non-empty s...read more
Ans. 
1. If K is 1, then we already have our answer, the complete array is only a subset with the same sum. 
2. If N < K, then it is not possible to divide the array into subsets with an equal sum because we can’t divide the array into more than N parts. 
3. If the sum of the array is not divisible by K, then it is not possible to divide the array. We will proceed only if k divides the sum. Our goal reduces to div...read more
Answered by CodingNinjas
View 2 more amswers
Q3. Merge k sorted lists
Given 'K' sorted linked lists, each list is sorted in increasing order. You need to merge all these lists into one single sorted list. You need to return the head of the final ...read more
Ans. 
A Simple Solution is to initialize the result as the first list. Now traverse all lists starting from the second list. Insert every node of the currently traversed list into the result in a sorted way.
Answered by CodingNinjas
View 3 more amswers
Q4. Sort A “K” Sorted Doubly Linked List
You’re given a doubly-linked list with N nodes, where each node deviates at max K position from its position in the sorted list. Your task is to sort this given doubly...read more
Ans. 
Sort the given doubly linked list using the insertion sort technique. While inserting each element in the sorted part of the list, there will be at most k swaps to place the element to its correct position since it is at most k steps away from its correct position.
Answered by CodingNinjas
View 2 more amswers
Q5. Duplicate Subtrees
You have been given a binary tree, you are supposed to return the root values of all the duplicate subtrees. For each duplicate subtree, you only need to return the root value of any one...read more
Ans. 
The idea is to use hashing. We store in order traversals of subtrees in a hash. Since simple inorder traversal cannot uniquely identify a tree, we use symbols like ‘(‘ and ‘)’ to represent NULL nodes.
Answered by CodingNinjas
View 1 more amswer

Round duration - 25 minutes
Round difficulty - Medium

The technical Interview round was not at all difficult. The main focus of the interviewer was my projects and development fields.
He also asked some DS/Algo questions that were at a medium level, and some easy questions for database management.

Q1. DBMS Question
Explains the concept of keys.
Add your answer
Q2. Puzzle Question
How do we measure forty-five minutes using two identical wires, each of which takes an hour to burn? We have matchsticks with us. The wires burn non-uniformly. So, for example, the two halve...read more
Ans. 
Tip 1 : 0 minutes – Lightstick 1 on both sides and stick 2 on one side.
Tip 2 : 30 minutes – Stick 1 will be burnt out. Light the other end of stick 2.
Tip 3 : 45 minutes – Stick 2 will be burnt out. Thus 45 minutes is completely measured.
Answered by CodingNinjas
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

It took place on the same day as the technical round. It was quite the easiest round of all. The interviewer just asked me to introduce myself, projects I have worked on, my Internships experience, and were they internships paid.

Q1. Basic HR Question
Tell me about yourself.
Ans. 
Tip 1 : Be active while introducing yourself.
Tip 2 : in online mode always try to be in the video mode as your expression says a lot
Answered by CodingNinjas
Add your answer
Q2. Basic HR Question
Tell me about different projects that you have worked on.
Ans. 
Tip 1 : Keep a handful of knowledge of your projects anything can be asked from that
Answered by CodingNinjas
Add your answer
Q3. Basic HR Question
What are your internships experiences and were they internships paid?

 
Ans. 
Tip 1 : Good Internship Experience matters a lot
Answered by CodingNinjas
Add your answer

It makes more interesting for solving

Q1. What is your family background?
Add your answer
Q2. Why should we hire you?
Add your answer
Q3. What are your strengths and weaknesses?
Add your answer
Q4. Tell me about yourself.
Add your answer
Q5. Interesting project to do
Ans. 
Developing a chatbot for customer service
• Researching and selecting a suitable chatbot platform

• Designing the conversation flow and user interface

• Integrating the chatbot with existing customer service systems

• Testing and refining the chatbot's performance

• Training customer service representatives to handle complex queries

• Monitoring and analyzing chatbot usage data for continuous improvement
Answered by AI
Add your answer