F5 Networks Senior Software Engineer Interview Questions & Reviews
Updated Jan 26, 2012 – Interview questions and reviews posted anonymously by interview candidates.
|
Difficulty Rating [?] Based on 2 ratings |
Interview Experience [?] Based on 2 ratings
|
F5 Networks has 1,039 connections on Glassdoor
| 1–2 of 2 F5 Networks Interviews | Sort by |
Senior Software Engineer at F5 Networks
Posted Jan 26, 2012
4.0
Difficult Interview
|
Overall Negative Experience
|
Interviewed and No Offer
|
Interviewed Jan 2012 (took 3 days)
The interview involved a phone screen, then 1:1 interviews with 6 people, which last more than 5 hours long, it was really tiresome. the questions I got mostly matched one of the guy who posted his interview here, they asked very tricky question like finding longest palindrome, multiplication with shiftting, finding the next larger number that's power of 2, compression algorithm, etc; I did fairly okay on the programming questions, but honestly, those questions were quite disconnected from my background and experience.
I hear nothing after the interview and pinged the recruiting staff, then he said he going to circle back to me in a day, two days it has been, still nothing. As a working professional, I respected the company and interview, so I do expect at least hear something back, I think that's not so much to ask I believe.
Interview Questions
Other Details
I Applied Online and the interview consisted of a Phone Interview and a 1:1 Interview.
Helpful Interview?
Yes |
No
Inappropriate?
Senior Software Engineer at F5 Networks
Posted Dec 31, 2011
4.0
Difficult Interview
|
Overall Neutral Experience
|
Interviewed and No Offer
|
Interviewed Oct 2011 (took a day)
highly technical interview with emphasis on low-level software tricks and tips in C programming for ex. compute next highest power of 2 in O(1) time, given a pointer to elem in singly linked list delete the elem in O(1) time, find largest palindrome in string, print binary representation of number, multiply two numbers using just shift and add, find first occurence of a number in an array with duplicates, find missing number in array of size N containing numbers from 1 to N only, iterative solution to computing fibonacci series, largest sum of consecutive numbers in an array with negative numbers, average/worst case time complexity of heapsort, mergesort and quicksort, which sorting will you use and when etc.,
Interview Questions
Other Details
I got the interview through an Employee Referral and the interview consisted of a 1:1 Interview, a Group/Panel Interview and a Skills Test.
Helpful Interview?
Yes |
No
Inappropriate?