Working at A Thinking Ape | Glassdoor.co.uk

Glassdoor uses cookies to improve your site experience. By continuing, you agree to our use of cookies. OK | Learn More

Find your next job here

A Thinking Ape Overview

Vancouver, BC (Canada)
51 to 200 employees
2008
Company - Private
Computer Hardware & Software
Unknown / Non-Applicable
Unknown
Surrounded by mountains and water in beautiful Vancouver, BC, we are smart people who like smart people. We create mobile games with a social core that engage players and provoke us with creative new problems. We value data, informal leadership, and keeping it all ... Read more

Mission: Our mission is to build and create online communities and technologies that change how people socialize and play on mobile devices.

A Thinking Ape Reviews

4.8
StarStarStarStarStar
Rating TrendsRating Trends
Recommend to a friend
Approve of CEO
A Thinking Ape Co-Founder Kenshi Arasaki
Kenshi Arasaki
17 Ratings
  • "Good place to work"

    StarStarStarStarStar
    • Work/Life Balance
    • Culture & Values
    • Career Opportunities
    • Comp & Benefits
    • Senior Management
    Former Employee - Anonymous Employee
    Former Employee - Anonymous Employee
    Recommends
    Neutral Outlook
    No opinion of CEO

    I worked at A Thinking Ape full-time

    Pros

    Autonomy and ownership, friendly, good work-life balance.

    Cons

    open office, disorganized, poor communication

See All 34 Reviews

A Thinking Ape Photos

A Thinking Ape photo of: Board room meetings
A Thinking Ape photo of: Team Kraken hard at work
A Thinking Ape photo of: Heated Debate
A Thinking Ape photo of: Birthday and Anniversary celebrations
A Thinking Ape photo of: We love our sweets
A Thinking Ape photo of: Wednesday, catered lunch
See All PhotosSee All

A Thinking Ape Interviews

Experience

Experience
66%
30%
4%

Getting an Interview

Getting an Interview
42%
38%
7%
7
3
3

Difficulty

3.3
Average

Difficulty

Hard
Average
Easy
  1. Helpful (1)  

    Machine Learning Engineer Interview

    Anonymous Interview Candidate in Vancouver, BC (Canada)
    No Offer
    Positive Experience
    Average Interview

    Application

    I applied online. The process took 2 weeks. I interviewed at A Thinking Ape (Vancouver, BC (Canada)) in December 2017.

    Interview

    I had applied online and received an email within a few days of applying. Within a week I had a chat with the recruiter on the phone, and then scheduled a date for the interview. After the interview, they notified me within 48 hours.

    Interview Questions

    • What would the classes and methods for a "Hit Point Management" system look like, that has the following functions - increment(user, value), decrement(user, value), getHitPoints(user) and killAll()? The first two methods add/subtract the user's hit points by the amount in value. getHitPoints() returns a user's hit points and killAll() sets all users' hit points to 0.

      What are the run times of the methods? How can you make all the methods run in O(1)?
      Note: If we set the hit points data structure to null, or re-initialized it to a new structure, the garbage collector still has to do the work of going through all the users.   Answer Question
    • You're given a matrix of integers, and from any position in the matrix, you can only move in 4 directions - up, down, right, left - and that too, only if the destination position has a lower value than the original position. Given the starting indices (position in the matrix), find the longest such path possible. For eg. For this matrix: m = [[1 4 2], [5, 2, 6], [3, 2, 7]] and a starting position m[1][2], which is 6, you cannot move "down" to m[2][2], since 7 > 6, but you can move left to m[1][1] and up to m[0][2]. What is the run time of the algorithm?   Answer Question
See All 30 Interviews

A Thinking Ape Awards & Accolades

  • EY Entrepreneur of the Year, EY Entrepreneur of the Year®, 2012
  • Empact100, Empact100, 2012

Work at A Thinking Ape? Share Your Experiences

A Thinking Ape
  • Star
  • Star
  • Star
  • Star
  • Star
 
Click to Rate
or