Filter interviews by
I appeared for an interview in Sep 2023.
I applied via Campus Placement and was interviewed in Sep 2023. There were 3 interview rounds.
I applied via Newspaper Ad and was interviewed in Aug 2023. There were 2 interview rounds.
I appeared for an interview in Mar 2021.
Round duration - 110 minutes
Round difficulty - Medium
There were MCQs related to Aptitude, OS, DBMS, Coding Outputs, and Networks. And There were also 2 Coding Questions in the last.
Given an undirected and disconnected graph G(V, E)
, where V
is the number of vertices and E
is the number of edges, the connections between vertices are provided in the 'GR...
DFS traversal to find connected components in an undirected and disconnected graph.
Use Depth First Search (DFS) to traverse the graph and find connected components.
Maintain a visited array to keep track of visited vertices.
For each unvisited vertex, perform DFS to explore the connected component it belongs to.
Print the vertices of each connected component in ascending order.
Repeat the process until all vertices are vis...
Round duration - 120 minutes
Round difficulty - Medium
It was a coding round. We have to solve the 3 coding questions in 120 minutes.
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
Iterate through the array and calculate the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water at each bar to get the total trapped water for the entire array.
Round duration - 45 minutes
Round difficulty - Medium
This round was only to test my technical knowledge of various Core CSE Subjects, and along with this, projects from my CV discussed as well.
A thread is a lightweight process within a process, sharing memory and resources, while a process is a standalone program with its own memory space.
Threads share memory and resources within the same process, while processes have their own memory space.
Threads are lightweight compared to processes, as they require less overhead to create and manage.
Processes are independent of each other, while threads within the same p...
Passwords are typically stored in a DBMS using encryption techniques to ensure security.
Passwords are often hashed using algorithms like SHA-256 before being stored in the database.
Salt is commonly added to passwords before hashing to prevent rainbow table attacks.
Some DBMS also support encryption at rest to further secure stored passwords.
Access controls and proper user authentication mechanisms are crucial to protect...
Round duration - 45 minutes
Round difficulty - Medium
This round was basically to judge my Soft Skills like how I speak, and how well are my communication skills.
Tip 1 : Try to cover basic knowledge of graphs and DP, as they can be the favorite topic of the company during coding and interview rounds.
Tip 2 : Be well prepared with your CV, because you are going to be asked everything from your CV itself, so be truthful with your CV as well.
Tip 3 : Try to gain a good knowledge of OOPS, and DBMS, as it shows your development skills to the company
Tip 1 : Your Resume should have at least 2-3 good projects and you should have proper knowledge of all the projects you will be putting into it.
Tip 2 : Your Resume should be of 1 page, and should be well maintained with sections like Education, Skills, Positions Of Responsibility (If Any), Languages, Skills, Projects, Achievements, Certifications.
Optmyzr interview questions for popular designations
Top trending discussions
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
The program capitalizes the first letter of each reversed word in a sentence.
Split the sentence into an array of words using space as a delimiter.
Reverse each word in the array and capitalize the first letter.
Join the modified words back into a sentence.
I applied via Naukri.com and was interviewed in Oct 2019. There were 3 interview rounds.
based on 2 interviews
Interview experience
Program Manager
4
salaries
| ₹18 L/yr - ₹18 L/yr |
Software Development Engineer
4
salaries
| ₹11 L/yr - ₹32 L/yr |
Accounts Manager
4
salaries
| ₹10.3 L/yr - ₹19 L/yr |
Senior UX Designer
4
salaries
| ₹14 L/yr - ₹14 L/yr |
Sde1
4
salaries
| ₹28 L/yr - ₹40.8 L/yr |
Marin Software
R.R. Donnelley
Denave
Smollan Group