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

SDE - 2

McAfee
upvote
share-icon
3 rounds | 2 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 15 days
Topics: Data Structure, OOPS, C++, Win32 Programming, Algorithm
Tip
Tip

Tip 1 : Practice and practice coding.
Tip 2 : Go through some good online tutorial.
 

Application process
Where: Referral
Eligibility: Good in Windows Programming
Resume Tip
Resume tip

Tip 1 : Start from latest to old while putting your experience.
Tip 2 : Resume should not be more than 2-3 pages.

Interview rounds

01
Round
Medium
Online Coding Test
Duration90 minutes
Interview date30 Dec 2017
Coding problem1

1. Level order Tree Traversal

Easy
15m average time
85% success
0/40
Asked in companies
MicrosoftFacebookExpedia Group

You have been given a Binary Tree of integers. You are supposed to return the level order traversal of the given tree.

For example:
For the given binary tree

Example

The level order traversal will be {1,2,3,4,5,6,7}.
Problem approach

1: Take a queue DS.
2: Start from the root of the tree and push root into queue.
3: Then pop from tree and print it. 
4: Push left and right node of the popped node into queue.
5: Repeat step 2 to 4 until queue is empty.

Try solving now
02
Round
Medium
Video Call
Duration60 minutes
Interview date31 Dec 2017
Coding problem1

1. Find middle node of a Linked List

Easy
20m average time
80% success
0/40
Asked in companies
SamsungInfosysCognizant

Given a singly linked list of 'N' nodes. The objective is to determine the middle node of a singly linked list. However, if the list has an even number of nodes, we return the second middle node.

Note:
1. If the list is empty, the function immediately returns None because there is no middle node to find.
2. If the list has only one node, then the only node in the list is trivially the middle node, and the function returns that node.
Problem approach

1: Take two pointers (slow and fast) pointing to head.
2: Move slow to next and fast to next->next.
3: Compare when slow=fast then it is the middle node.

Try solving now
03
Round
Easy
HR Round
Duration20 minutes
Interview date4 Jan 2018
Coding problem0

HR specific questions, like why do you want to join McAfee, expectations etc.

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 3 + 2 * 4 based on operator precedence?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
4750 views
0 comments
0 upvotes
Analytics Consultant
3 rounds | 10 problems
Interviewed by ZS Associates
485 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
1756 views
0 comments
0 upvotes
company logo
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
1293 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 2
5 rounds | 12 problems
Interviewed by Walmart
26473 views
8 comments
0 upvotes
company logo
SDE - 2
3 rounds | 5 problems
Interviewed by Amazon
5771 views
0 comments
0 upvotes
company logo
SDE - 2
6 rounds | 8 problems
Interviewed by Amazon
4197 views
0 comments
0 upvotes