A recruiter reached out to me with an Android opportunity. They asked some simple Android-related questions (5-6).

Then, a phone screen was scheduled (1 hour coding). I was asked 2 questions and some Android questions.

After that, Facebook flew me out for an on-site interview at Menlo Park (everything was paid for).

The overall interview process was really good. I was scheduled for 5 interviews, but one interviewer was not available that day, so I had 4 interviews + lunch.

I started my day at 11:00 AM. My first interview was a behavioral + coding interview (1 hour).

• He asked me about my resume, current role, and things I am working on at my current company.
• He also asked "Why Facebook?", "Why are you looking for a change?", plus general behavioral questions.
• Then, for the last 20 minutes, he asked me 1 simple coding question and asked me to write code on a whiteboard.

Next was a design interview (1 hour).

• Since I was interviewing for an Android position, he asked me an Android-specific design question.

Next was lunch (not an interview).

• Facebook has a huge cafeteria with tons of food options (it's free
  ).

Next was a coding interview (45 minutes).

• She asked me general Android questions (ListView, RecyclerView, Fragments, Intents, background processing in Android).
• Then, she gave me 2 coding questions with code on a whiteboard.

Next was another coding interview (1 hour).

• I was asked Android questions again (when to use Service vs. Async vs. Handler, Android API changes in Android O).

The interviewers at Facebook are really good; they help you out if you get stuck. Just make sure you practice your data structures and algorithms. Practice heavily on your design questions. Facebook expects very in-depth design.

I received a positive reply on the behavioral and coding rounds, but I was rejected on design (they expected more in-depth design knowledge).

Hope this helps. Happy Coding!!

Add two binary strings and return the sum as a string.

Design Facebook NewsFeed for Android.

Given an array of intervals, merge overlapping intervals (code with time and space complexity).

Given an array, move all zeros to the left (maintain the order of elements) – provide an optimized solution.

Then, 1 coding question:

Anagrammed Index – Given a string and a word, return the index of the anagram of the word in the string if present (provided an nlogk algorithm, then optimized with a HashMap solution).