Filter interviews by
I applied via Company Website and was interviewed in Oct 2023. There were 2 interview rounds.
I applied via Referral and was interviewed before May 2023. There were 3 interview rounds.
1 hour coding interview where medium level DSA problems were asked.
1 hour interview. 1 coding question and some questions related to cloud were asked.
I applied via LinkedIn and was interviewed before Oct 2022. There were 3 interview rounds.
Oracle RDBMS concepts, core java, data structures
VMware Software interview questions for designations
I applied via Recruitment Consulltant and was interviewed in Nov 2021. There were 5 interview rounds.
Basic Coding questions around LRU Cache and Top View Tree Traversal
Multi threading and Internal Working of Hash Map!
Get interview-ready with Top VMware Software Interview Questions
I appeared for an interview in Nov 2020.
Round duration - 90 Minutes
Round difficulty - Medium
The round was audio and video proctored, since it was virtual.
It lasted for 90 minutes.
The questions was of medium level.
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
You are given a number in string format, a...
Find the next smallest palindrome greater than a given number represented as a string.
Iterate from the middle of the number and mirror the left side to the right side to create a palindrome
If the resulting palindrome is greater than the input number, return it
Handle cases where the number has all 9s and requires a carry over to the left side
Round duration - 60 Minutes
Round difficulty - Easy
It was Technical round of 60 minutes,
the interviewer was very nice person.
Given two strings 'STR1' and 'STR2', determine if they are anagrams of each other.
Two strings are considered to be anagrams if they contain the same cha...
Check if two strings are anagrams of each other by comparing their characters.
Create a character frequency map for both strings and compare them.
Sort both strings and compare if they are equal.
Use a hash set to store characters from one string and remove them while iterating through the other string.
Check if the character counts of both strings are equal.
Example: For input 'listen' and 'silent', the output should be tr
Use a stack data structure for implementing undo and redo operations.
Stack data structure is ideal for implementing undo and redo operations as it follows Last In First Out (LIFO) principle.
Push the state of the system onto the stack when an action is performed, allowing for easy undo by popping the top element.
Redo operation can be implemented by keeping a separate stack for redo actions.
Example: In a text editor, eac...
Round duration - 60 Minutes
Round difficulty - Medium
It was a resume based Interview round technical - 2
the interviewer was helping and humble.
Yes, I can design the bank architecture using basic OOP concepts in any programming language.
Create classes for entities like Bank, Account, Customer, Transaction, etc.
Use inheritance to model relationships between entities (e.g. SavingsAccount and CheckingAccount inheriting from Account).
Implement encapsulation to hide internal details of classes and provide public interfaces for interaction.
Utilize polymorphism to al...
Round duration - 15 Minutes
Round difficulty - Easy
It was the easiest round.
And it was supposed to be the same.
It was an HR round.
Tip 1 : Practice the DSA sheet of 180 commonly asked questions by striver.
Tip 2 : Do Competitive coding regularly, try to be consistent in short contests.
Tip 3 : Revise the core subjects basics regularly.
Tip 1 : Resume must be concise and to the point.
Tip 2 : Never add any fake skill in your resume, because they can ask anything from your skills.
I applied via LinkedIn and was interviewed before Sep 2021. There were 2 interview rounds.
I applied via LinkedIn and was interviewed in Jul 2020. There were 4 interview rounds.
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
Th interviewer asked me questions related to various topics of OS, Data Structures and Algorithm.
Tips: Have a strong hold on topics of OS like segmentation and buddy systems.
Segmentation is the process of dividing a larger entity into smaller parts or segments.
Segmentation is commonly used in image processing to separate objects of interest from the background.
It is also used in marketing to divide a target market into smaller groups based on demographics, behavior, or other factors.
In networking, segmentation refers to dividing a network into smaller subnetworks to improve performance and
The buddy system has advantages like increased safety and support, but also drawbacks like dependency and lack of independence.
Advantages: increased safety, support, accountability, motivation
Disadvantages: dependency, lack of independence, potential for conflicts
Example: In a buddy system at work, colleagues can support each other in completing tasks and provide motivation to stay on track.
Example: However, relying to...
A page fault occurs when a program tries to access a page of memory that is not currently in physical RAM.
Occurs when a program tries to access a page of memory not in physical RAM
Results in the operating system needing to retrieve the page from disk
Can lead to a temporary pause in program execution
Round duration - 60 minutes
Round difficulty - Easy
The round consisted of questions of heap, Towers of hanoi and other questions related to CV.
Tips: Time complexity analysis of Towers of Hanoi Problem is important. Good skillset in DS and Algorithms, Bit Manipulation.
You have three rods numbered from 1 to 3, and 'N' disks initially stacked on the first rod in increasing order of their sizes (largest disk at the bottom). Your task is to...
Tower of Hanoi problem where 'N' disks need to be moved to another rod following specific rules in less than 2^N moves.
Implement a recursive function to move disks from one rod to another following the rules.
Use the concept of recursion and backtracking to solve the Tower of Hanoi problem efficiently.
Maintain a count of moves and track the movement of disks in a 2-D array/list.
Ensure that larger disks are not placed on...
Given an array 'ARR' of integers with 'N' elements, you need to convert it into a min-binary heap.
A min-binary heap is a complete binary tree where each internal node's va...
Convert the given array into a min-binary heap by modifying the array elements.
Iterate through the array and heapify each node starting from the last non-leaf node to the root node.
For each node, compare it with its children and swap if necessary to satisfy the min-heap property.
Continue this process until the entire array is converted into a min-heap.
Round duration - 30 minutes
Round difficulty - Easy
The HR asked about my hobbies, extra curricular activities and checked my personality.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Top trending discussions
To find and remove a loop in a Linked List, we can use Floyd's Cycle Detection Algorithm.
Use two pointers, slow and fast, to detect if there is a loop in the Linked List
If the two pointers meet at some point, there is a loop
To remove the loop, set one of the pointers to the head of the Linked List and move both pointers one step at a time until they meet again
The meeting point is the start of the loop, set the next poi
Find the maximum window size to sort an unsorted array.
Identify the longest decreasing subarray from the beginning and longest increasing subarray from the end
Find the minimum and maximum element in the identified subarrays
Expand the identified subarrays until all elements in the array are covered
The length of the expanded subarray is the maximum window size
Finding the longest last occurring word in a sentence with multiple whitespace.
Split the sentence into words using whitespace as delimiter
Reverse the list of words
Iterate through the list and find the first occurrence of each word
Calculate the length of each last occurring word
Return the longest last occurring word
Merge sort and Quick sort are sorting algorithms used to sort arrays of data.
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half recursively, and then merges the sorted halves.
Quick sort is also a divide and conquer algorithm that selects a pivot element and partitions the array around the pivot, sorting the two resulting sub-arrays recursively.
Merge sort has a tim...
Process is an instance of a program while thread is a subset of a process that can run concurrently with other threads.
A process is a program in execution
A process can have multiple threads
Threads share the same memory space as the process
Threads can run concurrently with other threads within the same process
Examples of processes include web browsers, word processors, and media players
Examples of threads include GUI th
A recursive function calls itself until a base case is reached, then returns the result to the previous call.
Each call creates a new instance of the function on the call stack
The function continues to call itself until a base case is reached
Once the base case is reached, the function returns the result to the previous call
The previous call then continues executing from where it left off
Code to find number of combinations of reaching step N by ball falling from staircase with 1 or 2 steps per jump.
Use dynamic programming to solve the problem
Create an array to store the number of ways to reach each step
Initialize the array with base cases for steps 0, 1, and 2
Use a loop to fill in the array for steps 3 to N
The number of ways to reach step i is the sum of the number of ways to reach step i-1 and i-2
Retu
Priority queue is a data structure that stores elements with priority levels and retrieves them in order of priority.
Priority queue is implemented using a heap data structure.
Stack can be implemented using a priority queue by assigning higher priority to the most recently added element.
Queue can be implemented using a priority queue by assigning higher priority to the oldest element.
Implementing stack using queue involves using two queues to simulate stack behavior.
Create two queues, q1 and q2.
Push operation: Enqueue the element to q1.
Pop operation: Dequeue all elements from q1 to q2 except the last element. Dequeue and return the last element.
Swap the names of q1 and q2 after each pop operation.
Top operation: Return the last element of q1 without dequeuing it.
isEmpty operation: Check if both q1 a
I lost my job during the pandemic and struggled to find a new one
Applied to multiple job openings daily
Networked with former colleagues and industry professionals
Took online courses to improve skills
Maintained a positive attitude and stayed motivated
Eventually landed a new job in a different industry
I would have pursued a career in music or writing.
I have always had a passion for music and writing.
I have played multiple instruments since childhood.
I have written and published short stories and poetry.
I believe creativity is an important aspect of any profession.
I value my relationships with loved ones the most.
Spending quality time with family and friends
Making an effort to stay in touch with long-distance loved ones
Prioritizing important events and milestones in their lives
Being there for them during difficult times
Forgiving and working through conflicts to maintain strong bonds
based on 6 interviews
2 Interview rounds
based on 43 reviews
Rating in categories
Member Technical Staff
536
salaries
| ₹12 L/yr - ₹45 L/yr |
Senior Member of Technical Staff
512
salaries
| ₹25 L/yr - ₹72.8 L/yr |
Technical Support Engineer
391
salaries
| ₹7.4 L/yr - ₹19 L/yr |
Technical Staff Member 3
248
salaries
| ₹17 L/yr - ₹54.1 L/yr |
Business Analyst
231
salaries
| ₹4.8 L/yr - ₹19 L/yr |
Oracle
Amdocs
Automatic Data Processing (ADP)
24/7 Customer