I applied through a recruiter. The process took 3 weeks. I interviewed at Office Depot (Boca Raton, FL) in Nov 2014
Interview
Applied through recruiter. 4 (!) phone screenings, some of them pretty technical, mostly relevant.
Fifth interview was face to face in the office. Three rounds with different groups of people: developers, hiring manager, somebody in architecture. Moderately technical questions, often i was ask to tell about my experience with this or that, well, you can tell your story.
My impression: exhausting, pretty awkward, either interviewers were shy to ask technical questions or didn't know what to ask. At the end, they came to understanding that i didn't have Oracle products stack in my resume - i found it ridiculous to go through 5 rounds of back and forth to find out the obvious.
Interview questions [1]
Question 1
Whole lot specific questions about JVM memory management...
I applied online. The process took 4 weeks. I interviewed at Office Depot
Interview
HR review, Hiring Manager interview and if selected proceed to 4 separate interviews of an hour each with a panel or individual. Situational questions based on 5C principles of Office Depot and technical questions related to previous job or the position interviewing for,
Interview questions [1]
Question 1
Situational based on their 5C principle and technical tests
I applied online. The process took 6 weeks. I interviewed at Office Depot in Sep 2021
Interview
1st: online coding assessment.
If you pass, then,
A 4 hour long interview with 4 different teams.
Checks coding abilities , algorithms knowledge, critical thinking and 1 behavioral interview.
After that final round with Hiring Manager
The process took 2 months. I interviewed at Office Depot
Interview
1. Started off with a phone screen about position
2. hacker rank with easy leetcode questions
3. 4 hour interview with 4 sets of people with each having one interviewer and 1 shadow. Each started with 2-3 behavioral questions, and followed with easy leetcode questions involving Math/logic, Binary Search, 2 pointer solutions.
The difficult part of the interview is that they immediately wanted the best solution possible to the interview. For instance the binary search problem could have been done with incremental search but they specified they wanted a runtime of O(log n)
Interview questions [1]
Question 1
Binary Search solution to a problem, left and right pointer, Math problems