Company sheets › Cognizant
Cognizant interview preparation
IT services company with large campus programs for freshers. Freshers are hired into programs such as GenC, GenC Next and GenC Pro depending on test and interview performance.
Cognizant hiring process
- Online assessment — Quantitative, logical and verbal aptitude; the higher programs add coding and technical sections.
- Technical interview — Programming basics, OOP, DBMS / SQL and your projects.
- HR interview — Communication, flexibility and general questions.
The process changes from year to year — check the official notice for the exact pattern.
Aptitude topics to practise
- percentages
- profit and loss
- time and work
- time speed distance
- number series
- coding decoding
- blood relations
- reading comprehension
- averages
- ratio and proportion
Interview topics
Tips
- SQL queries (joins, GROUP BY, subqueries) are a common technical question — practise writing them, not just reading.
- For GenC Next / Pro, Medium-level DSA problems make the difference.
Cognizant DSA problems (41)
- Sum of Two Numbers — Easy
- Even or Odd — Easy
- Count Digits — Easy
- Reverse a Number — Easy
- Palindrome Number — Easy
- GCD and LCM — Easy
- Prime Check — Easy
- Sum of Digits — Easy
- Factorial — Easy
- Armstrong Number — Easy
- All Divisors — Easy
- Leap Year — Easy
- Decimal to Binary — Easy
- Perfect Number — Easy
- Prime Factorization — Easy
- Floyd's Triangle — Easy
- Star Pyramid — Easy
- Maximum in an Array — Easy
- Second Largest Element — Easy
- Check if Array is Sorted — Easy
- Remove Duplicates from Sorted Array — Easy
- Left Rotate by K — Easy
- Move Zeros to End — Easy
- Missing Number — Easy
- Max Consecutive Ones — Easy
- Merge Two Sorted Arrays — Easy
- Union of Two Sorted Arrays — Easy
- Reverse a String — Easy
- Check Palindrome — Easy
- Count Vowels — Easy
- Valid Anagram — Easy
- First Non-Repeating Character — Easy
- String Compression — Easy
- Check String Rotation — Easy
- Pangram Check — Easy
- Frequency of Elements — Easy
- Intersection of Two Arrays — Easy
- Maximum Sum Subarray of Size K — Easy
- Tower of Hanoi — Medium
- Minimum Coins (Greedy) — Easy
- Check if Kth Bit is Set — Easy