Skip to contentSkip to footer
  • Community
  • Jobs
  • Companies
  • Salaries
  • For employers
      Notifications

      Loading...

      Elevate your career

      Discover your earning potential, land dream jobs, and share work-life insights anonymously.

      employer cover photo
      employer logo
      employer logo

      Tripadvisor

      Engaged employer

      About
      Reviews
      Pay and benefits
      Jobs
      Interviews
      Interviews
      Related searches: Tripadvisor reviews | Tripadvisor jobs | Tripadvisor salaries | Tripadvisor benefits
      Tripadvisor interviewsTripadvisor Software Engineer/Data Scientist interviewsTripadvisor interview


      Glassdoor

      • About / Press
      • Awards
      • Blog
      • Research
      • Contact Us
      • Guides

      Employers

      • Free Employer Account
      • Employer Centre
      • Employers Blog

      Information

      • Help
      • Guidelines
      • Terms of Use
      • Privacy and Ad Choices
      • Do Not Sell Or Share My Information
      • Cookie Consent Tool
      • Security

      Work With Us

      • Advertisers
      • Careers
      Download the App

      • Browse by:
      • Companies
      • Jobs
      • Locations
      • Communities
      • Recent posts

      Copyright © 2008-2026. Glassdoor LLC. "Glassdoor," "Worklife Pro," "Bowls" and logo are proprietary trademarks of Glassdoor LLC.

      Followed companies

      Stay ahead in opportunities and insider tips by following your dream companies.

      Job searches

      Get personalised job recommendations and updates by starting your searches.

      Bowls

      Get actionable career advice tailored to you by joining more bowls.

      Company Bowl sample

      Want the inside scoop on your own company?

      Check out your Company Bowl for anonymous work chats.

      Software Engineer/Data Scientist Interview

      29 Oct 2014
      Anonymous interview candidate
      No offer
      Neutral experience
      Easy interview

      Application

      I applied through a recruiter. The process took 1 day. I interviewed at Tripadvisor in Oct 2014

      Interview

      A recruiter reached out to me, said TripAdvisor would be interested in my profile and, in case things go well, sponsor a working visa (I am not a US citizen). I had a technical interview on Skype with a Technical Manager. He made me feel extremely comfortable during the whole call. He first asked me why I wanted to join the company, then wanted to know more about my previous job as Data Scientist. Theoretical question: Hash Table and its complexity. Practical questions (answered on shared, real-time text editor): Intersect two sorted arrays/lists; Linked List + Fibonacci indexes. For each solution I was asked the complexity of it. Pro: it is possible to choose between many programming languages, such as Java, Python, JS, … Unfortunately, I kinda screwed up the Fibonacci question. Everything was quite easy. Anyways, it's been 20 days since I was interviewed, haven't received any news neither by the recruiter, nor the company.

      Interview questions [3]

      Question 1

      // Given a singly linked list without values defined by: class Node { Node next } // Write a function that removes all elements from the list whose _index_ is a fibonacci number // o -> o -> o -> o -> o -> o -> o -> o -> o -> o -> o -> o // 0 1 2 3 4 5 6 7 8 9 10 11 // x x x x x // becomes // o ----------------> o ------> o -> o ------> o -> o -> o // 0 4 6 7 9 10 11
      1 Answer

      Question 2

      # Q1: Write a function to intersect two *sorted* lists (find common elements) # Write a method taking two lists as input, and returning a new list # You can assume you have a reasonable array/list class available (ArrayList, vector, python list, etc) # Ex: # l1 = [1,2,3,4,5] # l2 = [1,5,7,11,100] # result = [1,5]
      2 Answers

      Question 3

      # Q2: Same as Q1, but now assume there can be duplicates. The output should not have duplicates # Ex: # l1 = [1,2,3,4,5,5,5] # l2 = [1,5,7,11,100] # result = [1,5]
      2 Answers