intel logo
Intel· SDE-New Grad

Intel | SDE-New Grad | San Jose | Jan 2020 [Reject]

Result
Rejected
Location
san jose
Posted
15 Jan 2020
277 reads

Summary

I interviewed for an SDE-New Grad role at Intel in San Jose, CA, involving two technical phone screens and a full onsite with three rounds. Despite feeling confident about most of my performance, especially in the coding challenges, I ultimately received a rejection.

How it went

Intel SDE-New Grad Interview Experience

I recently interviewed for a New Grad SDE position at Intel in San Jose, CA, back in January 2020. I hold an MS in CS from a Top 50 US School, so I was eager for this opportunity.

First Technical Phone Screen (1 hour)

This round focused entirely on Data Structures and Algorithms. I was asked two questions:

  1. Maximum Depth of Binary Tree
  2. Find First and Last Position of Element in Sorted Array

The interview went well, and I was soon invited for a second technical phone screen.

Second Technical Phone Screen (1 hour)

Again, this round featured two Data Structures and Algorithms questions:

  1. Linked List Cycle
  2. Binary Tree Level Order Traversal II

Beyond the coding, I also had to explain a couple of projects from my Master's degree and briefly elaborate on the Object-Oriented Design of a Tic-Tac-Toe game. A week later, I received an invitation for an onsite interview.

Onsite Interview (3 Rounds)

Round 1 (45 mins)

This round began with me explaining one of my Master's projects in detail, including writing class diagrams and thoroughly walking through its flow. Following this, two more Data Structures and Algorithms questions were posed:

  1. Pow(x, n)
  2. A problem involving simulating movement in a typical theater room to pass the minimum number of people.

Round 2 (45 mins)

The first 20 minutes of this round were dedicated to technical discussions: differences between C and C++, C++ and Java, and features I liked in C++11. The remaining time was for a coding question:

  1. I was given a string representing a student's daily attendance (A - absent, L - Late, P - Present) and conditions for getting into trouble (not absent for 2 consecutive days, not late for more than 3 days). The problem was then improvised for N days, asking for a solution to determine attendance validity. I provided a recursive backtracking solution, but the interviewer was looking for a dynamic programming approach, and he wasn't satisfied with my solution.

Round 3 (45 mins) - Hiring Manager Round

This was with the hiring manager and focused on behavioral questions:

  1. Give me an example of a time you faced a conflict while working on a team. How did you handle that?
  2. Tell me about a time you were under a lot of pressure. What was going on, and how did you get through it?

There was also one coding question:

  1. Reverse nodes in k-group

We also discussed visa sponsorship, my potential joining date, and any other offer deadlines or pending interviews I had.

Result: I received a rejection. No specific feedback was provided regarding the reason for the rejection.

Questions asked (11)

  1. 01

    Maximum Depth of Binary Tree

    Data Structures & Algorithms · Easy

    Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

    Open the problem
  2. 02

    Find First and Last Position of Element in Sorted Array

    Data Structures & Algorithms · Medium

    Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. If target is not found in the array, return [-1, -1].

    Open the problem
  3. 03

    Linked List Cycle

    Data Structures & Algorithms · Easy

    Given head, the head of a linked list, determine if the linked list has a cycle in it. There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointers.

    Open the problem
  4. 04

    Binary Tree Level Order Traversal II

    Data Structures & Algorithms · Medium

    Given the root of a binary tree, return the bottom-up level order traversal of its nodes' values. (i.e., from left to right, level by level from leaf to root).

    Open the problem
  5. 05

    OO Design of Tic-Tac-Toe Game

    System Design

    I was asked to briefly explain the Object-Oriented Design of the Tic-Tac-Toe game, discussing classes, relationships, and core game logic.

  6. 06

    Pow(x, n)

    Data Structures & Algorithms · Medium

    Implement pow(x, n), which calculates x raised to the power n (i.e., xn).

    Open the problem
  7. 07

    Simulate Theater Movement with Minimum People Passed

    Data Structures & Algorithms

    I was shown a diagram of a typical theater room with chairs, some occupied. The task was to simulate moving from one location to another within the theater, ensuring that the path chosen passes the minimum number of people on the way.

  8. 08

    Daily Attendance Eligibility

    Data Structures & Algorithms

    Given a string representing a student's daily attendance (A - absent, L - Late, P - Present), and certain conditions (student shouldn't be absent for 2 consecutive days and shouldn't be late for more than 3 days), determine if the student gets into trouble. The question was then improvised for N days, where N is the length of each string. I was expected to provide a dynamic programming solution, but I gave a recursive backtracking solution which was not satisfactory.

  9. 09

    Conflict Resolution in a Team

    Behavioral

    Give me an example of a time you faced a conflict while working on a team. How did you handle that?

  10. 10

    Handling Pressure

    Behavioral

    Tell me about a time you were under a lot of pressure. What was going on, and how did you get through it?

  11. 11

    Reverse Nodes in k-Group

    Data Structures & Algorithms · Hard

    Given the head of a linked list, reverse the nodes of the list k at a time, and return the modified list. k is a positive integer and is less than or equal to the number of nodes in the linked list. If the number of nodes is not a multiple of k then left-out nodes, in the end, should remain as it is.

    Open the problem

How they prepared

My Thoughts and Preparation Advice

Looking back at my interview experience, I strongly feel that perhaps not discussing the dynamic programming approach for the attendance problem in the second round was a primary reason for my rejection. This was my first onsite interview, and while it wasn't as difficult as FAANG interviews, it provided valuable experience to start with.

I have upcoming interviews with Amazon and Oracle, and I hope to perform better in those. From this experience, I've learned that the sheer number of questions solved on LeetCode doesn't matter as much as truly understanding the underlying concepts and how you approach problems in the moment during the interview. While it might not matter, I've personally solved 447 LeetCode questions (140 Easy, 262 Medium, 45 Hard problems).

Crucially, communicating your thought process to the interviewer matters a lot. I highly recommend practicing this through mock interviews. Platforms like Pramp, or even practicing with friends or colleagues, can be incredibly beneficial.

As Samuel Beckett famously quoted, "Ever tried. Ever failed. No matter. Try again. Fail again. Fail better." This resilience is key in the interview process.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Intel recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!