Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Paytm (Noida) nel mese di nov 2016
Colloquio
A written round consisting of around 30 Questions. Those who qualified had to go through two face to face rounds. The written round was of moderate difficulty. The face to face round was more aligned towards the projects mentioned in the resume
Domande di colloquio [1]
Domanda 1
How do hashmap work? How do concurrenthashmap work?
Ho presentato la mia candidatura online. La procedura ha richiesto 2 giorni. Ho sostenuto un colloquio presso Paytm nel mese di ott 2024
Colloquio
Interviewer helpful and polite. supportive
He introduces him self and expect same from me
Interview seems like pure DSA round if you are good at optimizing the code then you can easily crack the interview
Domande di colloquio [1]
Domanda 1
Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
An input string is valid if:
Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order.
Every close bracket has a corresponding open bracket of the same type.
Example 1:
Input: s = "()"
Output: true
Example 2:
Input: s = "()[]{}"
Output: true
Example 3:
Input: s = "(]"
Output: false
Example 4:
Input: s = "([])"
Output: true
Given an array of size N filled with numbers from 1 to N-1 in random order. The array has only one repetitive element. The task is to find the repetitive element.
Examples:
Input: a[] = {1, 3, 2, 3, 4}
Output: 3
Explanation: The number 3 is the only repeating element.
Input: a[] = {1, 5, 1, 2, 3, 4}
Output: 1
Brute Force To Optimization
It was quite easy to clear first round with basic understanding of algorithms.
The second round was comparatively though. The interview was online(google meet), and the interviewer was quite good and helpful at times.
Ho presentato la mia candidatura online. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Paytm (Nuova Delhi) nel mese di giu 2020
Colloquio
First round ds & algo-check if a tree is bst,Find missing no,find element in rotated sorted array,find smallest positive.It was very noisy at interviewer's end.A lot of hammering and screeching was going on.I asked twice to shift but wherever she went it became more disturbing.Pathetic interview process.Don't make mockery of candidate's expectations.
Domande di colloquio [1]
Domanda 1
check if a tree is bst,Find missing no,find element in rotated sorted array,find smallest positive