F5 Networks interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

F5 Networks
upvote
share-icon
5 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 12 months
Topics: Data Structure and Algorithms, Operating Systems, Object-Oriented Programming, Computer Networks, System Design
Tip
Tip

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.

Application process
Where: Campus
Eligibility: Minimum CGPA Required: 7.0
Resume Tip
Resume tip

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.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date19 Jan 2022
Coding problem1

1. Cycle Detection in a Singly Linked List

Moderate
15m average time
80% success
0/80
Asked in companies
GrabThalesSterlite Technologies Limited

You are given a Singly Linked List of integers. Return true if it has a cycle, else return false.


A cycle occurs when a node's next points back to a previous node in the list.


Example:
In the given linked list, there is a cycle, hence we return true.

Sample Example 1

Problem approach

I used the slow and fast pointer technique to solve the problem.

Try solving now
02
Round
Medium
Group Discussion
Duration90 minutes
Interview date21 Jan 2022
Coding problem0
03
Round
Medium
Video Call
Duration60 minutes
Interview date21 Jan 2022
Coding problem3

1. Minimum Depth Of Binary Tree

Moderate
20m average time
80% success
0/80
Asked in companies
FacebookGoldman SachsMakeMyTrip

You have been given a Binary Tree of integers, find the minimum depth of this Binary Tree. 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.

Note:
A leaf is a node with no children.
For example:
For the given binary tree

alt text

Output: 2
The shortest path is from root node 1 to leaf node 2 which contains 2 nodes in the path. Hence, the minimum depth is 2.
Problem approach

It was a fairly simple problem and I used recursion to solve this problem.

Try solving now

2. Intersection Of Two Arrays

Easy
10m average time
90% success
0/40
Asked in companies
IBMFacebookBig Basket

You are given two arrays 'A' and 'B' of size 'N' and 'M' respectively. Both these arrays are sorted in non-decreasing order. You have to find the intersection of these two arrays.

Intersection of two arrays is an array that consists of all the common elements occurring in both arrays.

Note :
1. The length of each array is greater than zero.
2. Both the arrays are sorted in non-decreasing order.
3. The output should be in the order of elements that occur in the original arrays.
4. If there is no intersection present then return an empty array.
Problem approach

I used an unordered map to store the unique elements from both the arrays and then printed it.

Try solving now

3. Operating System Question

What is the difference between a mutex and a semaphore

Problem approach

Tip 1 : First of all structure your thoughts.
Tip 2 : Try answering with an example. I tried to explain the difference by explaining them the Consumer-Producer Problem and then went on to explain how mutex would differ from a semaphore in solving the problem.

04
Round
Easy
HR Round
Duration60 minutes
Interview date24 Jan 2022
Coding problem1

1. Technical Questions

It was a managerial round. The interviewer started by introducing himself and then asked for my introduction. We then had an in-depth discussion on Cloud Computing, its importance and different OSI layers. We also had a serious discussion on why network security is essential nowadays. Apart from that, we talked about other security protocols that are in place today. Overall the interviewer was very friendly, and we had a healthy discussion.

Problem approach

Tip 1 : Be calm and answer what you're familiar with.
Tip 2 : If you're not familiar with something, ask the interviewer for help.

05
Round
Easy
HR Round
Duration25 minutes
Interview date26 Jan 2022
Coding problem1

1. Basic HR questions

The interviewer introduced himself and then asked for my introduction. He then asked me why I wanted to join F5 networks and why they should hire me. He then told me in-depth about the company and its values. Overall we had a healthy and light discussion about the company and its work ethics, and then he ended the interview.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
4657 views
0 comments
0 upvotes
company logo
Software Engineer
4 rounds | 16 problems
Interviewed by F5 Networks
1612 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
6451 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3452 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114579 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57825 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34961 views
7 comments
0 upvotes