Ebaotech Software Developer Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions on DSA and OS.

Q1. 
LRU Cache Design Problem Statement
Design and implement a data structure for a Least Recently Used (LRU) cache that supports the following operations:
• get(key) - Retrieve the value associated with the...read more
Ans. 
Design and implement a Least Recently Used (LRU) cache data structure that supports get and put operations with a specified capacity.
• Implement a doubly linked list to keep track of the order of keys based on their usage.

• Use a hashmap to store key-value pairs for quick access and updates.

• When a key is accessed or updated, move it to the front of the linked list to mark it as the most recently used.

• When the cache reaches...read more
Answered by AI
Add your answer
Q2. 
Maximum of All Subarrays of Size K
Given an array of non-negative integers and an integer K representing the length of a subarray, your task is to determine the maximum elements for each subarray of size ...read more
Ans. 
Find the maximum elements for each subarray of size K in a given array.
• Iterate through the array and maintain a deque to store the indices of elements in decreasing order.

• Pop elements from the deque that are out of the current window.

• Keep track of the maximum element in each subarray of size K.

• Return the maximum elements for each subarray.
Answered by AI
Add your answer
Q3. What is virtual memory?
Ans. 
Virtual memory is a memory management technique that allows a computer to compensate for physical memory shortages by temporarily transferring data from RAM to disk storage.
• Virtual memory allows programs to use more memory than is physically available on the system.

• It helps in multitasking by allowing multiple programs to run simultaneously without running out of memory.

• Virtual memory uses a combination of RAM and disk...read more
Answered by AI
Add your answer

Mcq related to dsa ,oops

Q1. Just basic oops questions about polymorphism,inheritance
Add your answer

90 min long test, with 4 coding questions on data structures and algorithms, 2 of them being the medium and other medium-hard.

Q1. Distinct subsequences, leetcode problem link: leetcode.com/problems/distinct-subsequences
Ans. 
Count distinct subsequences of a string that match a target string using dynamic programming.
• Use dynamic programming to build a 2D table where dp[i][j] represents the number of distinct subsequences of s[0..i] that equals t[0..j].

• Initialize dp[0][0] = 1, as an empty string is a subsequence of another empty string.

• If t is empty, then dp[i][0] = 1 for all i, since an empty target can be formed from any prefix of s.

• If s i...read more
Answered by AI
Add your answer

4 question (1.5 hrs test) 400 points (100 points for question each)

Q1. Calculate the no.of consecutive zeroes in a binary array
Ans. 
Count consecutive zeroes in a binary array
• Iterate through the binary array and keep track of the maximum consecutive zeroes encountered

• Reset the count of consecutive zeroes when a non-zero element is encountered

• Return the maximum consecutive zeroes found
Answered by AI
Add your answer
Q2. Return k pairs of subsets having sum=num
Ans. 
Return k pairs of subsets with sum=num
• Use a nested loop to iterate through all possible pairs of subsets

• Check if the sum of the subsets equals the target num

• Store the valid pairs in an array and return k pairs
Answered by AI
Add your answer

1.5 hours, 4 coding questions: 1 math, 1 DP, 2 Graphs

Coding test was. good enough with leetfcode medium

Coding test was good enogugh with leetcode medum