RethinkDB Interview Questions

3 Interview Reviews

Interview Experience

Interview Experience

33%
33%
33%

Getting an Interview

Getting an Interview

50%
50%

Interview Difficulty

3.7
Average

Interview Difficulty

Hard

Average

Easy

Candidate Interview Reviews

Sort: Popular Date Difficulty
  1.  

    Office Manager Interview

    Anonymous Employee in Mountain View, CA
    No Offer
    Positive Experience
    Average Interview

    Application

    I applied through other source – interviewed at RethinkDB (Mountain View, CA).

    Interview

    Phone/skype interview, take home problem to plan a sample event, and then on-site interview with community manager/founders.
    Employees and founders were very nice, welcoming. Intreesting vibe at the company and it is clear they pick carefully.

    Interview Questions

    • Asked me to plan a mock event -- most other questions were your standard interview questions.   Answer Question
  2.  

    Software Engineer Interview

    Anonymous Employee in Mountain View, CA
    No Offer
    Neutral Experience
    Difficult Interview

    Application

    I applied through a staffing agency. The process took 2 weeksinterviewed at RethinkDB (Mountain View, CA) in February 2012.

    Interview

    B Tree related questions, plus probability questions, and a lot of questions related with algorithm& data structure. and also some questions with code optimization. it might be a difficult Challenge if you never touch code optimization with computer architecture.

    Interview Questions

  3.  

    No Offer
    Negative Experience
    Difficult Interview

    Application

    The process took a weekinterviewed at RethinkDB in March 2011.

    Interview

    I had two telephonic interviews.
    The first one had 3 programming questions which I had to code in C/C++ on Google docs.
    1. Check whether a given tree is a bst or not.
    2. Print all permutations of a given string.
    3. Given a matrix of 0's and 1's return one of the largest sub-matrix consisting of only 1's.
    Second telephonic interview :
    1.Design and implement data structure to evaluate infix expressions.

    Interview Questions

    • Check whether a given tree is a bst or not.   Answer Question
    • Print all permutations of a given string.   Answer Question
    • Given a matrix of 0's and 1's return one of the largest sub-matrix consisting of only 1's.   Answer Question
    • Design and implement data structure to evaluate infix expressions.   Answer Question

Work at RethinkDB? Share Your Experiences

RethinkDB

 
Click to Rate
or

The difficulty rating is the average interview difficulty rating across all interview candidates.

The interview experience is the percentage of all interview candidates that said their interview experience was positive, neutral, or negative.

Your response will be removed from the review – this cannot be undone.