Travailler chez Moneris | Glassdoor.fr

Présentation de Moneris

Etobicoke, ON (Canada)
De 1 001 à 5 000 employés
2000
Entreprise non cotée en bourse
Traitement des transactions financières
Ne sait pas / non applicable
Concurrents

Inconnu

Avis des employés Moneris

  • « Good Company »

    StarStarStarStarStar
    • Équilibre travail/vie privée
    • Culture et valeurs
    • Opportunités de carrière
    • Rémunération et avantages
    • Dirigeants
    Employé actuel - IB Sales Representative - Montréal, QC (Canada)
    Employé actuel - IB Sales Representative - Montréal, QC (Canada)
    Recommande
    Point de vue positif
    Approuve le PDG

    Je travaille chez Moneris à plein temps

    Avantages

    Can make lot of money if you work hard and stay overtime

    Inconvénients

    Lots of pressure to perform, hard to meet sales target

Voir les 219 avis

Entretiens chez Moneris

Expérience

Expérience
74%
16%
10%

Obtenir un entretien

Obtenir un entretien
58%
18%
14%
4
4
2

Difficulté

2,9
Moyenne

Difficulté

Difficile
Moyenne
Facile
  1.  

    Entretien de Senior Software Developer

    Candidat à l'entretien anonyme - Toronto, ON (Canada)
    Aucune offre d'embauche
    Expérience positive
    Difficulté moyenne

    Candidature

    J'ai postulé via un recruteur. Le processus a pris +2 mois. J'ai passé un entretien à Moneris (Toronto, ON (Canada)) en janvier 2020.

    Entretien

    The interview process consisted of three steps:
    - online programming challenge (technical screening) via codility.com: included two programming tasks of easy and medium complexity;
    - in-person onsite interview with hiring manager;
    - in-person onsite interview with development team members.

    Questions d'entretien d'embauche

    • Programming task 1 (technical screening):
      You want to park your bicycle in a bicycle parking area where bike racks are aligned in a row. There are already N bikes parked there(each bike is attached to exactly one rack, but a rack can have multiple bikes attached to it). We call racks that already have bikes attached used.
       You want to park your bike in a rack in the parking area according to the following criteria:
              the chosen rack must lie between te first and the last used racks(inclusive);
              the distance between the chose rack and any other used rack is as big as possible.
      A description of the bikes already parked in the racks is given in a non-empty zero-indexed array A: element A[K] denotes the postion of the rack to which bike number K is attaced (for 0 <= K < N). The central position in the parking area is position 0. A positive value means that the rack is located A[K] meters to the right of the cetral position 0; a negative value means that it's located |A[K]| meters to the left.
      That, given a non-empty zero-indexed array A of N integers, returns the largest possible distance in meters between the chosen rack and any other used rack.
      Assume that:
              N is an integer within the range [2..100,000];
              each element of array A is an integer within the range [-1,000,000,000..1,000,000,000].   Répondre à cette question
    • Programming task 2 (technical screening):
      When John gambles at the casino, he always uses a special system of tactics that he devised
      himself. It's based on always betting in one of two ways in each game:
      - betting exactly one chip (to test his luck);
      - betting all in (he bets everything he has).

      Wins in the casino are paid equal to the wager, so it he bets C chips and wins, he gets 2C chips
      back. If he loses, he doesn't get any chips back.

      It was a very lucky day yesterday and John won every game he played, starting with one chip and
      leaving the casino with N chips. We also know that John pllayed all-in no more than K times. Your
      task is to calculate the smallest possible number of rounds he could have played.

      Note: betting just one chip is never cosidered playing all-in.

      Write a function
          int solution(int N, int K);
      that, given an integer N and an integer K, returns the minimum number of rounds that are
      necessary for John to leave the casino with N chips, having played all-in no more than K times.

      Example:
      Given N = 8 and K = 0, the answer is 7. K is 0, so John bets 1 chip in each round. The number of chips were as follows:
      at the beginning:1 (he bet 1)
      after 1st round: 2 (he bet 1)
      after 2nd round: 3 (he bet 1)
      after 3rd round: 4 (he bet 1)
      after 4th round: 5 (he bet 1)
      after 5th round: 6 (he bet 1)
      after 6th round: 7 (he bet 1)
      after 7th round: 8 (he bet 1)
      he played all-in 0 times

      Given N = 18 and K =2, the answer is 6. The shortest game would be:
      at the beginning:1
      after 1st round: 2
      after 2nd round: 3
      after 3rd round: 4
      after 4th round: 8(all-in)
      after 5th round: 9
      after 6th round: 18(all-in)   Répondre à cette question
    • Interview questions with the hiring manager were regarding previous experience. Interview was conversational in nature.   Répondre à cette question
    • Interview questions with the development team were regarding previous experience.   Répondre à cette question
Voir les 52 entretiens d'embauche

Prix et distinctions de Moneris

  • 50 Most Engaged Workplaces, Achievers, 2013
  • 50 Most Engaged Workplaces, Achievers, 2015
Voir plus

Vous travaillez chez Moneris ? Partagez vos expériences

Moneris
  • Star
  • Star
  • Star
  • Star
  • Star
 
Cliquez pour noter
ou