Daffodil Software Interview Experience for Software Developer | On-Campus

Daffodil visited our campus in September 2019 for the post of software developer. They offered 3.5 lpa to 5 lpa for software developer. The detail description of interview as follows:

Round 1: Online Coding Round

In this round we had to solve 3 coding questions on hackerearth within 1 hour. Each question were of 10 marks.



  1. Question on binary number. The input is n binary number in n different rows, find the unrepeated binary row.
  2. Question on Array. We have to find number of pairs in the array whose sum is equal to a given value.
  3. Question on String. Swap the adjecent character of String and print new String.

Questions were easy but the test cases were bit annoying. I did not clear all the test cases of 2 and 3 question. They selected 40 students out of 200 students.

Round 2: Technical Interview Round

Easy to moderate level questions.

Topics: DBMS, OS, Network, DS, OOPs, C/C++ and pattern printing.

My questions were:

  1. Round Robin Scheduling
  2. Abstraction vs Encapsulation
  3. B-Tree vs AVL tree
  4. Doubly circular Linked list (Only properties not implementation)
  5. Super key
  6. Primary key vs Foreign Key
  7. Joins in SQL
  8. Left join and Right join
  9. SQL query to fetch 2nd highest salary
  10. 2 array merging in sorted order
  11. and some easy patterns to draw on paper.

After Technical round, they had selected only 5 candidates.

Round 3: HR round.

This round is very easy.

  1. Tell me something about yourself.
  2. Discussion about bond.
  3. About Daffodil.
  4. Something to ask.

All the 5 Students got offers from Daffodil software.

Write your Interview Experience or mail it to contribute@geeksforgeeks.org



My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.