Passa al contenutoPassa al piè di pagina
  • Lavori
  • Aziende
  • Stipendi
  • Per le aziende

      Migliora la tua carriera

      Scopri le tue potenzialità di guadagno, trova lavori da sogno e condividi approfondimenti su lavoro e vita privata in forma anonima.

      employer cover photo
      employer logo
      employer logo

      ZestMoney

      Questa è la tua azienda?

      Circa
      Recensioni
      Stipendi e benefit
      Lavori
      Colloqui
      Colloqui
      Ricerche correlate: Recensioni su ZestMoney | Offerte di lavoro di ZestMoney | Stipendi di ZestMoney | Benefit di ZestMoney
      Colloqui di ZestMoneyColloqui per Software Development Engineer presso ZestMoneyColloquio di ZestMoney


      Glassdoor

      • Chi siamo
      • Contattaci

      Aziende

      • Account Business gratuito
      • Spazio per le aziende
      • Blog per le aziende

      Informazioni

      • Aiuto
      • Linee guida
      • Condizioni d'uso
      • Privacy e scelte pubblicitarie
      • Non vendere né condividere le mie informazioni
      • Strumento per l'accettazione dei cookie

      Lavora con noi

      • Inserzionisti
      • Carriere
      Scarica l'app

      • Cerca:
      • Aziende
      • Lavori
      • Località

      Copyright © 2008-2026. Glassdoor LLC. "Glassdoor," "Worklife Pro," "Bowls" e il relativo logo sono marchi registrati di Glassdoor LLC.

      Aziende seguite

      Non lasciarti sfuggire opportunità e informazioni privilegiate seguendo le aziende dove vorresti lavorare.

      Ricerche di lavoro

      Ricevi suggerimenti e aggiornamenti personalizzati avviando le tue ricerche.

      Le migliori aziende per "stipendio e benefit" vicino a te

      avatar
      Barclays
      3.8★Stipendio e benefit
      avatar
      Standard Bank Group
      4.0★Stipendio e benefit
      avatar
      Agibank
      4.0★Stipendio e benefit
      avatar
      Jack Henry & Associates
      3.7★Stipendio e benefit

      Colloquio per Software Development Engineer

      13 ago 2021
      Candidato anonimo a colloquio
      Nessuna offerta
      Esperienza negativa
      Colloquio facile

      Candidatura

      Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso ZestMoney

      Colloquio

      Avoid they want you give answers which is there in GeeksForGeeks. Worst interview experience. Don't waste your time by giving interview here. 1. Hackerrank 2. Tech 1 3. Tech 2 4. System Design / HM 5 .HR

      Altre recensioni di colloqui per Software Development Engineer presso ZestMoney

      Colloquio per Software Development Engineer

      15 set 2022
      Candidato anonimo a colloquio
      Offerta rifiutata
      Esperienza positiva
      Colloquio nella media

      Candidatura

      Ho presentato la mia candidatura tramite segnalazione di un dipendente. Ho sostenuto un colloquio presso ZestMoney

      Colloquio

      Got the opportunity through referral FrontEnd 3 Rounds - Problem solving JS Problem Solving React Low level design around a front end security Culture Fit round Interview process is fine and feedbacks are provided after each round

      Domande di colloquio [1]

      Domanda 1

      Basics of JS and a react app.
      Rispondi alla domanda

      Colloquio per Software Development Engineer I

      11 feb 2021
      Candidato anonimo a colloquio
      Bengaluru
      Nessuna offerta
      Esperienza negativa
      Colloquio difficile

      Candidatura

      Ho presentato la mia candidatura online. La procedura ha richiesto 5 giorni. Ho sostenuto un colloquio presso ZestMoney (Bengaluru) nel mese di feb 2021

      Colloquio

      1. Round 1 was a HackerRank test. Average Questions 2. Round 2 was Technical Interview on Problem Solving / DS / Algorithms. In this round, HR send a SDE 1 named Himanshu Gera to take the interview. He first of all asked me recent projects, I described a generic system of Multilingual support and he didn't find it interesting. Then started the coding questions, they were 2 in total. 2.1 Find max sum of a subsequence in array such that adjacent elements don't need to be considered. When he said to dry run the concept of the solution, I started, then in mid the interviewer suddenly asks "Are you copy pasting the solution from somewhere ?" then I asked "Is this question on Internet ?" Point if I am able to describe and dry run the solution then also they think that candidate is cheating. And they want to confirm whether interviewee know that the solution which he is giving do the interviewee even know that what paradigm it is called (In this case DP) To confirm that I am cheating or not, he said to write the solution with recursive approach and not the iterative one. The interviewer wasn't convinced until I proposed DP solution in this. 2.2 There is a matrix composed of either "." or "#", we have to traverse through "." from top left cell to bottom right cell with minimum steps. the min steps cannot be more than k. We can move left, right, top, bottom in a step. I started with DFS solution, then since interviewer wasn't convinced so I thought whether solution with DP is possible and till end I wasn't able to find it and interviewer didn't helped in solution instead he was focused on finding flaws or providing test case where DP solution can break. I wonder if even interviewer also had a better solution. So, in a nutshell, It was 1st interview of SDE 1 role and all the solution the interviewer wants is in DP and that too where interviewer has 1 year experience in Software Development and more in Cloud Support in AWS, he thinks interviewee is cheating and this support guy needs all solutions in DP. So my suggestion is first check whether the guy you are sending for interview, is he capable of taking interview of an interviewee. Also review your work culture because from interview it seemed like an interviewer who himself is SDE 1 will not give go ahead to the candidate who has better experience than interviewer for SDE 1 role.

      Domande di colloquio [1]

      Domanda 1

      Find max sum of a subsequence in array such that adjacent elements don't need to be considered. There is a matrix composed of either "." or "#", we have to traverse through "." from top left cell to bottom right cell with minimum steps. the min steps cannot be more than k. We can move left, right, top, bottom in a step.
      Rispondi alla domanda
      6