Upload Button Icon Add office photos

Filter interviews by

Media Net Software Engineer Interview Questions and Answers

Updated 3 Sep 2022

Media Net Software Engineer Interview Experiences

1 interview found

I applied via Walk-in and was interviewed before Sep 2021. There was 1 interview round.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Given array representing building, find which buildings will receive sunlight
  • Ans. 

    Find buildings receiving sunlight from given array of buildings

    • Iterate through array and keep track of maximum height seen so far

    • If current building height is greater than maximum height, it will receive sunlight

    • Add index of buildings receiving sunlight to result array

  • Answered by AI
  • Q2. Convert number into US sentence
  • Ans. 

    Convert a given number into a sentence in US format.

    • Divide the number into groups of three digits from right to left.

    • Convert each group into words using a lookup table.

    • Add appropriate suffixes like thousand, million, billion, etc.

    • Combine all the groups into a sentence.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Learn basic well
Focus on DP, Graph and Tree questions

Skills evaluated in this interview

Interview questions from similar companies

I applied via Campus Placement and was interviewed before Nov 2020. There were 3 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Data Structures
  • Q2. Algorithms knowledge

Interview Preparation Tips

Interview preparation tips for other job seekers - Study DSA and be thorough with projects.

Interview Questionnaire 

1 Question

  • Q1. Questions related to Data Structures like Array, Stack, Queue.. etc., Questions related to Algorithms Like Dynamic Programming and Questions from DBMS.

I applied via Campus Placement and was interviewed in Oct 2019. There were 5 interview rounds.

Interview Questionnaire 

9 Questions

  • Q1. Graph Question:- There is a chessboard. It is different from the normal chessboard. White and black blocks can be anywhere. Source and destination block are given. I was asked to find the path with a mini...
  • Q2. Find the sum of k smallest number in a BST.
  • Ans. 

    Find sum of k smallest numbers in a BST.

    • Traverse the BST in-order and add the k smallest numbers to a sum variable.

    • Use a priority queue to keep track of the k smallest numbers.

    • If k is greater than the number of nodes in the BST, return the sum of all nodes.

    • If k is 0, return 0.

  • Answered by AI
  • Q3. System design of BookMyShow. Design the algorithm and database for the seat booking system. How this the system will handle the case when the payment gets failed. Again he asked me to write the query for...
  • Ans. 

    Design algorithm and database for seat booking system of BookMyShow and handle failed payments.

    • Create a database with tables for movies, theaters, seats, bookings, and payments

    • Use a locking mechanism to prevent double booking of seats

    • If payment fails, release the locked seats and notify the user

    • Write a query to get the timestamp in SQL: SELECT CURRENT_TIMESTAMP;

  • Answered by AI
  • Q4. Write the code for the time stamp in C.
  • Ans. 

    Code for time stamp in C

    • Use the time.h header file

    • Call the time() function to get the current time in seconds

    • Convert the time to a string using strftime() function

    • Use the format string to specify the desired format of the time stamp

  • Answered by AI
  • Q5. Write the code for rearranging the array in consecutive pair multiplication. For example consider an array with 10 element A0, A1, A2......A9. The resultant array will be A0*A1, A1*A2, A2*A3, and so on. Th...
  • Ans. 

    Rearrange array in consecutive pair multiplication in descending order.

    • Create a new array to store the multiplied values

    • Use a loop to iterate through the original array and multiply consecutive pairs

    • Write a compare function to sort the new array in descending order

  • Answered by AI
  • Q6. Write the code to rearrange the array in maximum-minimum form.
  • Ans. 

    Code to rearrange an array in maximum-minimum form.

    • Sort the array in descending order.

    • Create a new array and alternate between adding the maximum and minimum values from the sorted array.

    • Return the new array.

    • Time complexity: O(nlogn)

    • Space complexity: O(n)

  • Answered by AI
  • Q7. What is stoi function (stoi() function)? Its uses and code to Implement stoi function.
  • Ans. 

    stoi() function converts a string to an integer.

    • stoi() is a C++ function that takes a string as input and returns an integer.

    • It is used to convert a string of digits into an integer.

    • It can also handle negative numbers and ignore leading whitespace.

    • Example: int num = stoi("123"); // num is now 123

  • Answered by AI
  • Q8. Write code for Longest Common Substring. (time limit for writing this code was 5-6 minutes)
  • Ans. 

    Code for finding the longest common substring in an array of strings.

    • Iterate through the first string and check for all possible substrings

    • Check if the substring is present in all other strings

    • Keep track of the longest common substring found so far

    • Return the longest common substring

  • Answered by AI
  • Q9. Q: What is a Transaction in DBMS and ACID properties? Q: What is Thread and how it is different from the Process? Q: What are some Linux commands. Write any 5 commands? Q: Why sudo is used for commands?...
  • Ans. 

    Answers to common technical questions in a software engineering interview

    • A transaction in DBMS is a sequence of operations that must be treated as a single unit of work. ACID properties ensure reliability and consistency of transactions.

    • A thread is a lightweight process that shares memory and resources with other threads in the same process. A process is a separate instance of a program.

    • Common Linux commands include ls...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident about what you speak.

