Dolat Capital

Interview Experience
─

Eligibility Criteria
Branch: CS & IT
CGPA: 7+
Class X: 65% and above
Class XII: 65% and above
 1

Hiring Workflow
There were a total of 3 rounds.
1. Online Assessment (7th August)
2. Technical Interview (offline, at their office) (8th August)
3. HR interview (offline, at their office) (8th August)

Online Assessment
There were 2 sections. Both sections had 2 questions each. Only C++ language was allowed
in coding questions. Sections were made for name sake. Both had the same types of
questions.
1. Hashmaps: Required Elements Difficulty: Easy
You are given an array of size N and a positive integer M. For the elements with a
frequency less than M, you must change the frequency of such elements by adding
the respective elements to the array so that its new frequency equals M.
Print the total sum of frequencies of each element required to make each element’s
frequency equals to M.
I was able to solve the questions. All the test cases passed.
2. Class Average Difficulty: Medium
The question was to create a class Avg with following requirements
a. It should compute the average of numbers passed to function getAvg().
b. Average calculation should consider only the last N out of M inputs.
Inputs were N: elements to be considered for avg calculation, and M: input count for
current test case.
For ex, say you are given N = 3, and M = 6
Arr[] = {1000, 2000, 3000, 4000, 5000, 6000}
Output: 1000, 1500, 2000, 3000, 4000, 5000
I was able to solve this question. All test cases passed.
 2

3. Passing Game Difficulty: Medium

I don't clearly remember the question. I will try to provide as many details as
possible below.
There are a total of N players who are playing ball passing. Their energies were
given with an array of size N. The players had some rules to pass the ball.
● If the player has positive energy, they pass the ball to the immediate right
player.
● Ball passing takes 1 second.
● Game ends if the player holding the ball has negative energy.
● After each pass, energy reduces by 1.
I was not able to give time to this question.
4. Next Greater Element Difficulty: Easy - Medium
Don't remember the exact question, but the question revolved around calculating
the next greater element in an array. I was able to solve this question with all test
cases passed. I will provide the link to this question below.
Next Greater Element (GFG)

A total of 15 students were shortlisted for next round.

Technical Interview (90 - 120 mins)

I would say, the technical interview was quite difficult. There were 2 interviewees. It majorly
involved checking your command on OOPS especially in C++. The interview was quite
conceptual. They went in depth to ask about the OOPS concept and majorly covered all the
topics in OOPS. That's why the interview was quite long. Their requirement was that you
must know C++. They also asked 2 DSA questions. They also asked me 2-3 questions where
they gave a code and I was supposed to predict the output. More about those questions
will be discussed below. Below are various questions they asked me in the interview. There
was a LOT of cross questioning, checking your capabilities and skills in C++ and OOPS.

1. They started with my introduction.

2. From my resume (also I mentioned in my intro), they asked me about my internship,
what work I did, and what my learnings were.
3. They then asked me a bit about my projects (not that much in detail).
 3

4. Now they started asking me OOPS concepts, starting with: What are various features
of OOPS.
5. What advantages to OOPS provide over procedural language. They asked me to
explain this with an example.
6. Then they asked about the pillars of OOPS.
7. Asked me to explain inheritance in detail
8. Types of inheritance.
9. Asked about various access modifiers. From that they tried to trick me with an
example which involved a friend function. I don't remember exactly how, but they
were trying to check my knowledge about friend function and how it is different
from inheriting a class.
10. Then they asked what if they make a friend function static.
11. Then asked me what exactly are static functions.
12. They asked how the memory sharing takes place between various objects for static
member variables.
One of the trick questions they asked me was: There is a class which has one static
member variable. Now he created an object of that class first dynamically using
“new” and then another object normally. He asked where the memory for static
members would be assigned. The answer was simple :) Static members are assigned
memory in the stack as soon as the program starts running, unlike other variables
who are assigned memory when an instance of that class is created.
13. Asked me if friend functions are mutual or not.
14. They also asked what is a diamond problem in inheritance and how is it resolved
(using virtual classes).
One important thing to note is that all the questions i mentioned above and
the questions which i am going to mention further, they asked me to write
codes for each of them wherever possible. They asked me to take any example
I like and demonstrate the code and tell what the output will be. They also
asked me to change code sometimes and then predict the new output.
15. Then they jumped to polymorphism. Here they asked me almost everything about
polymorphism.
16. First he asked what are the types of polymorphism.
17. They asked me to code function overloading and operator overloading with an
example they gave.
18. Then they asked me about function overriding. A lot about virtual functions.
19. Here also they asked to code it and then asked to make changes to code to trick me.
They asked how to declare virtual functions (private or public). Then the question
which I expected, was asked, what if it is declared private.
20. They asked me what if virtual functions are made static. They asked if it was possible
to do so. I didn't know about this concept, which i told clearly. Then they asked me
to think logically about it and then try to answer with the knowledge that I have. I
 4

played around a bit, and answered the question which i don't if it was correct. They
then moved on to the next topic.
21. The next topic was constructors and destructors. They started with: what are
constructors and destructors.
22. Asked, if they have any return type.
23. In which case the destructor is not called (in case of dynamic allocation).
24. Then they asked if we wrote our own constructor with some arguments, and then if
we declare an object without any arguments then will it run (ans is NO, it throws an
error).
25. More questions involving virtual function, constructors, static functions and their
permutation combination with each other were asked.
26. Between these questions they asked me 2-3 outputs of the code they already had.
These codes included pointers concepts like pointer, double pointer, dereferencing,
and pass by reference.
27. They also asked me about double pointers. Then about the difference between pass
by value and pass by reference. Asked me the difference between a reference
variable and a pointer.
28. Then they asked me 2 DSA questions back to back.
29. Question was to add two numbers which are represented as a linked list, and give
their sum again as a linked list.
For example,
Say to you are given 123 + 45. 123 is given as a LL, 1 -> 2 -> 3, and similarly 45. Then
you were supposed to return 1 -> 8 -> 6.
I was able to explain this question to them.
They also asked me to code it completely.
30. Then they asked me to code Insertion Sort.

With this my interview ended. It went on for approximately 2 hours. I would say the
difficulty level was medium - hard. But if you have a good knowledge of oops, then it
is really easy. DSA questions were not that tough.
For practicing OOPS and DBMS you can follow Love Babbar’s Roadmap from the
whimsical website. That will be more than enough. I will provide the links to them at
the end.
 5

HR Interview (15 - 20 mins)

Almost everyone was sent to an HR interview. It took place as soon as your technical
interview was over. HR interview involved basic HR questions which are asked in all
interviews. It included questions like, where do you see yourself in 5 years, what do you
know about the company, how did your technical interview go, asked a bit about projects,
and asked if i know the compensation for the job, the job role and basic stuff. These
questions are quite common which can be found on various websites. The HR interview
was not a big deal, the main round was technical interview.
A list of 5 selected candidates came at 9 at night and I was very happy to see my name on
that list.

Final Thoughts
The role that company was offering was Software Developer role. They have all their
softwares and technologies majorly in C++. That's why they wanted a student with good
command in C++ and OOPS. DSA questions which they ask majorly involve linked list and
sorting algorithms.
Overall it is a really good company which offers a really good package of 21 lakhs and a
very good role of software developer.

References
DSA: Strivers SDE Sheet
OOPS: Love Babbar's OOPS roadmap
DBMS: Love Babbar's DBMS Roadmap