Filter interviews by
I applied via Company Website and was interviewed in Nov 2022. There were 3 interview rounds.
2 medium hard problems were asled one was dynamic programming second was multi spurce bfs
The question is about finding the area of a histogram and the Kth largest value.
Calculate the area of the histogram by multiplying the width and height of each bar and summing them up.
Find the Kth largest value by sorting the data and selecting the Kth element.
The Kth largest value can also be found using a heap data structure.
Example: Histogram area of [2, 3, 1, 4, 5] with bar width of 1 is 15. The 3rd largest value i
Finding the Kth largest element in an array.
Sort the array and return the Kth element from the end
Use a max heap to keep track of the K largest elements
Use quickselect algorithm to find the Kth largest element
I applied via Recruitment Consulltant and was interviewed in Jun 2022. There were 2 interview rounds.
1 hour 30 minutes, questions were based on coding, aptitude
I applied via Campus Placement
Linked list one easy question
Can't disclose NDA it was regarding class diagram
My favorite company is Google.
Innovative technology
Diverse range of products and services
Strong focus on user experience
IP address is converted to URL through DNS resolution process involving multiple steps.
IP address is obtained from the domain name system (DNS) server when a user enters a URL in a web browser.
The DNS server looks up the IP address associated with the URL in its database.
The DNS server then returns the IP address to the user's device, allowing it to establish a connection to the server hosting the website.
For example, ...
I chose this company because of its innovative projects, strong company culture, and opportunities for growth.
Innovative projects: I am excited about the cutting-edge technology being developed at Mts.
Strong company culture: I value a supportive and collaborative work environment.
Opportunities for growth: I see potential for career advancement and skill development here.
I want to improve my problem-solving skills by learning new programming languages and technologies.
Learn a new programming language like Python or Java
Explore new technologies like cloud computing or machine learning
Practice solving coding challenges on platforms like LeetCode or HackerRank
I applied via Naukri.com and was interviewed in Sep 2024. There was 1 interview round.
C+ and C++ are programming languages used for system and application development, while Java is a high-level programming language known for its portability and versatility.
C+ and C++ are low-level programming languages used for system programming and application development.
C++ is an extension of the C programming language with added features like classes and objects.
Java is a high-level programming language known for ...
Python is a high-level programming language known for its simplicity and readability. HTML is a markup language used for creating web pages.
Python is a versatile language used for web development, data analysis, artificial intelligence, and more
HTML stands for HyperText Markup Language and is used to create the structure of web pages
Python code is executed line by line, while HTML is interpreted by web browsers to disp
Writing assignment - mix of domain and role based
Product demo - understand the product and a basic presentation
Experienced marketing professional with a strong background in digital marketing and brand management.
Over 5 years of experience in marketing roles
Specialize in digital marketing strategies and social media management
Successfully launched several marketing campaigns resulting in increased brand awareness and sales
Strong analytical skills to track and measure campaign performance
I applied via Walk-in and was interviewed before Feb 2022. There were 3 interview rounds.
All Logical questions plus coding
I applied via Naukri.com and was interviewed in Mar 2018. There were 2 interview rounds.
I was interviewed before Sep 2020.
Round duration - 140 minutes
Round difficulty - Hard
2 Separate online rounds were hosted on HackerRank . Online Aptitude Round consisted of 45 questions. Online Coding Round consisted of 3 questions.
You have to classify a string as “GOOD”, “BAD” or “MIXED”. A string is composed of lowercase alphabets and ‘?’. A ‘?’ is to be replaced by any of the lowercase alphabets. Now you hav...
Applied a simple brute force solution and classified according to the rules.
The key point to notice here is that in the given problem that we don’t need to delete anything from the array while selecting arr[i] from the array. We just only care about whether we select any number arr[i] from the array then we cant select the arr[i]+1 and arr[i]-1 from the array to maximize the sum in the next steps. So we will find the maximum number max in the array and create a new auxiliary array of ...
The key idea is to put the highest frequency element first (a greedy approach). We will be using the priority queue to pick the elements with the highest frequency. So first, we will store the frequency of each element. And then we will store all the numbers with their frequencies into the priority queue in the highest frequency priority manner. After that, we pop one by one element from the p...
Round duration - 40 minutes
Round difficulty - Hard
The interview started of with questions about the online test, general questions on “tell me about yourself”
Then he asked me a relative velocity problem from physics section to warm things up.
It was Followed by discussion on topics taught in college, Questions on OS and DBMS.
One basic approach is to explore all possible steps which can be climbed with either taking one step or two steps. So at every step, we have two options to climb the stairs either we can climb with one step, or we can climb with two steps. So the number of ways can be recursively defined as :
countDistinctWayToClimbStair ( currStep, N ) = countDistinctWayToClimbStair ( currStep+1, N ) + countDistinctWay...
For the given binary tree
The ...
In the level order traversal, we will be using queue data structure which has the property FIRST IN FIRST OUT that’s why which nodes come first in current level the children of that node will also come first for the next level. So, we visit all the nodes one by one of the current level and push into the queue so that when we will be complete with the current level, then we can start exploring nodes ...
Round duration - 50 minutes
Round difficulty - Easy
The interviewer asked about my project – the idea of the project, the challenges I faced etc. She also asked some OS concepts like CPU scheduling, multi-queue scheduling, mutex, deadlocks.
If the input tree is as depicted in the picture:
The Left View of the tree will be: 2 35 2
This problem can be solved through recursion.We will maintain max_level variable which will keep track of maxLevel and will pass current level in recursion as argument. Whenever we see a node whose current level is more than maxLevel then we will print that node as that will be first node for that current level. Also update maxLevel with current level.
Space Complexity: O(n)Explanation:O(N), where ‘N’...
Input:
Output: 2 35 2 10 2
The first line contains...
Before looking at the approach, let's define a couple of terms; the level of a node and the distance of a node. The level of a node means the depth of the node with respect to the root node. So, the level of the root node will be 0, its children's would be 1, and so on. To generalize, if the level of a node is ‘x’, then the level of its children would be ‘x + 1’.
The distance of a node is a measure of how...
Design a system where i can store incoming stream of chars in sorted manner and to answer a query whether a char is present or not
Tip 1: Strong grasp on Heaps
Tip 2: Ask questions if you are not sure
Tip 3: Design a basic HLD with use case scenarios.
She then Asked me Various Mutex related puzzles like “IF you have adobe acrobat and you want to allow only 1 instance of it to run at a time, how will you achieve this wrt to OS involved.”
I an...
Tip 1 : Be solid with the basics of Ds, Algo. Good to have end to end projects which are hosted on cloud.
Tip 2 : Its always good to be presentable and have good communications skills
Tip 3 : Be honest, clear in approach and always walkthrough your thought process to the interviewer
Tip 1 : Mention your projects and experience at the top. Be clear on what was done, a brief on how it was done, language /tech stack involved. If possible try to host and make it accessible. You never know if you can present it with just one click.
Tip 2 : Choose a balance between, white spaces and text, it should be well indented, no grammatical errors.
Tip 3 : It takes less than 2 min to scan a resume. Don't mention things which are irrelevant.
based on 1 review
Rating in categories
Technical Support Engineer
834
salaries
| ₹12 L/yr - ₹24 L/yr |
Technical Consultant
293
salaries
| ₹13.8 L/yr - ₹30 L/yr |
Member Technical Staff
256
salaries
| ₹20 L/yr - ₹60 L/yr |
Salesforce Developer
226
salaries
| ₹7.2 L/yr - ₹27 L/yr |
Senior Member of Technical Staff
225
salaries
| ₹30 L/yr - ₹93 L/yr |
SAP
Zoho
Oracle
Adobe