Pagarbook Sde1 Interview Questions and Answers

3 questions 1 is easy and 2 medium problems

Q1. Check whether a linked list is palindrome
Ans. 
Check if a linked list is palindrome
• Traverse the linked list and push each element onto a stack

• Traverse the linked list again and compare each element with the top of the stack

• If all elements match, the linked list is a palindrome
Answered by AI
Add your answer
Q2. Diameter of a binary tree
Ans. 
The diameter of a binary tree is the longest path between any two leaf nodes.
• Calculate the height of left and right subtrees recursively

• Find the diameter of left and right subtrees

• Compare the diameter of left and right subtrees and return the maximum
Answered by AI
Add your answer

3 questions were asked. 1 easy 1 medium 1 hard

One on one coding round. Basic easy to medium coding questions were asked

Q1. Some coding questions and CS fundamentals were asked
Add your answer
Q2. Projects I had worked on in college
Add your answer

Q1. Basic HR questions were asked
Add your answer

Q1. Merge 2 Sorted linked list
Ans. 
Merge two sorted linked lists into a single sorted linked list
• Create a new linked list to store the merged result

• Iterate through both input linked lists and compare nodes to determine the order in which they should be merged

• Update the next pointers of the nodes in the new linked list accordingly
Answered by AI
Add your answer

Q1. Medium leetcode
Add your answer

Q1. Regarding experience
Add your answer

Q1. General behavioural question
Add your answer

Machine Coding of Google Calendar

Machine Coding of MP3 Player

Q1. Find Duplicates problem
Ans. 
Find duplicates in an array of strings
• Iterate through the array and store each element in a hash set

• If an element is already in the hash set, it is a duplicate

• Return a list of all duplicates found
Answered by AI
Add your answer

Q1. Why Simpl? and compensation
Ans. 
Simpl offers a collaborative and innovative work environment with competitive compensation.
• Simpl values teamwork and creativity in software development

• Competitive compensation package offered to attract top talent

• Opportunities for growth and learning through challenging projects
Answered by AI
Add your answer

If its for the SDE 1 , mostly they will start with javascript fundamentals and deep dive in the hard topics

Q1. Javascript polyfill (map, promise, etc)
Add your answer
Q2. Output based questions on javascript
Add your answer
Q3. React custom hook
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Started with projects discussion and internships and moved forward with coding problems.
It started at around 6:00 PM and lasted for 90 minutes approximately
The interviewer was very cool, he even gave me some tips on improving myself further at the end of the interview.

Q1. 
Longest Substring with At Most K Distinct Characters
Given a string S of length N and an integer K, find the length of the longest substring that contains at most K distinct characters.
Input:
The first...read more
Ans. 
Find the length of the longest substring with at most K distinct characters in a given string.
• Use a sliding window approach to keep track of the characters and their counts within the window.

• Maintain a hashmap to store the characters and their frequencies.

• Update the window size and characters count as you iterate through the string.

• Return the maximum window size encountered for each test case.
Answered by AI
Add your answer
Q2. 
Maximum Frequency Number Problem Statement
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...read more
Ans. 
Find the number with the maximum frequency in an array of integers.
• Iterate through the array and keep track of the frequency of each number using a hashmap.

• Find the number with the maximum frequency and return it.

• If multiple elements have the same maximum frequency, return the one that appears first.
Answered by AI
Add your answer
Q3. 
Ninja and Bombs Problem Statement
Ninja wants to travel from his house to his best friend's house. The locations of the houses are on a 2D coordinate plane, where Ninja's house is located at the origin (0...read more
Ans. 
Determine if Ninja can reach his friend's house with even x-coordinate without using modulus operator.
• Check if the x-coordinate is even or odd by using bitwise AND operation with 1.

• Return 1 if x-coordinate is even, else return 0.

• Handle multiple test cases by iterating through each input.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

I was asked a coding question then, a system design question and some basic operating systems and oops questions

Q1. 
Find Duplicates in an Array
Given an array ARR of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...read more
Ans. 
Find duplicates in an array of integers within a specified range.
• Iterate through the array and keep track of the count of each element using a hashmap.

• Return elements with count greater than 1 as duplicates.

• Time complexity can be optimized to O(N) using a set to store seen elements.
Answered by AI
Add your answer
Q2. Can you design a Google Search Engine?
Ans. 
Designing a Google Search Engine involves creating a web crawler, indexing system, and ranking algorithm.
• Develop a web crawler to discover and retrieve web pages.

• Implement an indexing system to store and organize the content of web pages.

• Design a ranking algorithm to determine the relevance of search results.

• Include features like autocomplete, spell check, and personalized search results.

• Optimize for speed and scalabil...read more
Answered by AI
Add your answer