Media Net Software Engineer Interview Questions and Answers for Freshers

Function to return mutual friends given two ids and getFriends(id) function

• Call getFriends(id) for both ids to get their respective friend lists

• Iterate through both lists and compare to find mutual friends

• Return the list of mutual friends

Function to return list of friends of friends in decreasing order of mutual friends

• Use a set to store all friends of friends

• Iterate through the list of friends of the given id

• For each friend, iterate through their list of friends and count mutual friends

• Sort the set of friends of friends by decreasing number of mutual friends

Given time slots, find a specific time with maximum overlap. Prove solution.

• Create a list of all start and end times

• Sort the list in ascending order

• Iterate through the list and keep track of the number of overlaps at each time

• Return the time with the maximum number of overlaps

• Prove solution by testing with different input sizes and edge cases

Find the longest sub-array with increasing order of integers.

• Iterate through the array and keep track of the current sub-array's start and end indices.

• Update the start index whenever the current element is smaller than the previous element.

• Update the end index whenever the current element is greater than or equal to the next element.

• Calculate the length of the sub-array and compare it with the longest sub-array found s

Find the length of longest increasing subsequence and print the sequence from an array of integers.

• Use dynamic programming to solve the problem

• Create an array to store the length of longest increasing subsequence ending at each index

• Traverse the array and update the length of longest increasing subsequence for each index

• Print the sequence by backtracking from the index with the maximum length

• Time complexity: O(n^2)

• Exam...read more

Code to find a given integer in a rotated sorted array.

• Use binary search to find the pivot point where the array is rotated.

• Divide the array into two subarrays and perform binary search on the appropriate subarray.

• Handle edge cases such as the target integer not being present in the array.

Use a min-heap to keep track of the largest K numbers seen so far.

• Create a min-heap of size K.

• For each incoming integer, add it to the heap if it's larger than the smallest element in the heap.

• If the heap size exceeds K, remove the smallest element.

• At the end, the heap will contain the largest K numbers in the input.

LRU Cache is a data structure that stores the most recently used items and discards the least recently used items.

• Use a doubly linked list to keep track of the order of items in the cache

• Use a hash map to store the key-value pairs for fast access

• When an item is accessed, move it to the front of the linked list

• When the cache is full, remove the least recently used item from the back of the linked list and the hash map

Boundary traversal of a tree is the process of visiting the nodes on the boundary of a tree in a specific order.

• The boundary traversal can be done in three steps: left boundary, leaf nodes, and right boundary.

• For the left boundary, start from the root and traverse down the left side of the tree until reaching a leaf node.

• For the leaf nodes, perform an inorder traversal to visit all the leaf nodes of the tree.

• For the ri...read more

Find the nearest greater value of a given value in a Binary Search Tree (BST).

• Start from the root node and compare the given value with the current node's value.

• If the given value is less than the current node's value, move to the left subtree.

• If the given value is greater than the current node's value, move to the right subtree.

• Keep track of the closest greater value encountered while traversing the tree.

• Return the cl

Given an infinite staircase with a broken kth step, find the maximum height we can reach in n rounds of jumping i steps.

• We can start by jumping the maximum number of steps in each round until we reach the broken step.

• After reaching the broken step, we can discard the i steps that would land us on the broken step and jump the remaining steps.

• We can continue this pattern until we reach the maximum height we can reach wit