Friday, October 24, 2025
HomeData Modelling & AIVeritas Interview Experience | Set 2 ( On Campus )

Veritas Interview Experience | Set 2 ( On Campus )

Veritas visited our college for campus hiring. The CTC offered was 9.26 LPA. There were a total of 105 candidates eligible for the recruitment test. The selection process included an aptitude test, 2 tech interviews, and HR interview.

ROUND 1:(Aptitude+Technical test)

The aptitude test was on HackerRank.
It had 20 MCQs based on CS concepts, C/C++ output questions, oops concepts(constructor, inheritance, overloading, overriding), etc.
There were also 2 coding questions:-
Q.1 Write a function to detect a loop in the linked list. return “YES” or “NO”.
Detect loop in the linked list
Q.2 Write a function to delete all those nodes in the linked list which contain data greater than a value k. return head node.
My approach was to
1) Traverse the LinkedList using two pointers prev & curr.
2) When curr value is greater than k, make prev->next point to curr->next.
3) Delete curr node.
4) Make new curr point to prev->next.
5) Repeat till curr is not NULL.
There were some more edge cases to be covered.

Round 1 was easy. Around 30 students out of 105, were shortlisted for the Tech interview. All those who passed all the test cases of both the coding questions easily were selected, few with partial submission were also selected.

ROUND 2: Technical Interview

Q.1 Tell me about yourself. (Just a formality, interviewer is thinking about questions to ask)
Q.2 Rate yourself out of 10 in following subjects:
C, C++, OOPS, OS, System programming / Compiler Design, Quality Testing.
Q.3 Storage Classes
Q.4 Stack and Heap memory representation
Q.5 Bombarding of OOPS Concepts
Inheritance in depth,
access specifiers,
difference between privately, publicly, protected inherited
Output questions
Q.6 Pointers in depth. much attention paid to syntax.
dereferencing
double pointers
Q.7 This question on ternary search
Q.8 Middle element in linked list
Q.9 Explain all sorting techniques you know.
Q.10 Write code for Insertion sort
Q.11 Merge sort linked list

ROUND 3: Technical Interview-II

Q.1 Tell me about yourself.
Q.2 Projects Discussion.
Q.3 Booting process in OS.
Q.4 Linux commands.
Q.5 Process vs Threads
Q.6 Mutex vs Semaphore
Q.7 Paging in OS in depth
Q.8 Practical use of paging and segmentation.
Q.9 Reverse words in a sentence without using any extra space.

ROUND 4: HR Interview

Q.1 Tell about yourself.
Q.2 Extracurriculars.
Q.3 Why Veritas?
Q.4 Areas who need to improve?
Q.5 Where do you see yourself after 5 years?
Q.6 Strengths and weaknesses.
Some more typical HR questions.
Then they say “YOU ARE SELECTED”

All of the students who made it till the HR Round were selected. Overall, 7 were selected from 30.

This article is contributed by Virendra Singh Bais. If you like neveropen and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the neveropen main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!

RELATED ARTICLES

Most Popular

Dominic
32361 POSTS0 COMMENTS
Milvus
88 POSTS0 COMMENTS
Nango Kala
6728 POSTS0 COMMENTS
Nicole Veronica
11892 POSTS0 COMMENTS
Nokonwaba Nkukhwana
11954 POSTS0 COMMENTS
Shaida Kate Naidoo
6852 POSTS0 COMMENTS
Ted Musemwa
7113 POSTS0 COMMENTS
Thapelo Manthata
6805 POSTS0 COMMENTS
Umr Jansen
6801 POSTS0 COMMENTS