GeeksforGeeks Question · Aug 2017 · Los Angeles

Veritas Interview Experience | Set 3 (On-Campus Aptitude Questions)

SWE Technical

Question Details

Veritas visited our college for campus hiring, 30th August, 2017 . The selection process included aptitude test and Personal Interview round.Aptitude Test consisted of 20 ...

Full Details

Veritas visited our college for campus hiring, 30th August, 2017 . The selection process included aptitude test and Personal Interview round. Aptitude Test consisted of 20 questions based on: 1) Bitwise shift operator. 2) Pointer basics. 3) Object oriented concepts based on C++. 4)

Output based questions on C and C++. 5)

Coding round was also included in this 1 hour round and one who solved it got selected for further process. There was only one question which was based on bit manipulation. For Examples are given below: Give the output of the following: C //Write C code here #include int main () { int i = 5 , j = 2 ; printf ( "%d %d " , i << j , i >> j );

return 0 ; }

Output: 20 1 MCQ question with 4 options: C #include using namespace std ; class test { public : int upper , lower ; public : test () : upper ( 5 ), lower ( upper + 1 ) { } }; int main () { test obj ; cout << obj . upper << obj . lower << endl ;

return 0 ; } options: a) 65 b) 56 c) 5some garbage value d) Error Answer: b) 56 Choose up the correct optiotn: if (x & (x-1) == 0) then, a) a is an even number b) a is a power of 2 c) a is an odd number d) Nothing can be decided. Ans: b) a is a power of 2 At last there was one coding question which was as follows:(We had to complete a function only) 1) Given a decimal number, count the number of set bits i.e. 1, in its binary representation and return an array from the function which has the following format: a) The array[0] will contain the number of set bits in the binary representation of the number. b) The remaining elements of the array should be the position of the set bits in the binary representation.

Explanation: Let we have a number n = 161. Its binary representation is as follows: 1 0 1 0 0 0 0 1 So the array should be ass follows: array[0] = 3 (i.e. number of set bits ) array[1] = 1 (position of the first set bit as seen from MSB to LSB) array[2] = 3 (position of the second set bit as seen from MSB to LSB) array[3] = 8 (position of the third set bit as seen from MSB to LSB) There were total 147 students out of which 37 were selected for PI round.

Free preview — 6 questions shown. Unlock all Veritas questions →

About This Question

This is a reported interview question from a veritas interview for a swe role during the technical round reported in 2017.

It covers the following topics: Bit Manipulation, Sql, Oop, Arrays .

Topics

Bit Manipulation Sql Oop Arrays

About Veritas Interview Reports

This question was reported by a candidate who interviewed at Veritas. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.

Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Veritas are the higher-signal extractions to take from this report.

For broader preparation context, the Veritas interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.

How To Practice This Type of Question

Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.

Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Veritas reports consistently are the ones worth investing in; one-off niche problems are not.

During Your Veritas Round

Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.

The single most predictive failure mode in Veritas reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.