Filter interviews by
Clear (1)
I was interviewed in Jan 2022.
Round duration - 90 minutes
Round difficulty - Medium
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
The task is to determine if a given singly linked list forms a cycle or not.
A cycle occurs when a node's next points back to a previous node in the list.
To solve this problem, we can use the Floyd's Cycle-Finding Algorithm.
The algorithm uses two pointers, one moving at a normal pace and the other moving twice as fast.
If there is a cycle, the fast pointer will eventually catch up to the slow pointer.
If the fast pointer ...
Round duration - 60 minutes
Round difficulty - Medium
Determine the minimum depth of an integer-based binary tree. The minimum depth is defined as the number of nodes present along the shortest path from the root node down to t...
The minimum depth of a binary tree is the number of nodes along the shortest path from the root node down to the nearest leaf node.
The minimum depth can be found by performing a breadth-first search (BFS) traversal of the binary tree
During the BFS traversal, keep track of the current level and increment the depth by 1 for each level
Stop the BFS traversal when a leaf node is encountered and return the depth as the minim
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 is to find the intersection of two sorted arrays.
Use two pointers to iterate through the arrays.
Compare the elements at the current pointers and move the pointers accordingly.
If the elements are equal, add it to the intersection array and move both pointers.
If the element in the first array is smaller, move the first pointer.
If the element in the second array is smaller, move the second pointer.
Repeat until...
A mutex is a binary semaphore used for mutual exclusion, while a semaphore is a generalized synchronization primitive.
Mutex is used to protect a critical section of code, allowing only one thread to access it at a time.
Semaphore is used to control access to a shared resource, allowing multiple threads to access it simultaneously.
Mutex has ownership, meaning the thread that locks it must unlock it.
Semaphore does not hav...
Round duration - 60 minutes
Round difficulty - Easy
Round duration - 25 minutes
Round difficulty - Easy
Tip 1 : Practice a lot of DSA questions on various online platforms.
Tip 2 : Regularly go back to some of the typical DSA questions.
Tip 3 : Give equal importance to OS, OOPS, and CN subjects.
Tip 1 : Be thorough with your resume to answer anything and everything from your resume.
Tip 2 : Do not put false information on your resume.
I applied via Referral and was interviewed before Nov 2022. There were 6 interview rounds.
3 coding questions haker rank test
Top trending discussions
I was interviewed 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 was interviewed 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.
I was interviewed 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.
posted on 13 Jun 2024
I applied via Company Website and was interviewed in May 2024. There was 1 interview round.
The task was a Codility type
I was interviewed before Jan 2021.
Round duration - 70 Minutes
Round difficulty - Medium
This was an Online Coding+MCQ round where we had a total of 50 MCQ questions and 1 coding problem. The coding problem was of easy to medium level but was a bit implementation heavy.
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Implement a doubly linked list to maintain the order of recently used keys.
Use a hashmap to store key-value pairs for quick access.
When capacity is reached, evict the least recently used item before inserting a new item.
Update the position of a key in the linked list whenever it is accessed or updated.
H...
Round duration - 60 Minutes
Round difficulty - Medium
This round had 1 coding question in which I was first required to explain my approach and then discuss the time and space complexities. After this , some basic questions from OOPS and Java were asked.
For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.
A...
Detect and remove loop in a singly linked list in place with O(n) time complexity and O(1) space complexity.
Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.
Once the loop is detected, use two pointers to find the start of the loop.
Adjust the pointers to remove the loop and return the modified linked list.
ArrayList is implemented using a dynamic array while LinkedList is implemented using a doubly linked list.
ArrayList provides fast random access but slow insertion and deletion operations.
LinkedList provides fast insertion and deletion operations but slow random access.
Example: ArrayList is suitable for scenarios where frequent access and traversal of elements is required, while LinkedList is suitable for scenarios wher...
Abstraction focuses on hiding implementation details, while inheritance allows a class to inherit properties and behavior from another class.
Abstraction is the concept of hiding the complex implementation details and showing only the necessary features of an object.
Inheritance is a mechanism where a new class inherits properties and behavior from an existing class.
Abstraction is achieved through interfaces and abstract...
Round duration - 60 Minutes
Round difficulty - Medium
This round had questions from OS and OOPS. The interviewer also tested my problem solving skills by asking me some puzzles in the end.
Piping in Unix/Linux allows the output of one command to be used as the input for another command.
Piping is done using the | symbol
Multiple commands can be piped together
Piping allows for the creation of complex command chains
Example: ls -l | grep txt
A static variable in C is a variable that retains its value between function calls.
Static variables are declared using the 'static' keyword.
They are initialized only once and retain their value throughout the program's execution.
Static variables have a default value of 0 if not explicitly initialized.
They are stored in the data segment of the program's memory.
Example: static int count = 0; declares a static variable 'c
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.
based on 1 interview
Interview experience
based on 5 reviews
Rating in categories
Software Engineer III
128
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
110
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
87
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer2
80
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer II
50
salaries
| ₹0 L/yr - ₹0 L/yr |
Cisco
Juniper Networks
Palo Alto Networks
Fortinet