Filter interviews by
Clear (1)
I was interviewed in Jan 2021.
Round duration - 60 minutes
Round difficulty - Medium
There were 2 coding questions. All of them were pretty easy and solvable in less than 40 minutes. Some string and pattern matching + some number theory problems were there.
Given an array of integers, determine the contiguous subarray that produces the maximum product of its elements.
A subarray can be derived from th...
Find the contiguous subarray with the maximum product of elements in an array.
Iterate through the array and keep track of the maximum and minimum product ending at each index.
Update the maximum product by taking the maximum of current element, current element * previous maximum, current element * previous minimum.
Update the minimum product by taking the minimum of current element, current element * previous maximum, cu...
Given a postfix expression, your task is to evaluate the expression. The operator will appear in the expression after the operands. The output for each expr...
Evaluate postfix expressions by applying operators after operands. Return result modulo (10^9+7).
Iterate through each character in the postfix expression
If character is an operand, push it onto the stack
If character is an operator, pop two operands from stack, apply operator, and push result back
Repeat until end of expression, return final result modulo (10^9+7)
Round duration - 60 minutes
Round difficulty - Hard
This was a technical round. First after properly introducing ourselves(me and the interviewer), we started with the main interview. I was asked 2 questions, one DS and Algorithms and the other System Design question.
You are provided with a Binary Tree consisting of 'N' nodes, where each node holds an integer value. Your objective is to identify and list all nodes that do not possess a...
Identify and list nodes in a Binary Tree that do not have a sibling.
Traverse the Binary Tree in level order to identify sibling nodes.
Keep track of nodes without siblings and output them in ascending order.
Handle cases where nodes have only one child or no children.
Consider the root node as a sibling node.
Sort the output list of nodes without siblings in ascending order.
Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping interv...
Merge overlapping intervals and return sorted list of merged intervals.
Identify overlapping intervals based on start and end times
Merge overlapping intervals to form new intervals
Sort the merged intervals in ascending order of start times
Design a streaming service like Netflix and explain content onboarding process.
Create a user-friendly dashboard for content providers to submit new content.
Implement a review process to ensure quality and compliance with guidelines.
Use algorithms to categorize and recommend new content to users based on their preferences.
Negotiate licensing deals with production companies to acquire new content.
Regularly update the lib
Tip 1 : Make sure to solve the most recommended problems of LeetCode. Around 200 will do
Tip 2 : Be confident with your basics of chapters from Operating Systems and DBMS or SQL Queries.
Tip 3 : Have a slight knowledge of system designing concepts.
Tip 1 : Make your Resume such that it is properly readable. Keep it of one page. If it exceeds try your best to include only the most important highlights.
Tip 2 : Put your most important achievements at the top and after than the not so important ones. You want the interviewer to see them first.
Top trending discussions
I applied via Walk-in and was interviewed before Dec 2020. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Aug 2020. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Feb 2020. There were 6 interview rounds.
I applied via Company Website and was interviewed before Feb 2020. There was 1 interview round.
I applied via Campus Placement and was interviewed in Oct 2020. There were 4 interview rounds.
Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
Start from the first element and compare it with the next element
If the next element is smaller, swap them
Repeat this process for all elements in the array
Continue this process until no more swaps are needed
A program to print all prime numbers
Take input from user for range of numbers
Loop through the range and check if each number is prime
Print the prime numbers
Hashmap is a data structure that stores key-value pairs and allows constant time access to values based on their keys.
Hashmap uses a hash function to map keys to indices in an array.
Collisions can occur when multiple keys map to the same index, which can be resolved using techniques like chaining or open addressing.
Examples of hashmap implementations include Java's HashMap class and Python's dict type.
Inheritance is a mechanism in object-oriented programming where a new class is created by inheriting properties of an existing class.
Inheritance allows code reuse and promotes code organization.
The existing class is called the parent or superclass, and the new class is called the child or subclass.
The child class inherits all the properties and methods of the parent class and can also add new properties and methods.
For...
I applied via Walk-in and was interviewed in Mar 2021. There was 1 interview round.
I was interviewed in Mar 2021.
Software Development Engineer II
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Zoho
TCS
Infosys
Wipro