Filter interviews by
Clear (1)
I applied via Job Fair and was interviewed before Mar 2023. There were 3 interview rounds.
2 data struture question advancevds i cpp
Implement a data structure for storing and manipulating an array of strings.
Use a dynamic array to store the strings.
Implement functions for adding, removing, and accessing strings in the array.
Consider memory management and resizing the array as needed.
I was interviewed in Apr 2021.
Round duration - 45 minutes
Round difficulty - Medium
Timing was 12 PM. Interviewer was nice.
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.
Alternatively, 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 on the length of the string and number of test cases.
Your task is to rearrange a given array ARR
such that all zero elements appear at the beginning, followed by non-zero elements, while maintaining the relative order of...
Rearrange an array such that all zero elements appear at the beginning, followed by non-zero elements, maintaining relative order of non-zero elements.
Iterate through the array and maintain two pointers - one for the next position to place a zero and one for the next non-zero element.
Swap the elements at these pointers until all zeros are moved to the left and non-zero elements are in their relative order.
Time complexi...
SQL query to find the second highest salary from a table
Use the MAX() function to find the highest salary
Use the NOT IN operator to exclude the highest salary from the results
Order the salaries in descending order and limit the result to 1
Tip 1 : Do some projects.
Tip 2 : Practice problem solving questions.
Tip 1 : Keep it short.
Tip 2 : Do not put false things on resume.
I was interviewed in Jan 2021.
Round duration - 60 Minutes
Round difficulty - Medium
Online test
Based on c++,c and java basics
MCQ questions based on C++, C, and Java basics.
Understand the differences between C++, C, and Java syntax and features.
Be familiar with basic concepts like data types, control structures, and functions.
Practice solving MCQs to improve your understanding of the languages.
Round duration - 150 Minutes
Round difficulty - Medium
Technical interview
The task is to determine the number of distinct elements in every sliding window of size 'K' across an array 'ARR' of size 'N'. A 'K' sized window is a contiguous sequ...
Calculate the count of distinct elements in each sliding window of size 'K' across an array 'ARR'.
Use a sliding window approach to iterate through the array and keep track of distinct elements using a hashmap or set.
Update the count of distinct elements in each window as it slides across the array.
Return the array detailing the count of distinct elements in each 'K' sized window for each test case.
You are given a Singly Linked List of integers. Your task is to sort the list using the 'Merge Sort' algorithm.
The input consists of a single line contain...
Sort a Singly Linked List using Merge Sort algorithm.
Implement the Merge Sort algorithm for linked lists.
Divide the list into two halves, sort each half recursively, and then merge them.
Use a fast and slow pointer to find the middle of the list for splitting.
Handle the base cases of empty list or single node list.
Example: Input: 4 3 2 1 -1, Output: 1 2 3 4
Round duration - 20 minutes
Round difficulty - Hard
Hr interview
Tip 1 : Go through oosp concept properly
Tip 2 : Good knowledge on coding
Tip 3 : intermediate knowledge on database and data structures
Tip 1 : A project based on database
Tip 2 : Mention all the fields properly and have a prior knowledge on your project
Top trending discussions
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
I applied via Referral and was interviewed in Nov 2024. There were 2 interview rounds.
Data Structures and Algorithms
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.
I was interviewed before Jan 2021.
Round duration - 60 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.
Given two linked lists representing two non-negative integers, where the digits are stored in reverse order (i.e., starting from the least significant digit to ...
Add two numbers represented as linked lists in reverse order and return the sum as a linked list.
Traverse both linked lists simultaneously while keeping track of carry.
Create a new linked list to store the sum digits.
Handle cases where one list is longer than the other or there is a final carry.
Remember to reverse the final linked list before returning the head.
Round duration - 60 Minutes
Round difficulty - Medium
This round had 1 question related to Binary Tree Traversal and then the rest of the questions that the interviewer asked me were mostly related to OOPS and C++.
Given a binary tree of integers, return the level order traversal of the binary tree.
The first line contains an integer 'T', representing the number of te...
Return the level order traversal of a binary tree given in level order with null nodes represented by -1.
Create a queue to store nodes for level order traversal
Start with the root node, enqueue it, then dequeue and print its value, enqueue its children, repeat until queue is empty
Handle null nodes represented by -1 by skipping them during traversal
A namespace in C++ is a declarative region that provides a scope for the identifiers within it.
Namespaces help in organizing code by grouping related classes, functions, and variables.
They prevent naming conflicts by allowing the same name to be used in different namespaces.
Example: namespace myNamespace { int x; }
Example: using namespace std; // for using standard library functions without prefix
Friend class and function in OOP allows specific classes or functions to access private and protected members of a class.
Friend class/function can access private and protected members of a class without violating encapsulation.
It allows for selective sharing of data between classes without exposing all members to the outside world.
Friendship is not mutual - a class can declare another class as a friend, but the other c...
A static member in C++ is a member of a class that is shared among all instances of the class.
Static members are declared using the 'static' keyword.
They are not associated with any specific instance of the class, but rather with the class itself.
They can be accessed using the scope resolution operator '::'.
Static members are commonly used for constants, utility functions, or shared data among all instances of a class.
Round duration - 60 minutes
Round difficulty - Medium
This round was more aligned towards Computer Networks and had 1 question of DSA realted to Binary Trees and the interview ended with the famous Die-Hard Puzzle.
Given a binary tree with N
nodes, your task is to output the Spiral Order traversal of the binary tree.
The input consists of a single line containing elem...
Implement a function to return the spiral order traversal of a binary tree.
Traverse the binary tree level by level, alternating the direction of traversal from left to right and right to left.
Use a queue to keep track of nodes at each level and a stack to reverse the order of nodes at even levels.
Handle null nodes appropriately to maintain the spiral order traversal.
Example: For input 1 2 3 -1 -1 4 5, the output should
The OSI Reference Model is a conceptual framework that standardizes the functions of a telecommunication or computing system into seven layers.
The OSI Reference Model stands for Open Systems Interconnection Reference Model.
It consists of seven layers: Physical, Data Link, Network, Transport, Session, Presentation, and Application.
Each layer has specific functions and communicates with the adjacent layers.
The model help...
A router is a networking device that forwards data packets between computer networks. It differs from a gateway in terms of functionality and scope.
A router operates at the network layer of the OSI model, making decisions based on IP addresses.
Routers connect multiple networks together and determine the best path for data to travel.
Gateways, on the other hand, translate between different types of networks or protocols.
...
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.
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.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
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