Filter interviews by
I applied via Company Website and was interviewed in Jan 2024. There were 2 interview rounds.
Online coding test - 3 leetcode questions
Top trending discussions
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 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.
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
The first round consists of aptitude and coding.Aptitude is of easy to moderate level.
I applied via Campus Placement and was interviewed before Oct 2023. There were 2 interview rounds.
DSA ques were moderate and aptitude ques were also asked
posted on 10 Oct 2024
I applied via LinkedIn and was interviewed before Oct 2023. There were 2 interview rounds.
Leetcode live coding with team members
How do u design the network as per the cloud customer requirements
I was interviewed in Jun 2021.
Round duration - 60 Minutes
Round difficulty - Medium
This was an Online Coding+MCQ round where we had a total of 25 MCQ questions and 1 coding problem. The coding problem was of easy to medium level and anyone with a decent knowledge of DSA could pass the coding problem.
Given a N * N
maze with a rat placed at position MAZE[0][0]
, find and print all possible paths for the rat to reach its destination at MAZE[N-1][N-1]
. The rat is allowed to...
Find all possible paths for a rat in a maze to reach its destination.
Use backtracking to explore all possible paths in the maze.
Mark visited cells and backtrack when reaching dead ends.
Print the path when reaching the destination cell.
Consider all possible movements: left, right, up, and down.
Ensure the rat can only move through cells marked as 1.
Round duration - 60 Minutes
Round difficulty - Medium
The interviewer asked 1 coding problem related to Dynamic Programming in this round and then the rest of the questions were preety much revolving around Computer Networks.
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...
The task is to find the total number of ways to make change for a specified value using given denominations.
Use dynamic programming to solve this problem efficiently.
Create a 1D array to store the number of ways to make change for each value from 0 to the target value.
Iterate through the denominations and update the array based on the current denomination.
The final answer will be the value at the target index of the ar
IPv6 has a larger address space, improved security features, and better support for mobile devices compared to IPv4.
IPv4 uses 32-bit addresses while IPv6 uses 128-bit addresses.
IPv4 supports around 4.3 billion unique addresses, whereas IPv6 supports 340 undecillion unique addresses.
IPv6 has built-in security features like IPsec, while IPv4 requires additional security protocols.
IPv6 has better support for mobile device...
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...
Round duration - 60 minutes
Round difficulty - Medium
This round had 1 question related to Binary Tree Traversal followed by some core concepts related to Operating Systems. This round ended with the interviewer asking me the famous 2 wire burning 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 in a spiral order, alternating between left to right and right to left at each level
Use a queue to keep track of nodes at each level and a flag to switch direction
Return the list of nodes in spiral order traversal
Memory protection in operating systems is a mechanism to prevent a process from accessing memory that has not been allocated to it.
Memory protection prevents a process from accessing memory locations outside its allocated space.
It helps in preventing one process from interfering with the memory of another process.
Operating systems use techniques like virtual memory and access control lists to implement memory protectio...
Use two wires of different lengths to measure a specific amount of time by burning them simultaneously.
Burn both wires at the same time, one wire will finish burning before the other
Measure the time it takes for the first wire to burn completely
Use this time as a reference to measure the specific amount of time by burning the second wire
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
Senior Staff Engineer
48
salaries
| ₹0 L/yr - ₹0 L/yr |
TAC Engineer
31
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
30
salaries
| ₹0 L/yr - ₹0 L/yr |
Principal Engineer
29
salaries
| ₹0 L/yr - ₹0 L/yr |
Staff Engineer
27
salaries
| ₹0 L/yr - ₹0 L/yr |
Check Point Software Technologies
Fortinet
FireEye
Gen