Filter interviews by
Clear (1)
Total 60 question 30 from C/C++ output and 30 from profit-loss, find age and related to ratio
To rotate a matrix 90 degrees, transpose the matrix and then reverse each row.
Transpose the matrix by swapping matrix[i][j] with matrix[j][i]
Reverse each row of the transposed matrix to get the final rotated matrix
Iterative solution to perform preorder traversal without using recursion
Use a stack to keep track of nodes
Start by pushing the root node onto the stack
While the stack is not empty, pop a node, visit it, then push its right child followed by its left child onto the stack
Top trending discussions
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.
I was interviewed before Nov 2020.
Round duration - 60 minutes
Round difficulty - Medium
The test was in the evening which was not too late. It was conducted on Hackerrank which is a very common platform and was hence familiar. There were 26 questions:
Q1: Coding Question
3 languages were allowed: c, java8, python3
Q2 - Q26: Multiple Choice Questions
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...
Find the node where two linked lists merge, return -1 if no merging occurs.
Traverse both lists to find the lengths and the last nodes
Align the starting points of both lists by moving the longer list's pointer ahead by the difference in lengths
Traverse both lists simultaneously until a common node is found, which is the merging point
Tip 1 : Practice competitive programming as much as possible. It's never too late. Start now. But it is important to practice before appearing for the paper.
Tip 2 : Try to start making projects early on as it plays a major role during the interviews.
Tip 3 : Be involved in extra curricular activities and events like Hackathons even if you don't win all of them. It gives a lot of exposure and experience.
Tip 4 : Don't lose touch with your core subjects.
Tip 5 : An internship/training from a good organization always helps (though don't lose hope if you don't have it).
Tip 6 : Focus on your communication skills along with your core subjects as it helps in giving a good impression during the interviews.
Tip 1 : Maintain a good CGPA (above 7.5)
Tip 2 : Mention your projects as they are noticed in the interview
Tip 3 : Having an internship experience especially from a good organization helps
Tip 4 : Focus on extra curricular activities too
Tip 5 : Do not put things you are not sure about
I was interviewed before May 2016.
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
posted on 18 Mar 2024
I applied via Company Website and was interviewed in Feb 2024. There were 3 interview rounds.
Basic question asked
Object-oriented programming paradigm that focuses on objects and classes for code organization and reusability.
Encapsulation: bundling data and methods that operate on the data into a single unit (object)
Inheritance: ability of a class to inherit properties and behavior from another class
Polymorphism: ability to present the same interface for different data types
It was 90 mins test with 2 coding questions and aptitude questions most of them on networking
Find the longest subarray with sum 0 in an array of integers.
Use a hash table to store the sum and its index.
Iterate through the array and calculate the cumulative sum.
If the cumulative sum is already in the hash table, then the subarray between the current index and the index in the hash table has a sum of 0.
Keep track of the longest subarray with sum 0 seen so far.
Return the length of the longest subarray with sum 0.
I was interviewed in Aug 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.
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...
Find the node where two linked lists merge, return -1 if no merging occurs.
Traverse both lists to find their lengths and the difference in lengths
Move the pointer of the longer list by the difference in lengths
Traverse both lists simultaneously until they meet at the merging point
Round duration - 60 Minutes
Round difficulty - Medium
The interviewer asked 1 coding problem related to Sliding Window in this round and then the rest of the questions were preety much revolving around Computer Networks and OOPS.
Given a string S
of length L
, determine the length of the longest substring that contains no repeating characters.
"abac...
Find the length of the longest substring without repeating characters in a given string.
Use a sliding window approach to keep track of the longest substring without repeating characters.
Use a hashmap to store the index of each character as it appears in the string.
Update the start index of the window when a repeating character is found.
Calculate the maximum length of the window as you iterate through the string.
Return
DNS stands for Domain Name System, which translates domain names to IP addresses.
DNS is like a phone book for the internet, translating human-readable domain names (like google.com) to IP addresses (like 172.217.3.206).
It helps users access websites by typing in easy-to-remember domain names instead of complex IP addresses.
DNS servers store records of domain names and their corresponding IP addresses, allowing for effi...
MAC addresses are necessary for local network communication and are used to uniquely identify devices on a network.
MAC addresses are used at the data link layer of the OSI model to identify devices within the same local network.
IP addresses are used at the network layer to identify devices across different networks.
MAC addresses are hardcoded into network interface cards (NICs) and are used for communication within the...
C++ supports polymorphism through virtual functions and inheritance.
C++ supports polymorphism through virtual functions and inheritance
Virtual functions allow a function to be overridden in a derived class
Base class pointers can point to derived class objects, enabling polymorphic behavior
Example: class Animal { virtual void makeSound() { cout << 'Animal sound'; } }; class Dog : public Animal { void makeSound() {...
Round duration - 60 minutes
Round difficulty - Medium
This round had questions revolving around Computer Networks and Operating Systems.
Tip : Concepts related to Computer Networks is quite frequently asked in Cisco interviews . So its better to remain equipped with all the fundamental concepts. I prepared all the core subjects from my notes and for revision I would suggest the guided paths of Coding Ninjas , they are very useful for quick revision and also the questions over there are very frequently asked in interviews.
ARP stands for Address Resolution Protocol, used to map IP addresses to MAC addresses in a local network.
ARP is used to find the MAC address of a device based on its IP address
It operates at the data link layer of the OSI model
ARP requests are broadcasted to all devices on the local network
Example: When a device wants to communicate with another device on the same network, it uses ARP to find the MAC address of the des
Different types of semaphores include binary semaphores, counting semaphores, and mutex semaphores.
Binary semaphores: Can only have two states - 0 or 1. Used for mutual exclusion.
Counting semaphores: Can have multiple states. Used for synchronization among multiple processes.
Mutex semaphores: Similar to binary semaphores but with additional features like priority inheritance and deletion safety.
Thrashing in operating systems is a situation where the system is spending more time swapping data between memory and disk than actually executing tasks.
Occurs when the system is overwhelmed with too many processes competing for limited resources
Results in a decrease in overall system performance
Can be alleviated by optimizing memory usage or adding more physical memory
Example: A system with insufficient RAM running mu
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
Associate Software Engineer
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Full Stack Developer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Lead
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Cisco
Palo Alto Networks
Fortinet
Sophos Technologies