Take your step forward. Try to be firstly interviewed if choice arrives ( They get screwed up at the end and ask questions that the previous candidates failed ).

Before approaching the solution to be clear with edge test-cases. Once you are completely sure then come up with an approach.

Skills evaluated in this interview

I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. DS Algo Questions on Trees. Leadership Principles

Interview Preparation Tips

Interview preparation tips for other job seekers - Read up on DS Algo and white paper coding and Leadership Principles

Software Engineer Interview Questions & Answers

Amazon user image Rajesh Paramanandam

posted on 24 Feb 2017

I was interviewed in Oct 2016.

Interview Preparation Tips

Round: Test
Experience: Aptitude was quite easy they just asked us basic questions from Math,logical reasoning and english
Tips: Just think well before u do..
Duration: 1 hour 30 minutes
Total Questions: 40

Round: Behavioural Interview
Experience: It was face to face .. the interviewee asked questions from our resume... Since I m from computer science background they asked some technical questions..

Tips: Beware filling ur resume.. they will ask every stuff that you have in resume

Round: Technical Interview
Experience: Discussion about my project that i vr done in my final year.they asked me what was my role in my project

College Name: Sri ganesh college of engineering and technology

Interview Preparation Tips

Round: Test
Experience: The first test
contained 25 objective questions encompassing the basics of Computer Science ranging from
data structures, networks and operating systems to theory of computation
Duration: 45 minutes
Total Questions: 25

Round: Test
Experience: The second test contained 3 coding questions.
Duration: 45 minutes
Total Questions: 3

Round: HR Interview
Experience: After the written test, next day I appeared for 3 interviews.
They were checking if you can write code and also if you are aware of the practical issues faced while coding. In the final round they were testing if you could abstract out a real world
problem into code.
Tips: Overall I can say that you must hope for the best and prepare for the
worst. So make sure that you are prepared on all counts. You never know what might go wrong.

Interview Questionnaire 

2 Questions

  • Q1. Data struct,algo,
  • Q2. High level data structs and algos

Interview Preparation Tips

Round: Problem Statement
Experience: coding and submission before face to face interview shortlisting
Tips: practice coding ,coding is key to success for SE

Round: Resume Shortlist
Experience: based on marks ,I was called for F2F
Tips: the ppt was to be submitted explaining the approach

Round: Technical Interview
Experience: a lot of brain storming
Tips: understands the nitty gritty of the structs and algos

Round: Technical Interview
Experience: exact code was to be written instead of pseudo code
Tips: get hold of DS,Algos

I applied via Campus Placement

Interview Questionnaire 

4 Questions

  • Q1. Boundary traversal of a tree
  • Ans. 

    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...

  • Answered by AI
  • Q2. Find the nearest greater value of a given value in a BST
  • Ans. 

    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

  • Answered by AI
  • Q3. There is an infinite stair case and there are n rounds. in i'th round we can jump i steps at one or discard them. it is given that k'th step is broken , find the max height we can reach with out stepping o...
  • Ans. 

    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

  • Answered by AI
  • Q4. Height h was given and form a binary tree of height h and start combining bottom nodes to form a cone like structure

Interview Preparation Tips

Round: Test
Experience: there were 20 MCQ which were on ds , networks and basic coding followed by 2 coding questions.
1) print all the distinct substrings of a given string in lexicographical order
2) find the max i-j value in the given array of 0's and 1's such that there are equal number of zeros and ones, where i is the starting index and j is the ending index of the array.
Tips: make sure that you pass atleast half the test cases for both the question.
Duration: 90 minutes
Total Questions: 22

Round: Technical Interview
Experience: 1) i printed left view then leaves and right view using three level order traversals . he asked me to use one traversal only, then i told him the approach and wrote the working code.
2) told him the approach and coded it.
Tips: look at corner cases properly. the interviewers were friendly, so i felt relaxed.

Round: Technical Interview
Experience: 1) i told him a recursive O(2^n) solution, optimised it to O(n^2). he told me to optimise further. Then i finally came up with O(n) solution after 5 min and he was satisfied . i coded it. he was satisfied finally :D .
2) came up with the approach immediately and coded it. he was satisfied.
Tips: he was very particular about corner cases and he checked the code througly tested it on some cases to ensure it was working.

General Tips: be cool. interviewers were friendly. tell them what you are thinking and be clear with the question before answering to avoid wasteage of time.
Skill Tips: solve problems from codechef, spoj and codeforces. solve interview questions from geeksforgeeks and careercup.
Skills: the way you think, coding skills and knowledge on data structures.
Duration: 3
College Name: IIT Roorkee
Motivation: some good seniors got intern, so i was inspired.
Funny Moments: on the interview day a person came into the conference room to call me for interview, i didnt thought he was interviewer. he was very simple, but intelligent and at last i felt like asking him to ask me one more coding question as it was fun solving questions infront of him, but i didnt do that as i was frightened if i would not be able to answer it would be a negative remark :P .

Skills evaluated in this interview

Interview Questionnaire 

