Filter interviews by
Given a binary tree, your task is to print the left view of the tree.
The input will be in level order form, with node values separated by a ...
The task is to print the left view of a binary tree given in level order form.
Traverse the tree level by level and print the first node of each level (leftmost node).
Use a queue to keep track of nodes at each level.
Consider null nodes as well while traversing the tree.
Given a binary tree of integers, return its level order traversal.
The first line contains an integer 'T' which represents the number of test cases. For each t...
Level Order Traversal of Binary Tree returns nodes in level order traversal.
Perform a level order traversal of the binary tree starting from the root node.
Visit nodes level by level, printing them in the order they are encountered.
Use a queue data structure to keep track of nodes at each level.
Design a system to store incoming characters in sorted manner and answer queries about character presence.
Use a data structure like a balanced binary search tree to store characters in sorted order.
Implement functions to insert characters into the tree and check for character presence.
Optimize search queries by using binary search or tree traversal techniques.
Consider edge cases like duplicate characters and handl...
Given a binary tree, your task is to print the Top View of the Binary Tree. The Top View is the set of nodes visible when the tree is viewed from the top. Please e...
The task is to print the Top View of a Binary Tree, which is the set of nodes visible when viewed from the top, in left to right order.
Traverse the binary tree in level order and maintain a map to store the horizontal distance of each node from the root.
For each node, if the horizontal distance is not already in the map, add the node's value to the result.
Print the values from the map in ascending order of horizon...
What people are saying about Adobe
You are given an array/list 'NUM' of integers. Rearrange the elements of 'NUM' such that no two adjacent elements are the same in the rearranged array.
The task is to rearrange an array such that no two adjacent elements are the same.
Iterate through the array and check if any adjacent elements are the same.
If adjacent elements are the same, swap one of them with a different element.
Return 'YES' if a valid rearrangement is possible, 'NO' otherwise.
Given the number of stairs, initially at the 0th stair, you need to reach the Nth stair. Each time, you can either climb one step or two steps. Determine the number of distinct ways...
Calculate the number of distinct ways to climb N stairs by either taking one or two steps at a time.
Use dynamic programming to keep track of the number of ways to reach each stair
The number of ways to reach a stair is the sum of the number of ways to reach the previous two stairs
Return the result modulo 10^9+7
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 appeared for an interview 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 are given an array ARR
of N integers. Your task is to perform operations on this array until it becomes empty, and maximize the sum of selected elements. In each operatio...
The task is to maximize the sum of selected elements from an array by following specific rules.
Select elements strategically to maximize the sum
Remove occurrences of selected element, and its neighbors
Repeat the process until the array becomes empty
You are given an array/list 'NUM' of integers. Rearrange the elements of 'NUM' such that no two adjacent elements are the same in the rearranged array.
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.
Given the number of stairs, initially at the 0th stair, you need to reach the Nth stair. Each time, you can either climb one step or two steps. Determine the number of distinct way...
Calculate the number of distinct ways to climb N stairs by either taking one or two steps at a time.
Use dynamic programming to keep track of the number of ways to reach each stair
The number of ways to reach a stair is the sum of the number of ways to reach the previous two stairs
Return the result modulo 10^9+7
Given a binary tree of integers, return its level order traversal.
The first line contains an integer 'T' which represents the number of test cases. For each ...
Level Order Traversal of Binary Tree returns nodes in level order traversal.
Perform a level order traversal of the binary tree starting from the root node.
Visit nodes level by level, printing them in the order they are encountered.
Use a queue data structure to keep track of nodes at each level.
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.
Given a binary tree, your task is to print the left view of the tree.
The input will be in level order form, with node values separated by a...
Given a binary tree, your task is to print the Top View of the Binary Tree. The Top View is the set of nodes visible when the tree is viewed from the top. Please ...
The task is to print the Top View of a Binary Tree, which is the set of nodes visible when viewed from the top, in left to right order.
Traverse the binary tree in level order and maintain a map to store the horizontal distance of each node from the root.
For each node, if the horizontal distance is not already in the map, add the node's value to the result.
Print the values from the map in ascending order of horizontal d...
Design a system to store incoming characters in sorted manner and answer queries about character presence.
Use a data structure like a balanced binary search tree to store characters in sorted order.
Implement functions to insert characters into the tree and check for character presence.
Optimize search queries by using binary search or tree traversal techniques.
Consider edge cases like duplicate characters and handling s...
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.
I applied via LinkedIn and was interviewed in Jan 2021. There were 3 interview rounds.
I appeared for an interview in Oct 2020.
Round duration - 107 minutes
Round difficulty - Medium
The test was active on (Oct 1, 2020) from 7:00 PM to 09:00 PM. The duration of the test is 107 minutes.
The candidate should have completed the test by 9:45 PM.
The camera and microphone was on all the time. There was time alotted for each section. After completing one section you cannot switch to the previous section. If you go off the camera you will get a warning.
The test contained several sections and all questions were MCQs. The sections were Coding ability, Computer Science theory, Advanced data structures like AVL Tree, Verbal and Quantitative ability, etc
Given an array or list PREORDER
representing the preorder traversal of a Binary Search Tree (BST) with N
nodes, construct the BST which matches the given preord...
Given a preorder traversal of a BST, construct the BST and print its inorder traversal.
Parse the input to get the number of test cases and preorder traversal for each case
Construct the BST using the preorder traversal by recursively building the tree
Print the inorder traversal of the constructed BST for each test case
Round duration - 30 minutes
Round difficulty - Medium
The Round started at 10:15 am and ended at 10:45 am approx. We waited in breakout room in zoom and when the interviewer was free we entered in the zoom call with the interviewer both camera and microphone was on. The interviewer was really supportive and hepled me in thinking different approches of a problem.
Determine if a given string of integers bin
represents a valid binary number. Return 'true'
if the string represents a valid binary number, otherwise return 'false'
. A binary n...
Check if a given string represents a valid binary number composed of 0s and 1s.
Iterate through each character in the string and check if it is either '0' or '1'.
If any character is not '0' or '1', return 'false'.
Return 'true' if all characters are '0' or '1'.
You are given an array/list 'NUM' of integers. Rearrange the elements of 'NUM' such that no two adjacent elements are the same in the rearranged array.
The task is to rearrange an array such that no two adjacent elements are the same.
Iterate through the array and check if any adjacent elements are the same.
If adjacent elements are the same, swap one of them with a different element.
Return 'YES' if a valid rearrangement is possible, 'NO' otherwise.
You are provided with a positive integer N
. Your task is to identify all numbers such that the sum of the number and its digits equals N
.
N = 21
Given a string STR
containing characters from [a-z], [A-Z], [0-9], and special characters, determine the reverse of the string.
The input starts with a single i...
The result of adding two binary numbers in a 64-bit and a 32-bit operating system will differ due to the different number of bits used for calculations.
In a 64-bit operating system, the result will be more accurate and can handle larger numbers compared to a 32-bit system.
Overflow may occur in a 32-bit system when adding large binary numbers, leading to incorrect results.
Example: Adding 1111 (15 in decimal) and 1111 (1...
Round duration - 30 minutes
Round difficulty - Medium
It took place at 11:30am(approx) and last for about 30 minutes
We waited in breakout room in zoom and when the interviewer was free we entered in the zoom call with the interviewer. Both camera and microphone was on.
Round duration - 30 minutes
Round difficulty - Easy
It took place around 1:30pm and last for 30 minutes. We waited in breakout room in zoom and when the interviewer was free we entered in the zoom call with the interviewer. Both camera and microphone was on.
Tip 1 : Make your basics strong don't run after new technologies as a fresher companies wants your good command on DSA
Tip 2 : Focus more on competitive programming to get into a good organization don't indulge to much in development because the first step to reach to the interview round is to clear the coding round
Tip 3 : Do at least 2-3 Questions per day and practice daily
Tip 4 : Also practice basic aptitude questions
Tip 1 : Don't mention things in the resume that you don't have full command on you should have complete knowledge of what you mention in your resume
Tip 2 : Make your resume short and if you mention projects in your resume be clear about the details of the project even if you have done that in group because the interviewer will surely ask from it.
I recently completed a project focused on developing a mobile app for tracking personal fitness goals and health metrics.
Conducted user research to identify key features, such as step tracking and calorie counting.
Collaborated with a team of developers to design an intuitive user interface.
Implemented a backend system for data storage and user authentication.
Launched a beta version and gathered user feedback for improv...
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 Company Website and was interviewed before Oct 2019. There were 4 interview rounds.
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 50 minutes
Round difficulty - Easy
This was a Data Structural round.
Given a two-dimensional array/list consisting of integers 0s and 1s, where 1 represents land and 0 represents water, determine the number of distinct islands. A group of...
Count the number of distinct islands in a 2D array of 0s and 1s.
Identify islands by performing depth-first search (DFS) on the grid
Use a set to store the shape of each island and check for duplicates
Consider translations to determine distinct islands
Round duration - 50 minutes
Round difficulty - Easy
This was a Data Structural round.
You are tasked with arranging 'N' words of varying lengths such that each line contains at most 'M' characters, with each word separated by a space. The challenge is to minimiz...
The goal is to minimize the total cost of arranging 'N' words on each line with a maximum character limit 'M'.
Calculate the cost of each line as the cube of extra space characters needed to reach 'M'.
Minimize the total cost by arranging words to fit within the character limit on each line.
Ensure each word appears fully on one line without breaking across lines.
Round duration - 60 minutes
Round difficulty - Easy
This was a System Design round.
Design a system similar to Red Bus for handling bookings and onboarding vendors and customers.
Implement a user-friendly interface for customers to search and book tickets
Create a vendor portal for vendors to manage their offerings and availability
Include payment gateway integration for secure transactions
Develop a robust backend system for managing bookings, cancellations, and refunds
Utilize a database to store user in...
Round duration - 50 minutes
Round difficulty - Easy
This was a System Design round
Round duration - 50 minutes
Round difficulty - Easy
This was an HR round.
Tip 1 : Practice as much as you can.
Tip 2 : Prepare for company, not in general.
Tip 3 : Your past work should be objective and your contribution should be very clear
Tip 1 : Keep only relevant things for the job you are applying.
Tip 2 : Minimal data with measurable contribution and effect.
I applied via Monster and was interviewed before Apr 2020. There was 1 interview round.
posted on 9 Jun 2017
I appeared for an interview in May 2017.
AngularJS is a JavaScript framework for building dynamic web applications.
AngularJS is a client-side MVC framework.
It allows developers to build single-page applications.
It extends HTML with new attributes and tags.
AngularJS uses two-way data binding to automatically synchronize data between the model and the view.
It provides dependency injection and modularization features.
Some popular examples of websites built with ...
A directive is a programming construct that provides instructions to a compiler or interpreter.
Directives are used to control the behavior of a program or to provide additional information to the compiler or interpreter.
They are typically written as special comments or statements in the code.
Examples of directives include #include in C/C++ to include header files, #pragma to control compiler-specific behavior, and #def...
A factory is a design pattern that provides an interface for creating objects of a certain class.
A factory encapsulates the object creation logic and hides it from the client.
It allows the client to create objects without knowing the specific class or implementation details.
Factories can be used to create different types of objects based on certain conditions or parameters.
They promote loose coupling and flexibility in...
Services are software components that perform specific tasks or provide functionality to other software applications.
Services are self-contained and independent modules that can be accessed by other software components.
They can be used to handle business logic, data processing, communication with external systems, etc.
Examples of services include web services, microservices, RESTful APIs, and cloud services.
Services ca...
A factory is responsible for creating and managing objects, while a service is responsible for providing specific functionality or performing tasks.
A factory is used to create and initialize objects, often based on certain parameters or configurations.
A service is a component that provides specific functionality or performs tasks for other components or systems.
Factories are commonly used in object-oriented programming...
A program to sort an array of strings.
Use a sorting algorithm like bubble sort, insertion sort, or quicksort.
Compare strings using a comparison function.
Implement the sorting algorithm in a function that takes the array as input and modifies it in place.
This program displays words separated by spaces.
Use an array of strings to store the words.
Iterate through the array and print each word followed by a space.
Exclude the space after the last word.
A provider is a software component or service that supplies data, functionality, or resources to other software applications.
A provider is responsible for delivering data, services, or resources to other software components or applications.
Providers can be APIs, libraries, frameworks, or any other software component that offers functionality to other software.
Examples of providers include database management systems, c...
The $watch and $digest are two important concepts in AngularJS for data binding and updating the view.
$watch is a function in AngularJS that allows you to watch for changes in a specific variable or expression.
$digest is a function in AngularJS that triggers a process called the digest cycle, which updates the bindings and synchronizes the model and view.
The $watch function takes two parameters: the variable or express...
ng-repeat is a directive in AngularJS used to repeat HTML elements for each item in an array.
ng-repeat is used to create a loop in AngularJS
It is commonly used to display a list of items from an array
The directive is placed on an HTML element and uses the 'item in array' syntax
It can also be used with filters and sorting
Example:
ng-getValue is not a standard attribute in Angular. It may be a custom directive or a typo.
Check if ng-getValue is a custom directive or attribute in your Angular application
Verify if it is being used correctly in the HTML template
If it is a typo, correct it to the appropriate attribute or directive
Developing CSS without using bootstrap involves writing custom CSS code to style web pages.
Write CSS code to define styles for HTML elements
Use CSS selectors to target specific elements
Apply CSS properties to modify the appearance of elements
Create media queries for responsive design
Implement CSS animations and transitions
Optimize CSS code for performance
CDN stands for Content Delivery Network. It is a distributed network of servers that deliver web content to users based on their geographic location.
CDN improves website performance by reducing latency and increasing page load speed.
CDN caches content in multiple locations, allowing users to access it from a server closest to them.
CDN can handle high traffic loads and distribute it across multiple servers.
Popular CDN p...
To display different colors in a table using CSS for odd and even rows, you can use the :nth-child() selector.
Use the :nth-child(odd) selector to target odd rows and apply a specific color using the background-color property.
Use the :nth-child(even) selector to target even rows and apply a different color using the background-color property.
For example, you can use CSS code like this: tr:nth-child(odd) { background-c...
To develop CSS for different devices, use media queries, responsive design principles, and testing on various devices.
Use media queries to apply different CSS styles based on the device's screen size
Follow responsive design principles to ensure the layout adapts to different devices
Test the CSS on various devices to ensure compatibility and responsiveness
The $rootscope is a service in AngularJS that provides a global scope for sharing data between controllers.
It is a part of the AngularJS framework.
It is used to share data between controllers.
It is a singleton object accessible throughout the application.
It can be used to broadcast and listen to events.
jQuery is a fast, small, and feature-rich JavaScript library that simplifies HTML document traversal and manipulation, event handling, and animation.
jQuery is a JavaScript library.
It simplifies HTML document traversal and manipulation.
It provides easy event handling and animation.
jQuery is fast, small, and feature-rich.
Computer Scientist
495
salaries
| ₹35.1 L/yr - ₹62 L/yr |
Technical Consultant
306
salaries
| ₹13 L/yr - ₹24.4 L/yr |
Computer Scientist 2
303
salaries
| ₹47.1 L/yr - ₹80 L/yr |
Software Engineer
289
salaries
| ₹14.2 L/yr - ₹25.1 L/yr |
Senior Software Engineer
244
salaries
| ₹22.1 L/yr - ₹39.6 L/yr |
Salesforce
Oracle
Microsoft Corporation
Amazon