Imply Senior Software Engineer Interview Questions and Answers

1 hour duration. Sliding window problem. On hacker rank platform. Expected to write a working code and solve it optimally/scalable solution.

Q1. Again a coding test. LLD + hash map. 1 hour on hacker rank.
Add your answer

Q1. Time Window Map
Add your answer

It was a 1 hour Technical screening round, coding question in java (you cna choose your own language). They asked a difficult version of regex matching question (Leetcode medium-hard).

4 questions in 1 hour 30 minutes

Q1. Subset sum - in leetcode
Ans. 
Subset sum problem is a classic algorithmic problem in computer science.
• The problem asks to find if there is a subset of the given array that sums up to a given target value.

• It can be solved using dynamic programming or backtracking.

• The time complexity of the dynamic programming solution is O(n*target), where n is the size of the array.

• The problem can be further optimized using memoization or by using a boolean array t
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Q1. 
0/1 Knapsack Problem Statement
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...read more
Ans. 
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
• Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.

• Iterate through each item and update the array based on whether including the item would increase the total value.

• The final value in the array at index W will be the maximum value that can be stolen.
Answered by AI
Add your answer
Q2. 
Find the Second Largest Element
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
Example:
Input:
ARR = [2,...read more
Ans. 
Find the second largest element in an array of integers.
• Iterate through the array to find the largest and second largest elements.

• Handle cases where all elements are identical.

• Return -1 if a second largest element does not exist.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

System Design Round

Q1. Design a system for Twitter, discussing its architecture, key components, and scalability considerations.
Ans. 
Design a scalable system for Twitter with key components and architecture.
• Use microservices architecture for scalability and fault isolation.

• Key components include user service, tweet service, timeline service, and notification service.

• Use a distributed database like Cassandra for storing tweets and user data.

• Implement a message queue like Kafka for handling real-time updates and notifications.

• Use a caching layer like ...read more
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality

60 minutes, CIDR network masks

Round duration - 60 minutes
Round difficulty - Medium

4 coding questions on hackerrank.

Q1. 
Dice Throws Problem Statement
You are given D dice, each having F faces numbered from 1 to F. The task is to determine the number of possible ways to roll all the dice such that the sum of the face-up num...read more
Ans. 
The task is to determine the number of possible ways to roll all the dice such that the sum of the face-up numbers equals the given 'target' sum.
• Use dynamic programming to solve the problem efficiently.

• Create a 2D array to store the number of ways to achieve each sum with the given number of dice.

• Iterate through the dice and faces to calculate the number of ways to reach each sum.

• Return the result modulo 10^9 + 7.

• Optim...read more
Answered by AI
Add your answer
Q2. 
Stack using Two Queues Problem Statement
Develop a Stack Data Structure to store integer values using two Queues internally.
Your stack implementation should provide these public functions:
Explanation:
...read more
Ans. 
Implement a stack using two queues to store integer values with specified functions.
• Use two queues to simulate stack operations efficiently.

• Maintain the top element in one of the queues for easy access.

• Ensure proper handling of edge cases like empty stack.

• Example: Push elements 5, 10, 15; Pop elements; Check top element.

• Example: Check if stack is empty; Get stack size.
Answered by AI
Add your answer
Q3. 
Maximum Subarray Sum Problem Statement
Given an array 'ARR' of integers with length 'N', the task is to determine the sum of the subarray (including an empty subarray) that yields the maximum sum among al...read more
Ans. 
Find the maximum sum of a subarray in an array of integers.
• Iterate through the array and keep track of the maximum sum subarray ending at each index.

• Use Kadane's algorithm to efficiently find the maximum subarray sum.

• Consider the case where all elements are negative to handle edge cases.

• Example: For input [1, -2, 3, -1, 2], the maximum subarray sum is 4.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

My 1st technical round began with a small introduction and a discussion on my projects. After that, my complete interview revolved around Object-oriented principles and 1 basic coding question. The interviewer asked all the pillars of Object-oriented along with use cases and where have I implemented them in my projects.

Round duration - 45 minutes
Round difficulty - Easy

In my 2nd technical round, the interviewer began with the complete discussion of my projects. He asked me everything about them like which technologies I have used, why I have used them, what are the alternatives, what are the real-life applications of these projects. After this, He asked questions on Computer Networks, Operating system, Database Management system and at the end, some of the SQL queries. SQL queries were quite easy, I found one of the queries tricky and harder as compared to other i.e print nth largest salary of the employees. The interviewer also asked me why I was not able to code one of the questions in the coding round. I explained the complete approach of that question and he was quite satisfied. This technical round was of 1 hour long.

Q1. Print the nth largest salary from a given list of salaries.
Ans. 
Find the nth largest salary from a list of salaries.
• Sort the list of salaries in descending order.

• Remove duplicates from the sorted list.

• Return the salary at index n-1 from the sorted list.
Answered by AI
Add your answer

Round duration - 35 minutes
Round difficulty - Easy

There were two panellists in this round and they began with a small introduction. One of them asked me about my capstone project which was based on object recognition task and deep learning. He just told me to explain deep learning in complete detail and how can it be used on my college campus. Then, He asked me what technologies are being used and how I trained my model as the model was quite heavy and computationally intensive. Then, they asked me how I cope up with my team members in the pandemic situation and how I managed to interact with them.

Q1. What are the basic applications of deep learning, and how can I implement it in my college?
Ans. 
Deep learning has applications in image and speech recognition, natural language processing, autonomous vehicles, etc.
• Image recognition - identifying objects in images, used in self-driving cars, medical imaging, etc.

• Speech recognition - converting spoken language into text, used in virtual assistants like Siri, Alexa, etc.

• Natural language processing - understanding and generating human language, used in chatbots, lang...read more
Answered by AI
Add your answer

4 questions, 1 easy, 2 medium, 1 hard.
based on stack, DP and String.

Q1. Based on OOPS 4 pillars.
Add your answer
Q2. Based on spark and operating system as mentioned in my resume.
Add your answer
Q3. Mostly on basic topics like DBMS, OOPS, OS, DSA (invert a binary tree, a medium string question).
Add your answer

Q1. Explain the project done in internship.
Add your answer
Q2. Explain spark architecture and related questions on architecture.
Add your answer