Filter interviews by
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions based on DSA, OOPS and puzzles.
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes until the end of the list is reached
Ninja is exploring new challenges and desires to reverse a given number. Your task is to assist Ninja in reversing the number provided.
If a number has trailing ze...
Implement a function to reverse a given number, omitting trailing zeros.
Create a function that takes an integer as input and reverses it while omitting trailing zeros
Use modulo and division operations to extract digits and reverse the number
Handle cases where the reversed number has leading zeros by omitting them
Ensure the reversed number is within the constraints specified
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
Reverse a given string containing alphabets, numbers, and special characters.
Iterate through the string from end to start and append each character to a new string.
Use built-in functions like reverse() or slicing to reverse the string.
Handle special characters and numbers while reversing the string.
Ensure to consider the constraints provided in the problem statement.
Overloading in OOP is the ability to define multiple methods with the same name but different parameters.
Overloading allows multiple methods with the same name but different parameters to coexist in a class.
The compiler determines which method to call based on the number and type of arguments passed.
Example: having multiple constructors in a class with different parameter lists.
Round duration - 60 minutes
Round difficulty - Medium
Technical round with question based on Web Dev, Cloud Computing, Networking etc.
TELNET is a network protocol used to establish a connection with a remote computer over a network.
TELNET stands for Telecommunication Network.
It allows a user to log in to a remote computer and execute commands as if they were directly connected to that computer.
TELNET operates on port 23.
It is not secure as the data is transmitted in plain text.
SSH (Secure Shell) is a more secure alternative to TELNET.
TELNET is insecure, while SSH is secure for remote access to servers.
TELNET sends data in plain text, while SSH encrypts data for secure communication
SSH uses public-key cryptography for authentication, TELNET does not
SSH provides secure remote access to servers, TELNET does not prioritize security
TELNET operates on port 23, while SSH operates on port 22
Given an array/list ARR
consisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.
The input sta...
Sort an array of 0s, 1s, and 2s in increasing order.
Use a three-pointer approach to partition the array into sections of 0s, 1s, and 2s.
Iterate through the array and swap elements based on their values.
Time complexity should be O(n) to meet the constraints.
A hypervisor is a software that creates and runs virtual machines on a physical host machine.
Hypervisors allow multiple operating systems to run on a single physical machine
They provide isolation between virtual machines
Examples include VMware ESXi, Microsoft Hyper-V, and KVM
Cloud computing is like renting a computer over the internet instead of owning one.
Cloud computing allows users to access and store data and applications over the internet instead of on their own physical computer.
It offers scalability, flexibility, and cost-effectiveness as users can easily adjust their storage and computing needs.
Examples include services like Amazon Web Services (AWS), Microsoft Azure, and Google Cl
The stages in the Software Development Life Cycle include planning, design, development, testing, deployment, and maintenance.
1. Planning: Define project scope, requirements, and timelines.
2. Design: Create architecture, UI/UX, and database design.
3. Development: Write code based on design specifications.
4. Testing: Verify functionality, performance, and security.
5. Deployment: Release the software to users or clients.
...
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions based on DSA and OOPS. A detailed discussion on my projects was also carried out.
Given three sorted arrays A
, B
, and C
of lengths N
, M
, and K
respectively, your task is to find all elements that are present in all three arrays.
The first...
Find common elements in three sorted arrays and output them in order.
Iterate through all three arrays simultaneously using three pointers.
Compare elements at pointers and move pointers accordingly.
If elements are equal, add to result and move all pointers forward.
If elements are not equal, move pointer of smallest element forward.
A volatile variable is a variable that can be modified by multiple threads simultaneously.
Volatile variables are used in multithreading to ensure visibility of changes made by one thread to other threads.
They are not cached in thread's local memory, but always read from main memory.
They are typically used for flags or status variables that are accessed by multiple threads.
Example: 'volatile boolean flag = true;'
Multithreading in Java allows multiple threads to execute concurrently, improving performance and responsiveness.
Multithreading allows multiple threads to run concurrently within a single process.
Threads share the same memory space, allowing for efficient communication and data sharing.
Java provides built-in support for multithreading through the Thread class and Runnable interface.
Example: Creating a new thread using ...
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
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.
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
Need to write working code on a shared document so that the interviewer can see if you can put your ideas into code. In this round, they are not bothered about time complexity of your algorithm. They just wanted to know if you can code whatever you think. So if you do not find best solution also it is OK but write the code for average case at-least.
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q
queries. Each query is represented by an integer Q[i]
, and you must ...
Search for integers in a rotated sorted array efficiently.
Use binary search to find the pivot point where the array is rotated.
Based on the pivot point, apply binary search on the appropriate half of the array.
Return the index of the integer if found, else return -1.
Time complexity should be O(logN) for each query.
Given a Binary Search Tree (BST) and a target value 'K', determine if there exist two unique elements in the BST such that their sum equals the target 'K'.
A ...
Check if there exist two unique elements in a BST that sum up to a target value 'K'.
Traverse the BST in-order to get a sorted array of elements.
Use two pointers approach to find the pair sum in the sorted array.
Consider edge cases like duplicate elements or negative values.
Time complexity can be optimized to O(n) using a HashSet to store visited nodes.
Round duration - 60 minutes
Round difficulty - Medium
I was interviewed for vcloud team so they asked me questions on Cloud, DSA etc.
You are provided with a linked list having 'N' nodes and an integer 'K'. Your task is to reverse the linked list in groups of size K. If the list is numbered fro...
Reverse a linked list in groups of size K
Iterate through the linked list in groups of size K
Reverse each group of nodes
Handle cases where the last group may have fewer than K nodes
Reverse a given stack of integers using recursion. You must accomplish this without utilizing extra space beyond the internal stack space used by recursion. Additionally, you ...
Reverse a given stack of integers using recursion without using extra space or loops.
Use recursion to pop all elements from the original stack and store them in function call stack
Once the stack is empty, push the elements back in reverse order using recursion
Use the top(), pop(), and push() methods to manipulate the stack
Cloud computing is the delivery of computing services over the internet, including storage, databases, networking, software, and more.
Cloud computing allows users to access resources on-demand without the need for physical infrastructure.
Examples of cloud computing services include Amazon Web Services (AWS), Microsoft Azure, and Google Cloud Platform.
Cloud computing offers scalability, flexibility, cost-effectiveness, ...
Cloud computing offers scalability, cost-efficiency, flexibility, and improved collaboration.
Scalability: Easily scale resources up or down based on demand without the need for physical infrastructure.
Cost-efficiency: Pay only for the resources you use, reducing upfront costs and maintenance expenses.
Flexibility: Access data and applications from anywhere with an internet connection, enabling remote work and collaborat...
Challenges of cloud computing include security concerns, data privacy issues, and potential downtime.
Security concerns: Data breaches and unauthorized access are major risks in cloud computing.
Data privacy issues: Ensuring compliance with regulations like GDPR can be challenging when data is stored in the cloud.
Potential downtime: Dependence on internet connectivity and cloud service providers can lead to downtime affe...
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.
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions based on DSA.
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
Reverse a given string containing alphabets, numbers, and special characters.
Iterate through the string from the end to the beginning and append each character to a new string.
Use built-in functions like reverse() or StringBuilder in languages like Python or Java for efficient reversal.
Handle special characters and numbers along with alphabets while reversing the string.
Ensure to consider the constraints on the number ...
Given an array of integers ARR
of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...
Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.
Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.
Consider flipping a sub-array from index i to j by changing 0s to 1s and vice versa.
Update the maximum count of 1s if the current count is greater.
Return the maximum count of 1s obtained after flipping a sub-array at most once
Determine whether a given array ARR
of positive integers is a valid Preorder Traversal of a Binary Search Tree (BST).
A binary search tree (BST) is a tree structure w...
Check if a given array of positive integers is a valid Preorder Traversal of a Binary Search Tree (BST).
Create a function that takes the array as input and checks if it satisfies the properties of a BST preorder traversal.
Iterate through the array and maintain a stack to keep track of the nodes in the BST.
Compare each element with the top of the stack to ensure it follows the BST property.
If the array is a valid preord...
Given a sorted array/list ARR
consisting of ‘N’ elements, and an integer ‘K’, your task is to find the first and last occurrence of ‘K’ in ARR
.
Find the first and last occurrence of a given element in a sorted array.
Use binary search to find the first occurrence of the element.
Use binary search to find the last occurrence of the element.
Handle cases where the element is not present in the array.
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on DSA, OS, OOPS etc.
Given two arrays A
and B
with sizes N
and M
respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal or not equal to find the intersection.
Return the intersection as an array of common elements.
You are provided with a linked list consisting of N nodes. Your task is to remove duplicate nodes such that each element occurs only once in t...
Remove duplicates from an unsorted linked list while preserving the order of nodes.
Iterate through the linked list while keeping track of seen elements using a hash set.
If a duplicate element is encountered, skip it by adjusting the pointers.
Ensure the order of nodes is preserved by only keeping the first occurrence of each element.
Paging is a memory management scheme that allows the operating system to store and retrieve data from secondary storage in fixed-size blocks, while swapping involves moving entire processes between main memory and disk.
Paging involves dividing physical memory into fixed-size blocks called pages, while swapping involves moving entire processes between main memory and disk.
Paging allows for more efficient use of physical...
A deadlock in operating systems occurs when two or more processes are unable to proceed because each is waiting for the other to release a resource.
Deadlock involves a circular wait, where each process is waiting for a resource held by another process in the cycle.
Four necessary conditions for deadlock are mutual exclusion, hold and wait, no preemption, and circular wait.
Example: Process A holds Resource 1 and waits fo...
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA, OOPS and Puzzles.
In a wedding ceremony at NinjaLand, attendees are blindfolded. People from the bride’s side hold odd numbers, while people from the groom’s side hold even numbers. For...
Rearrange a linked list such that odd numbers appear before even numbers while preserving the order of appearance.
Iterate through the linked list and maintain two separate lists for odd and even numbers.
Merge the two lists while preserving the order of appearance.
Ensure to handle edge cases like empty list or list with only odd or even numbers.
Given a sorted array of length N
, your task is to construct a balanced binary search tree (BST) from the array. If multiple balanced BSTs are possible, you ca...
Construct a balanced binary search tree from a sorted array.
Create a function that recursively constructs a balanced BST from a sorted array.
Use the middle element of the array as the root of the BST.
Recursively build the left and right subtrees using the elements to the left and right of the middle element.
Ensure that the left and right subtrees are also balanced BSTs.
Return 1 if the constructed tree is correct, other
MVC focuses on separating concerns of an application into three components, while MVT is a variation used in Django framework.
MVC separates an application into Model (data), View (presentation), and Controller (logic) components.
MVT is used in Django framework where Model represents data, View represents presentation, and Template represents logic.
In MVC, the Controller handles user input and updates the Model and View...
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
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.
VMware Software interview questions for designations
Top trending discussions
Insertion sort and quicksort are sorting algorithms used to sort arrays of data.
Insertion sort: iterates through the array and inserts each element into its proper position.
Quicksort: selects a pivot element and partitions the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot.
Insertion sort is best for small arrays, while quicksort is best for large arrays.
Bot...
Merge two sorted linked lists using recursion
Create a recursive function that compares the first nodes of both lists
Set the smaller node as the head of the merged list and call the function again with the next node of the smaller list
Base case: if one list is empty, return the other list
Return the merged list
Given an integer, determine which byte is zero.
Convert the integer to a byte array using bitwise operations.
Iterate through the byte array and check for a zero value.
Return the index of the zero byte.
Consider endianness when converting to byte array.
To check endianness, create a 4-byte integer with a known value and check the byte order.
Create a 4-byte integer with a known value
Check the value of the first byte to determine endianness
If the first byte is the least significant, the machine is little endian
If the first byte is the most significant, the machine is big endian
Static objects can be used to print something before main() execution.
Static objects are initialized before main() execution
They can be used to print something before main()
Example: static int x = printf("Hello World!");
Output: Hello World! will be printed before main() execution
Static variables are allocated memory in the data segment of the program's memory space.
Static variables have a fixed memory location throughout the program's execution.
They are initialized to zero by default.
If initialized explicitly, they are stored in the data segment.
Static variables can be accessed by any function in the program.
Finding space and time complexity of a recursive function.
Space complexity is the amount of memory used by the function.
Time complexity is the amount of time taken by the function to execute.
Recursive functions have higher space complexity due to the call stack.
Time complexity can be calculated using Big O notation.
Examples of recursive functions include factorial and Fibonacci sequence.
Diamond hierarchy problem is a problem in object-oriented programming where a class inherits from multiple classes in a diamond-shaped hierarchy.
Occurs when a class inherits from two classes that share a common base class
Can lead to ambiguity in method calls and data members
Solved using virtual inheritance or by using interfaces
To determine if a point is inside a polygon, use the ray casting algorithm.
Create a line from the point to a point outside the polygon
Count the number of times the line intersects with the polygon edges
If the count is odd, the point is inside the polygon; otherwise, it is outside
The four storage classes in C are auto, register, static, and extern.
Auto: default storage class for all local variables
Register: used to define local variables that should be stored in a register instead of RAM
Static: used to define local variables that retain their value between function calls
Extern: used to declare a global variable that is defined in another file
i is stored in global data segment, j is stored in stack, k is stored in heap.
i is a global variable and is stored in the global data segment
j is a local variable and is stored in the stack
k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()
Use a hash table to store the words and check for existence in constant time.
Create a hash table with the words as keys and a boolean value as the value.
For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.
Alternatively, use a set data structure to store only the unique words and check for existence in the set.
Return all root to leaf node paths in a binary tree with row, col and value.
Traverse the binary tree recursively and keep track of the current path.
When a leaf node is reached, add the path to the result array.
Include row, col and value of each node in the path.
Use an array of strings to store the paths.
To get max value from a stack in O(1), maintain a separate stack to keep track of maximum values.
Create a separate stack to keep track of maximum values
Push the maximum value onto the stack whenever a new maximum is encountered
Pop the maximum value stack whenever the top element of the main stack is popped
Return the top element of the maximum value stack to get the maximum value in O(1)
To get max element from a queue in O(1) time complexity
Maintain a separate variable to keep track of the maximum element in the queue
Update the maximum element variable whenever a new element is added or removed from the queue
Return the maximum element variable when getMax() function is called
Find the Next Greatest Element to the right for each element in an array of strings.
Iterate through the array from right to left
Use a stack to keep track of elements
Pop elements from stack until a greater element is found
If no greater element is found, assign -1
Return the result array
To remove unnecessary parenthesis from an expression, we need to apply a set of rules to identify and eliminate them.
Identify and remove parenthesis around single variables or constants
Identify and remove parenthesis around expressions with only one operator
Identify and remove parenthesis around expressions with operators of equal precedence
Identify and remove parenthesis around expressions with operators of different ...
Find the maximum product of three integers in an array.
Sort the array in descending order.
Check the product of the first three numbers and the product of the first and last two numbers.
Return the maximum of the two products.
Find length of longest consecutive sub array forming an AP from given array of integers.
Sort the array in ascending order
Iterate through the array and find the longest consecutive sub array forming an AP
Use a variable to keep track of the length of the current consecutive sub array forming an AP
Use another variable to keep track of the length of the longest consecutive sub array forming an AP seen so far
I appeared for an interview before Jan 2021.
Round duration - 60 Minutes
Round difficulty - Medium
The interviewer asked me 2 questions related to DS/Algo in this round . Both the questions were of Easy-Medium difficulty and I was also required to code them in a production ready manner.
You are provided with a binary tree consisting of N
nodes where each node has an integer value. The task is to determine the maximum sum achievable by a...
Find the maximum sum achievable by a simple path between any two nodes in a binary tree.
Traverse the binary tree to find all possible paths and calculate their sums.
Keep track of the maximum sum encountered during traversal.
Consider paths that may include the same node twice.
Implement a recursive function to explore all possible paths.
Handle cases where nodes have negative values.
Given two arrays A
and B
with sizes N
and M
respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal, and update the intersection array.
Return the intersection array as the result.
Round duration - 50 Minutes
Round difficulty - Medium
This round had 2 questions of DS/Algo to solve under 50 minutes and one question related to Operating Systems.
You are provided with an array or list ARR
containing N
positive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.
T...
Find the Next Greater Element for each element in an array.
Iterate through the array from right to left
Use a stack to keep track of elements with no greater element to the right
Pop elements from the stack until finding a greater element or stack is empty
Given three integers X
, C
, and Y
, where X
is the first term of an arithmetic sequence with a common difference of C
, determine if Y
is part of this arithmetic sequ...
Check if a given number is part of an arithmetic sequence with a given first term and common difference.
Calculate the arithmetic sequence using the formula: nth term = X + (n-1) * C
Check if Y is equal to any term in the sequence to determine if it belongs to the sequence
Return 'True' if Y belongs to the sequence, otherwise return 'False'
Processes are instances of programs in execution, while threads are smaller units within a process that can execute independently.
A process is a program in execution, consisting of code, data, and resources.
Threads are smaller units within a process that can execute independently.
Processes have their own memory space, while threads share the same memory space within a process.
Processes are heavyweight, while threads ar...
Round duration - 50 Minutes
Round difficulty - Medium
This round had 2 questions of DSA of Easy-Medium difficulty and at the end I was asked a Puzzle to check my general problem solving ability.
Given an array/list arr
of size n
, determine the maximum product possible by taking any subset of the array/list arr
. Return the result modulo 10^9+7
since the product ...
Find the maximum product of a subset of an array modulo 10^9+7.
Iterate through the array and keep track of the maximum positive product and minimum negative product encountered so far.
Handle cases where the array contains zeros separately.
Return the maximum product modulo 10^9+7.
Given a complete binary tree with 'N' nodes, your task is to determine the 'next' node immediately to the right in level order for each node in the given tree.
...Implement a function to update 'next' pointers in a complete binary tree.
Iterate level by level using a queue
Connect nodes at each level using 'next' pointers
Handle null nodes appropriately
Ensure the tree is a complete binary tree
Round duration - 50 Minutes
Round difficulty - Medium
This round consisted of 2 questions from DSA where I was first asked to explain my approach to the interviewer with proper complexity analysis and then code the problems. The interviewer was quite friendly and also provided me some hints when I was stuck.
Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minimum element, all in O(1) time complexity witho...
Implement a stack with push, pop, top, isEmpty, and getMin operations in O(1) time complexity without using extra space.
Use two stacks - one to store the actual elements and another to store the minimum element at each level.
When pushing an element, check if it is smaller than the current minimum and update the minimum stack accordingly.
When popping an element, also pop from the minimum stack if the popped element is t...
You are given an integer array arr
of size N
. Your task is to split the array into the maximum number of subarrays such that the first and last occurre...
Given an array, split it into maximum subarrays with first and last occurrence of each element in a single subarray.
Iterate through the array and keep track of the first and last occurrence of each element.
Use a hashmap to store the indices of each element.
Split the array whenever the last occurrence of an element is found.
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.
Operating on images in parallel involves dividing the image into smaller parts and processing them simultaneously.
Divide the image into smaller parts using techniques like tiling or splitting
Use parallel processing techniques like multi-threading or GPU acceleration
Combine the processed parts to form the final image
Examples: image segmentation, object detection, image enhancement
Hardware engines support parallelism through multiple cores and threads.
Hardware engines can have multiple cores and threads to execute tasks simultaneously.
Parallelism can improve performance and efficiency in hardware-based tasks.
Examples include GPUs, FPGAs, and ASICs that have parallel processing capabilities.
Hardware parallelism can also be achieved through distributed computing and clustering.
Programming language...
Modern OSes support parallelism through multi-core processors and threading.
Modern OSes like Windows, macOS, and Linux support parallelism through multi-core processors and threading.
Parallelism can be achieved through processes or threads.
Parallelism can improve performance and efficiency of software.
Examples of parallel programming frameworks include OpenMP and MPI.
Memory protection is a feature of an operating system that prevents unauthorized access to memory locations.
Memory protection is achieved through the use of memory management units (MMUs) and virtual memory.
MMUs map virtual addresses to physical addresses and enforce access permissions.
Virtual memory allows the OS to allocate memory to processes in a way that isolates them from each other.
Examples of memory protection ...
To speed up multiplication of small integers in an array, we can use bitwise operations and parallel processing.
Use bitwise operations like shifting and ANDing to perform multiplication faster.
Divide the array into smaller chunks and perform multiplication in parallel using multi-threading or SIMD instructions.
Use lookup tables for frequently used values to avoid repeated calculations.
Use compiler optimizations like lo...
Design a data structure for excel spreadsheet
Use a 2D array to store cell values
Implement formulas using a stack
Include formatting options for cells
I appeared for an interview before Sep 2020.
Round duration - 90 mintues
Round difficulty - Easy
Timing it is around 1 pm, Environment is very friendly.
Given an array Arr
consisting of N integers, your task is to find the equilibrium index of the array.
An index is considered as an equilibrium index if the sum of elem...
Find the equilibrium index of an array where sum of elements on left equals sum of elements on right.
Iterate through the array and calculate the total sum of elements.
For each index, calculate the sum of elements on the left and right side and check for equilibrium.
Return the left-most equilibrium index found, or -1 if none exist.
Given the schedule of N meetings with their start time Start[i]
and end time End[i]
, you need to determine which meetings can be organized in a single meeting room such ...
Given N meetings with start and end times, find the maximum number of meetings that can be organized in a single room without overlap.
Sort the meetings based on end times.
Iterate through the sorted meetings and select the next meeting whose start time is greater than or equal to the end time of the previous meeting.
Return the selected meetings in the order they are organized.
Round duration - 90 mintues
Round difficulty - Hard
Timing it is around 1 pm and Environment is good .
Overloading pre and post-increment operators in OOP involves defining special member functions for the class.
Define member functions for pre-increment (++obj) and post-increment (obj++) operators in the class.
For pre-increment, return a reference to the modified object after incrementing the value.
For post-increment, return a copy of the original object before incrementing the value.
Example: class Counter { int value; ...
Given an array of integers consisting of both positive and negative numbers, find the length of the longest subarray whose sum is zero. This problem will be presented wit...
Find the length of the longest subarray with zero sum in an array of integers.
Iterate through the array and keep track of the running sum using a hashmap.
If the running sum is seen before, it means there is a subarray with zero sum.
Calculate the length of the subarray with zero sum and update the maximum length found so far.
Tip 1 : Practice Atleast 500 Questions
Tip 2 : Do atleast 1 good projects
Tip 3 : You should be able to explain your project
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
based on 1 interview
Interview experience
based on 6 reviews
Rating in categories
Member Technical Staff
540
salaries
| ₹12 L/yr - ₹45.7 L/yr |
Senior Member of Technical Staff
511
salaries
| ₹24 L/yr - ₹72.6 L/yr |
Technical Support Engineer
390
salaries
| ₹7.2 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