Filter interviews by
Use Floyd's Tortoise and Hare algorithm to detect cycle in a linked list.
Initialize two pointers, slow and fast, at the head of the linked list.
Move slow pointer by one step and fast pointer by two steps.
If they meet at some point, there is a cycle in the linked list.
Find the node where two linked lists intersect, if they do, and return that node.
Two linked lists intersect if they share a common node.
Example: List A: 1 -> 2 -> 3 -> 4; List B: 6 -> 3 -> 4 (intersects at node 3).
To find the intersection, calculate the lengths of both lists.
Align the starting point of both lists by skipping nodes from the longer list.
Traverse both lists simultaneously until the int...
The Coin Change Problem involves finding the number of ways to make a certain amount using given coin denominations.
Define the problem: Given denominations and a target amount, find combinations to achieve that amount.
Dynamic programming approach is commonly used to solve this problem efficiently.
Example: For coins [1, 2, 5] and target 5, combinations are: [5], [2, 2, 1], [2, 1, 1, 1], [1, 1, 1, 1, 1].
Base case: I...
Global variables are accessible throughout the program, while static variables are limited to the scope in which they are defined.
Global variables are declared outside of any function and can be accessed by any function in the program.
Static variables are declared within a function and retain their value between function calls.
Example: int globalVar = 10; static int staticVar = 5;
Example: Global variable can be ac...
Segmentation fault occurs when a program tries to access memory it doesn't have permission to access.
Segmentation fault occurs when a program tries to access memory outside of its allocated space.
Compiler detects segmentation faults by checking memory access permissions during compilation.
Segmentation faults are typically caused by dereferencing a null pointer or accessing an out-of-bounds array element.
Reverse nodes in k-group in a linked list, where k is a given integer.
Use a dummy node to simplify edge cases.
Iterate through the list in chunks of k nodes.
Reverse each chunk using a helper function.
Connect the reversed chunks back to the main list.
Handle cases where the remaining nodes are less than k.
The Three Sum problem involves finding unique triplets in an array that sum to zero.
Sort the array to simplify the search for triplets.
Use a loop to fix one element and apply two-pointer technique for the remaining elements.
Skip duplicates to ensure unique triplets are counted.
Example: For input [-1, 0, 1, 2, -1, -4], the output is [[-1, -1, 2], [-1, 0, 1]].
A polyfill for Array.prototype.reduce to enable compatibility with older JavaScript environments.
Define a function named 'reduce' that takes a callback and an initial value.
Use a for loop to iterate over the array elements.
Call the callback function with the accumulator and current value.
Return the final accumulated value after the loop ends.
Example: const sum = [1, 2, 3].reduce((acc, val) => acc + val, 0); // ...
Reversing a linked list involves changing the direction of the pointers between nodes.
A linked list consists of nodes, each containing data and a pointer to the next node.
To reverse a linked list, we need to change the next pointers of each node.
We can use three pointers: previous, current, and next to traverse and reverse the list.
Example: For a list 1 -> 2 -> 3, after reversal it becomes 3 -> 2 -> 1.
Calculate average, top 10 and bottom 10 elements of a given stream of integers.
Create a variable to store the sum of integers and another variable to store the count of integers.
Use a loop to read the integers from the stream and update the sum and count variables.
Calculate the average by dividing the sum by the count.
Sort the integers in ascending order and print the first 10 elements for bottom 10.
Sort the integ...
I appeared for an interview in Jan 2025.
One mcq two codes in total 240 min
I applied via Campus Placement
90 min MCQ +coding test on hackerrank.
Sort an array of colors represented as strings in a specific order: red, white, and blue.
Use the Dutch National Flag algorithm for efficient sorting.
Iterate through the array and maintain three pointers: low, mid, and high.
Swap elements based on their color: red (0), white (1), blue (2).
Example: Input: ['blue', 'white', 'red', 'red', 'blue'], Output: ['red', 'red', 'white', 'blue', 'blue'].
I applied via Naukri.com and was interviewed in May 2024. There was 1 interview round.
I applied via Referral and was interviewed in Jul 2024. There were 2 interview rounds.
2 easy to moderate questions and 20 multiple choice questions related to C/C++/Netowking/System Calls/OS
Global variables are accessible throughout the program, while static variables are limited to the scope in which they are defined.
Global variables are declared outside of any function and can be accessed by any function in the program.
Static variables are declared within a function and retain their value between function calls.
Example: int globalVar = 10; static int staticVar = 5;
Example: Global variable can be accesse...
Processes are independent instances of a program, while threads are smaller units within a process sharing resources.
Processes have their own memory space, while threads share the same memory space within a process.
Processes are heavyweight, requiring more resources, while threads are lightweight.
Processes communicate with each other through inter-process communication mechanisms, while threads can communicate directly...
Segmentation fault occurs when a program tries to access memory it doesn't have permission to access.
Segmentation fault occurs when a program tries to access memory outside of its allocated space.
Compiler detects segmentation faults by checking memory access permissions during compilation.
Segmentation faults are typically caused by dereferencing a null pointer or accessing an out-of-bounds array element.
I applied via Recruitment Consulltant and was interviewed in May 2024. There was 1 interview round.
To get the right and left view of a binary tree, perform a level order traversal and keep track of the first node encountered at each level.
Perform a level order traversal of the binary tree
Keep track of the first node encountered at each level for both left and right views
Store the first node encountered at each level in separate arrays for left and right views
The Three Sum problem involves finding unique triplets in an array that sum to zero.
Sort the array to simplify the search for triplets.
Use a loop to fix one element and apply two-pointer technique for the remaining elements.
Skip duplicates to ensure unique triplets are counted.
Example: For input [-1, 0, 1, 2, -1, -4], the output is [[-1, -1, 2], [-1, 0, 1]].
Reverse nodes in k-group in a linked list, where k is a given integer.
Use a dummy node to simplify edge cases.
Iterate through the list in chunks of k nodes.
Reverse each chunk using a helper function.
Connect the reversed chunks back to the main list.
Handle cases where the remaining nodes are less than k.
Coding test consisted of 2 coding questions and mcqs
I applied via LinkedIn and was interviewed in Aug 2023. There were 3 interview rounds.
I applied via LinkedIn and was interviewed in Oct 2023. There was 1 interview round.
A polyfill for Array.prototype.reduce to enable compatibility with older JavaScript environments.
Define a function named 'reduce' that takes a callback and an initial value.
Use a for loop to iterate over the array elements.
Call the callback function with the accumulator and current value.
Return the final accumulated value after the loop ends.
Example: const sum = [1, 2, 3].reduce((acc, val) => acc + val, 0); // retur...
Two coding and some aptitiude questions
Reversing a linked list involves changing the direction of the pointers between nodes.
A linked list consists of nodes, each containing data and a pointer to the next node.
To reverse a linked list, we need to change the next pointers of each node.
We can use three pointers: previous, current, and next to traverse and reverse the list.
Example: For a list 1 -> 2 -> 3, after reversal it becomes 3 -> 2 -> 1.
Top trending discussions
Some of the top questions asked at the F5 Networks interview -
The duration of F5 Networks interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 18 interview experiences
Difficulty level
Duration
based on 119 reviews
Rating in categories
Software Engineer III
155
salaries
| ₹18.9 L/yr - ₹49 L/yr |
Software Engineer
131
salaries
| ₹10 L/yr - ₹38 L/yr |
Senior Software Engineer
91
salaries
| ₹22 L/yr - ₹61 L/yr |
Software Engineer2
86
salaries
| ₹15 L/yr - ₹29 L/yr |
Software Engineer II
45
salaries
| ₹15 L/yr - ₹26.8 L/yr |
Xoriant
CitiusTech
HTC Global Services
HERE Technologies