Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Daffodil Software (Kurukshetra) nel mese di set 2022
Colloquio
The placement consisted of a total of 3 rounds. The first was Online Assessment, the Second round was a technical interview and the third round was the HR round. The whole process was completed on that day itself
Domande di colloquio [1]
Domanda 1
Describing my projects.
React Life-cycle methods
how does express (Node.js) work
Difference between REST API methods – GET, POST, PATCH
different queries in MongoDB
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Daffodil Software (Nuova Delhi) nel mese di ago 2020
Colloquio
First round -> Machine Test : There were 3 coding questions of moderate level on hacker rank platform. You have to write code in java/python/c/c++ & other that was given. Minimum 1 or 2 questions you have to write in order to clear this test .
Technical round: There were 2 technical rounds.Approx 35-40 minute each. Questions were on oops,sql,programming questions was given to solve, data structure etc.
HR round : all about you , family,school , background etc. approx 45 minute.
Domande di colloquio [1]
Domanda 1
Data structure,OOps features, BSF ,DSF Code , sql queries : left ,right join, merge sort code , programming questions was given to solve related to array, fibonacci using recursion ,etc.
Ho presentato la mia candidatura online. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Daffodil Software (Gurgaon, Haryana) nel mese di ott 2019
Colloquio
Firstly there was a online test on HackerEarth platform, there were 3 questions about arrays and strings.
Secondly there was a pen-paper test and we have to solve to 2 questions in 30 minutes without using any libraries or collections.
Then in 1st technical round there were basic questions based on the resume. Some Data Structure questions were asked as well especially Linked List.
In 2nd technical round a complicated question to print a pattern was asked, enough amount of time was given to solve the question. A puzzle based question was asked along with some question about DBMS.
HR round consisted of basic questions such as hobbies, family background, preferred programming languages, etc.
Domande di colloquio [3]
Domanda 1
Write a function to get the intersection point of two Linked Lists?