13 Questions

  • Q1. Given a string of parenthesis, write a function if it is balanced
  • Ans. 

    Function to check if a string of parenthesis is balanced

    • Use a stack to keep track of opening parenthesis

    • If a closing parenthesis is encountered, pop from stack and check if it matches

    • If stack is empty and a closing parenthesis is encountered, return False

    • If all parenthesis are matched and stack is empty, return True

  • Answered by AI
  • Q2. Given two linked lists each of which represent a number, write a function that returns a linked list that represents the sum
  • Q3. Find the number of occurrences of words in a paragraph
  • Ans. 

    Count the occurrences of words in a paragraph.

    • Split the paragraph into words using whitespace as a delimiter.

    • Create a dictionary to store the count of each word.

    • Iterate through the words and increment the count in the dictionary.

    • Return the dictionary with the word counts.

  • Answered by AI
  • Q4. Find common elements out of two sorted array?
  • Ans. 

    Find common elements out of two sorted array

    • Use two pointers to traverse both arrays simultaneously

    • Compare elements at each pointer and move the pointer of the smaller element

    • If elements are equal, add to common elements list and move both pointers

    • Stop when either pointer reaches end of array

  • Answered by AI
  • Q5. Convert BST to a Doubly linked list?
  • Ans. 

    Convert a Binary Search Tree to a Doubly Linked List.

    • Create a DLL node class with left, right, and data fields.

    • Traverse the BST in-order and add each node to the DLL.

    • Adjust the left and right pointers of each node to create the DLL.

    • Return the head of the DLL.

  • Answered by AI
  • Q6. Given a binary tree in which the node structure has an additional field called “next” which of pointer to tree node type, fill up this field of each node to point to the next node at the same level (NULL i...
  • Ans. 

    The task is to fill the 'next' field of each node in a binary tree to point to the next node at the same level.

    • Use a level order traversal to process the tree nodes.

    • Maintain a queue to store the nodes at each level.

    • For each node, set its 'next' field to the next node in the queue.

    • If a node is the last node at its level, set its 'next' field to NULL.

  • Answered by AI
  • Q7. Given a parentheses string, determine if it is a valid / legitimate parentheses string. For strings consisting of single parentheses type and those consisting of multiple types
  • Q8. You have a dictionary of words. Given a word, print all anagram are in dictionary . State the data structure to be used to solve this problem
  • Ans. 

    To find anagrams of a given word in a dictionary, use a hash table to store sorted versions of each word as keys and their corresponding original words as values.

    • Create a hash table to store the anagrams

    • Iterate through each word in the dictionary

    • Sort the characters of the word and use it as a key in the hash table

    • If the key already exists, add the word to the list of values for that key

    • Print the list of values for the

  • Answered by AI
  • Q9. You have given 10 files and you have given a string suggest data structure which ll facilitate efficient search of string in the file if string appears more than ones in that case u have to print line numb...
  • Ans. 

    Suggest a data structure for efficient search of a string in 10 files and print line number and file if string appears more than once.

    • Use a hash table to store the file name and line number of each occurrence of the string.

    • Iterate through each file and for each line, check if the string is present and update the hash table accordingly.

    • Print the hash table entries for the string.

  • Answered by AI
  • Q10. Write a program to print a tree in vertical order asked more than one approach to do this problem and modified problem many times
  • Q11. Discussion on my current work, difficulties and challenges faced at work, difficult people I have had to work with, instances when I went out of my way to propose creative solutions to existing problems a...
  • Q12. Why do you think amazon is the right place for you?
  • Ans. 

    Amazon is the right place for me because of its innovative culture, vast resources, and opportunities for growth.

    • Amazon's innovative culture aligns with my passion for pushing boundaries and finding creative solutions.

    • The company's vast resources provide the necessary tools and support to develop and deliver high-quality software.

    • Amazon offers numerous opportunities for growth and career advancement, allowing me to con...

  • Answered by AI
  • Q13. You have given an binary matrix which is sorted row wise and column wise write a program to search a row in the matrix having maximum number of zeroes

Interview Preparation Tips

General Tips: My process started off at one their hiring drives. It was ahiring drivein world trade center in Bangalore. It was a tiresome process that comprised a written round followed by 4rounds of interview.
Skills: Algorithm, data structure
College Name: NA

Skills evaluated in this interview

Media Net Interview FAQs

How many rounds are there in Media Net Software Engineer interview?
Media Net interview process usually has 1 rounds. The most common rounds in the Media Net interview process are One-on-one Round.
What are the top questions asked in Media Net Software Engineer interview?

Some of the top questions asked at the Media Net Software Engineer interview -

  1. Given array representing building, find which buildings will receive sunli...read more
  2. Convert number into US sente...read more

Tell us how to improve this page.

Media Net Software Engineer Salary
based on 4 salaries
₹4 L/yr - ₹25.8 L/yr
67% more than the average Software Engineer Salary in India
View more details
Research Analyst
7 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Data Engineer
7 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Product Analyst
7 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Web Application Developer
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Manager
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Media Net with

Times Internet

3.6
Compare

Network 18

3.5
Compare

Zee Entertainment Enterprises

3.5
Compare

Sun TV Network

3.6
Compare
Did you find this page helpful?
Yes No
write
Share an Interview