Filter interviews by
I appeared for an interview before Sep 2020.
Round duration - 120 minutes
Round difficulty - Easy
Type of Questions No. of Questions
Quantitative 20
Logical and Reasoning 20
Verbal 20
Section II: Coding Section
Number of Questions: 2
Time Duration: 60 min
Level of Difficulty: Easy-Medium
Type of Questions: String Manipulation and Tree based Question
Given a binary tree, your task is to convert it into its mirror tree.
A binary tree is a data structure where each parent node has at most two children.
The mirror ...
Convert a binary tree into its mirror tree by interchanging left and right children of non-leaf nodes.
Traverse the binary tree in a recursive manner.
Swap the left and right children of each non-leaf node.
Continue this process until all nodes are visited.
Output the inorder traversal of the mirror tree.
Given a string ‘str’, calculate the minimum number of partitions required to ensure every resulting substring is a palindrome.
The first line contains a...
The problem involves calculating the minimum number of partitions needed to ensure every resulting substring is a palindrome.
Iterate through the string and check for palindromes at each possible partition point.
Keep track of the minimum cuts needed to partition the string into palindromic substrings.
Consider edge cases such as when the string is already a palindrome or when all characters are unique.
Example: For input ...
Round duration - 30 minutes
Round difficulty - Medium
It was a non eliminatory round comprising of 3 sections with a total time of 30 minutes.
Section I: Technical MCQ’s
Number of Questions: 20
Level of Difficulty: Medium -High
Programming Output questions and questions from CN, DBMS, OS and DS were asked.
Section II: Aptitude and Logical Section
Number of Questions: 10
Level of Difficulty: Easy
Section III: Coding Section
Number of Questions: 2
Level of Difficulty: Easy-Medium
You are given a sequence of numbers. Your task is to find all leaders in this sequence. A leader is defined as an element that is strictly greater than all the elemen...
Find all leaders in a sequence - elements greater than all elements to their right.
Iterate from right to left, keep track of maximum element encountered so far
If current element is greater than maximum, it is a leader
Return the leaders in the same order as the input sequence
You are provided with a two-dimensional array named MATRIX
of size N x M, consisting of integers. Your task is to return the elements of the matrix following a spiral order.
Implement a function to return elements of a matrix in spiral order.
Iterate through the matrix in a spiral order by adjusting the boundaries of rows and columns.
Keep track of the direction of traversal (right, down, left, up) to properly move through the matrix.
Handle edge cases such as when the matrix is empty or has only one row or column.
Round duration - 80 minutes
Round difficulty - Medium
The interview went for about 75-80 minutes. I was not able to answer almost all the answers
correctly but gave almost 75% correct answers. The interviewer mainly focused on the problem
solving ability and the quality of conceptual knowledge.
1: Basic Introductory Questions
2: 2-3 Puzzle Questions
3: Some basic Questions on DSA- about stacks, queue, arrays, memory storage accessing,
Advantages and Dis of Linked list over arrays,
4: Operating System: In all the rounds , Operating System questions were asked in abundance.
Though the questions were basic, they focused more on our concepts like how easily we were
able to explain it to them.
Questions on Kernels, Types of Kernel, Why OS, memory allocation in OS were asked.
5: Test Cases Question: We have to think and answer the possible questions while testing the
cases.
i: Test cases for a login page window.
6: Heavy discussions on the projects I have done. Why we preferred to use a particular
technology. What was my role in the project and so on.
7: I was asked to code some questions.
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
ARR = [2,...
Find the second largest element in an array of integers.
Iterate through the array to find the largest and second largest elements.
Handle cases where all elements are identical.
Return -1 if a second largest element does not exist.
Determine if a given Singly Linked List of integers forms a cycle.
A cycle exists in a linked list if a node's next pointer points back to a previous node, ...
Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.
Traverse the linked list using two pointers, one moving at double the speed of the other.
If the two pointers meet at any point, there is a cycle in the linked list.
Use Floyd's Cycle Detection Algorithm for efficient detection.
Example: Input: 3 2 0 -4 -1, 1 Output: true
Round duration - 90 minutes
Round difficulty - Hard
This round of interview was took by a senior person of the company. It was a bit lengthy as we
had more of a discussion rather than just a QnA round. The interview went for more than 90
minutes and was tougher than the first round.
1: There was a long discussion on what I written in my resume. The projects I had done,
Extracurricular and co-curricular activities I had written on the resume, the skills I have
mentioned. All of it. So be careful of whatever you mention in the resume.
2: Next he asked me a bunch of coding questions which were some very popular ones
I was asked to code in my preferred language. So there wasn’t any language barrier and for all the
questions the interviewer asked for the most optimized approach.
As I was able to answer all the questions, I wasn’t asked any more questions.
3: After the coding questions, I was asked a lot of questions of Operation System and OOPS.
i: Fragmentation- Internal and External
ii: Concepts of Kernel
iii: File Management
iv: Virtual functions and Friend Functions
v: Function Overloading And Overriding
vi: What is paging and Demand Paging?
4: Interview puzzles:
5: Testing Based Questions-
i: Five new inventions in a glass frame and the test cases to test the working a frame.
ii: Design test cases for a shopping application.
The interviewer was quite satisfied with the test cases I answered. As the main trick to solve
these kind of interview questions is to design the test cases with giving every small function an
eye and then forming all possible scenarios for the same
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...
Check if two strings are anagrams of each other by comparing the sorted characters.
Sort the characters of both strings and compare them.
Use a dictionary to count the occurrences of characters in each string.
Ensure both strings have the same length before proceeding.
Handle edge cases like empty strings or strings with different lengths.
Example: str1 = 'listen', str2 = 'silent' should return True.
You are given an encrypted string where repeated substrings are represented by the substring followed by its count. Your task is to find the K'th character of the d...
Given an encrypted string with repeated substrings represented by counts, find the K'th character of the decrypted string.
Parse the encrypted string to extract substrings and their counts
Iterate through the decrypted string to find the K'th character
Handle cases where counts are more than one digit or in parts
Implement a queue data structure which adheres to the FIFO (First In First Out) principle, utilizing only stack data structures.
Complete predefined fun...
Implement a queue using only stack data structures, supporting FIFO principle.
Use two stacks to simulate a queue: one for enqueueing and one for dequeueing.
For enQueue operation, push elements onto the enqueue stack.
For deQueue operation, if dequeue stack is empty, transfer elements from enqueue stack.
For peek operation, return top element of dequeue stack.
For isEmpty operation, check if both stacks are empty.
Develop a Stack Data Structure to store integer values using two Queues internally.
Your stack implementation should provide these public functions:
Implement a stack using two queues to store integer values with specified functions.
Create a stack class with two queue data members.
Implement push, pop, top, size, and isEmpty functions.
Ensure proper handling of edge cases like empty stack.
Use queue operations like enqueue and dequeue to simulate stack behavior.
Maintain the size of the stack and check for emptiness.
Example: Push 42, pop to get 42, push 17, top to get
Round duration - 70 minutes
Round difficulty - Easy
This was also similar to the last two Technical Interviews and was also easier from them. The
interview went for about 70 minutes and it was tilted more towards managerial side and less
technical questions were asked.
1. Program to Count set nits in an integer. (I answered 4 possible solutions to him and he was
satisfied)
2: Working of Bubble Sort and Insertion Sort ( I was asked to dry run the solution mainly to
check the internal working of swapping and comparison)
3: Some Mathematical Puzzles
4: Design test cases for OLA Application
5: Design test cases for GMAIL Application
6: Situation based questions
Round duration - 15 minutes
Round difficulty - Easy
It was the last round and an eliminatory round as well. It was a 15 minutes long discussion round
about college life, interests, and hobbies. The HR also asked our preferred joining location
between Noida and Bangalore which gave us many hopes of our selection.
Three candidates from our college went till the HR Round.
Tip 1 : Have strong knowledge of the basic concepts of DS and Programming
Tip 2 : Be Confident and have faith in yourself
Tip 3 : Have a Strong Balanced Resume
Tip 1 : Good Projects
Tip 2 : Maintain a good balance in all the sections of the resume
I applied via Referral
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.
posted on 2 Dec 2016
I applied via Campus Placement and was interviewed in Dec 2016. There was 1 interview round.
Check if left child is less than right child in a binary tree
Traverse the tree recursively and compare left and right child values
Use a stack to traverse the tree iteratively and compare left and right child values
Return true if all left children are less than right children, else false
Use built-in string method to check substring presence for faster execution.
Use 'indexOf' method to check if substring is present in the main string.
If the method returns -1, the substring is not present.
If the method returns a non-negative integer, the substring is present.
posted on 2 Dec 2016
I applied via Campus Placement and was interviewed in Dec 2016. There were 6 interview rounds.
App performance analysis involves identifying and resolving bottlenecks to improve user experience.
Collect and analyze performance metrics such as response time, CPU usage, memory usage, and network latency.
Identify and prioritize bottlenecks based on impact on user experience and frequency of occurrence.
Implement optimizations such as caching, code refactoring, and database tuning.
Continuously monitor and test perform...
posted on 2 Dec 2016
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
posted on 2 Dec 2016
I applied via Campus Placement and was interviewed in Jan 2016. There were 5 interview rounds.
To find a loop in a directed graph, use Floyd's cycle-finding algorithm. To find the last element in a binary tree, traverse the tree and return the rightmost leaf node.
For finding a loop in a directed graph, use Floyd's cycle-finding algorithm which uses two pointers moving at different speeds.
To find the last element in a binary tree, traverse the tree recursively or iteratively and return the rightmost leaf node.
The question is about finding the last number in a circular queue that has the highest number of digits.
Implement a circular queue data structure
Iterate through the circular queue to find the last number with the highest number of digits
Compare the number of digits of each number in the circular queue
Keep track of the last number with the highest number of digits
posted on 15 Nov 2015
I applied via Campus Placement
Print all downward paths from any node in a binary tree with sum of elements equal to N.
Traverse the binary tree and keep track of the sum of elements in the path from root to current node.
If the sum equals N, print the path from root to current node.
Recursively traverse the left and right subtrees with updated sum.
Use a stack to keep track of the current path being traversed.
Example: Binary tree with root 1, left chil...
Yes, it is possible to get the accurate result from the given data.
The coordinates (i,j,k) where metallic balls are present can be determined by finding the set elements in both matrix1 and matrix2.
Additional data is not required as the given data is sufficient to determine the coordinates.
The coordinates can be obtained by iterating through the elements of matrix1 and matrix2 and checking for set elements.
posted on 23 Aug 2015
I applied via Campus Placement
To find n-k th element from last in a string of unknown length
Traverse the string to find its length
Calculate the position of n-k th element from last
Traverse the string again to find the element at calculated position
Count the number of unique occurrences in an array of strings.
Create a hash table to store the count of each string occurrence.
Iterate through the array and update the count in the hash table.
Count the number of unique occurrences by counting the number of keys in the hash table.
based on 3 reviews
Rating in categories
Computer Scientist
452
salaries
| ₹20 L/yr - ₹70 L/yr |
Technical Consultant
284
salaries
| ₹13.8 L/yr - ₹30 L/yr |
Computer Scientist 2
260
salaries
| ₹29.4 L/yr - ₹101 L/yr |
Software Engineer
257
salaries
| ₹8 L/yr - ₹30 L/yr |
Senior Software Engineer
210
salaries
| ₹10 L/yr - ₹33.8 L/yr |
Salesforce
Oracle
Microsoft Corporation
Amazon