Travailler chez A Thinking Ape | Glassdoor.ca

Présentation de A Thinking Ape

Vancouver, BC
Entre 51 et 200 employés
2008
Entreprise non cotée en bourse
Matériel et logiciels informatiques
Ne sait pas / non applicable
Inconnu

Avis sur A Thinking Ape

4,8
StarStarStarStarStar
Tendances des évaluationsTendances des évaluations
Recom­mandent
Approuvent le PDG
A Thinking Ape Co-Founder Kenshi Arasaki
Kenshi Arasaki
17 Évaluations
  • « Was fun »

    StarStarStarStarStar
    Ancien employé - Employé anonyme
    Ancien employé - Employé anonyme

    J'ai travaillé chez A Thinking Ape en Contrat Permanent

    Avantages

    Great office and great hours.

    Inconvénients

    Not all leadership roles have experience in leading/management.

    Conseils à la direction

    Promote equal value among a teams, all employees.

Voir les 32 avis

Photos chez A Thinking Ape

A Thinking Ape photo de : Come work here!
A Thinking Ape photo de : Solving hard problems.
A Thinking Ape photo de : Eric and Spock
A Thinking Ape photo de : Working hard
A Thinking Ape photo de : Halloween
A Thinking Ape photo de : Birthday and Anniversary celebrations
Afficher toutes les photosTout afficher

Entretiens chez A Thinking Ape

Expérience

Expérience
66%
30%
4%

Obtenir un entretien

Obtenir un entretien
42%
38%
7%
7
3
3

Difficulté

3,3
Moyenne

Difficulté

Difficile
Moyenne
Facile
  1. Utile (1)  

    Entretien de Machine Learning Engineer

    Candidat à l'entretien anonyme - Vancouver, BC
    Pas d’offre d’emploi
    Expérience positive
    Difficulté moyenne

    Candidature

    J'ai postulé en ligne. Le processus a pris 2 semaines. J'ai passé une entrevue à A Thinking Ape (Vancouver, BC) en décembre 2017.

    Entretien

    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.

    Questions d'entretien d'embauche

    • 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.   Répondre à cette 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?   Répondre à cette question
Voir les 30 entretiens d'embauche

Prix et distinctions de A Thinking Ape

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

Vous travaillez chez A Thinking Ape ? Partagez vos expériences

A Thinking Ape
  • Star
  • Star
  • Star
  • Star
  • Star
 
Cliquez pour noter
ou