Filter interviews by
15 -aptitude MCQs
5 -AWS MCQs
5-SQL MCQs
4-SQL queries
pen paper based
We need to excel in both the MCQ test and the group discussion (cumulative assessment). They provided one minute to contemplate the topic and allotted ten minutes for discussion.
I appeared for an interview in Jan 2025.
HashMap and HashSet use hashing for fast retrieval, ArrayList uses dynamic array, LinkedList uses linked nodes. StringBuilder is non-synchronized for performance. Synchronized blocks can be used to manage bank account balance.
HashMap uses key-value pairs and hashing for fast retrieval, while HashSet uses hashing for unique elements.
ArrayList uses dynamic array for fast random access, while LinkedList uses linked nodes ...
Iterate through the string and store the count of each character, then find the first character with count 1.
Create a hash map to store the count of each character in the string.
Iterate through the string and update the count in the hash map.
Iterate through the string again and return the first character with count 1.
I appeared for an interview in Aug 2024.
Asking two basic programming questions:
Q1: How can I remove duplicates from the array [1, 1, 10, 9, 7, 9, 3, 4, 5]?
I chose Exterro for its reputation in providing comprehensive e-discovery and information governance solutions.
Exterro offers e-discovery software for legal teams to manage electronic data during litigation.
Exterro also provides information governance solutions to help organizations manage and protect their data.
Some of the products offered by Exterro include Fusion Platform, Legal Hold, and Data Retention.
Reversing an array without using extra swap variables.
Use two pointers, one starting from the beginning of the array and the other from the end.
Swap the elements at the two pointers and move them towards the center until they meet.
Repeat the process until all elements have been reversed.
Use the splice method to insert values into an array at a specified index without altering existing values.
Use the splice method to insert values into the array at the specified index.
Provide the index where you want to insert the new values, followed by 0 (to indicate no deletion), and then the values to be inserted.
Example: arr.splice(1, 0, 10, 12) will insert 10 and 12 at index 1 in the array.
I applied via Approached by Company and was interviewed in Apr 2024. There was 1 interview round.
display: None removes the element from the flow of the document, while visibility: 0 hides the element but still takes up space.
display: None removes the element from the document flow, making it invisible and not taking up any space.
visibility: 0 hides the element visually, but it still occupies space in the layout.
display: None is commonly used to hide elements completely, while visibility: 0 is used to hide elements
Hoisting is a behavior in JavaScript where variable and function declarations are moved to the top of their containing scope during the compilation phase.
Variable declarations are hoisted to the top of their scope, but not their assignments.
Function declarations are fully hoisted, meaning they can be called before they are declared.
Hoisting can lead to unexpected behavior if not understood properly.
splice is used to add or remove elements from an array, while slice is used to extract a portion of an array without modifying it.
splice modifies the original array by adding or removing elements, while slice does not modify the original array
splice returns the removed elements as a new array, while slice returns the extracted elements as a new array
splice takes in parameters for index, number of elements to remove, an...
A promise is an object representing the eventual completion or failure of an asynchronous operation.
Promises are used to handle asynchronous operations in JavaScript.
They help in avoiding callback hell and writing cleaner code.
Promises have states - pending, fulfilled, or rejected.
They can be chained using .then() method.
Example: Fetching data from an API returns a promise that resolves with the data.
Dependency is a relationship between two modules where one module depends on the other to function properly.
In software development, dependencies refer to external libraries or modules that a project relies on to work correctly.
Dependencies can be managed using package managers like npm or yarn in JavaScript projects.
Circular dependencies should be avoided as they can lead to runtime errors.
Sorting an array without using built-in JS methods
Create a custom sorting function using a sorting algorithm like bubble sort, selection sort, or insertion sort
Compare each element in the array and swap them if they are in the wrong order
Repeat the process until the array is fully sorted
Exterro interview questions for popular designations
Probability of a horse going out of a chessboard in 'n' steps.
The total number of possible moves for a horse is 8.
The probability of going out of the board depends on the position of the horse.
For example, if the horse is at a corner, the probability of going out of the board is higher.
The probability can be calculated using combinatorics and geometry.
Algorithms for manipulating arrays and strings in coding
Use sorting algorithms like quicksort and mergesort for arrays
Use string manipulation functions like substring and replace for strings
Use dynamic programming for optimizing solutions to array and string problems
Designing a large scale Ad Server
Use distributed systems for scalability
Implement caching for faster ad delivery
Ensure high availability and fault tolerance
Use real-time bidding for efficient ad placement
Implement fraud detection mechanisms
Ensure compliance with privacy regulations
Maximum sub sequence sum in an array
Use Kadane's algorithm
Initialize max_so_far and max_ending_here to 0
Iterate through the array and update max_ending_here and max_so_far
Return max_so_far
Endianness refers to the byte order of a system. It determines how multi-byte data types are stored in memory.
Little-endian systems store the least significant byte first, while big-endian systems store the most significant byte first.
Endianness can affect the way data is transmitted between systems.
To determine the endianness of a system, you can use the byte order mark (BOM) or write a test program that checks the by...
Sort an array of 0's and 1's only.
Use two pointers, one at the beginning and one at the end of the array.
Swap 0's from the beginning with 1's from the end until the pointers meet.
Alternatively, use a counting sort algorithm to count the number of 0's and 1's and then reconstruct the array.
Heaps are data structures used to efficiently find the maximum or minimum element in a collection.
Max heap: parent nodes are always greater than or equal to child nodes
Min heap: parent nodes are always smaller than or equal to child nodes
Heaps are commonly used in priority queues and sorting algorithms
Heap operations include insert, delete, and extract max/min
Example: An array [3, 8, 2, 5, 1, 4, 6] can be represented a
Find 3 numbers in an array where a+b=c.
Loop through the array and check for all possible combinations of a and b.
Use a hash table to store the values of a and b, and check if c is present in the hash table.
Sort the array and use two pointers to find a and b, and then check if their sum equals c.
I applied via Campus Placement
I am an avid traveler and have visited over 20 countries
I love experiencing new cultures and trying new foods
I have backpacked through Europe and Asia
I have volunteered in orphanages in Cambodia and Nepal
Mobile advertising platform
Adtech
Mobile marketing
App monetization
posted on 22 Mar 2021
I applied via Naukri.com and was interviewed in Sep 2020. There were 4 interview rounds.
I appeared for an interview before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Easy
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
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.
Round duration - 60 Minutes
Round difficulty - Easy
System Design Round
Design a scalable system for Twitter with key components and architecture.
Use microservices architecture for scalability and fault isolation.
Key components include user service, tweet service, timeline service, and notification service.
Use a distributed database like Cassandra for storing tweets and user data.
Implement a message queue like Kafka for handling real-time updates and notifications.
Use a caching layer like ...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality
Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.
Tip 1 : Mention what you know
Tip 2 : Good previous work to showcase
Some of the top questions asked at the Exterro interview -
based on 4 interviews
Interview experience
Associate Software Engineer
16
salaries
| ₹3.5 L/yr - ₹7.5 L/yr |
Software Developer
11
salaries
| ₹4.5 L/yr - ₹7.6 L/yr |
Software Engineer
9
salaries
| ₹5.4 L/yr - ₹11.5 L/yr |
Quality Analyst
9
salaries
| ₹3 L/yr - ₹8.5 L/yr |
Senior Associate Software Engineer
7
salaries
| ₹4.7 L/yr - ₹8.3 L/yr |
Zyro
Druva
Freshworks
Chargebee