hirecept

Cognizant GenC Next and Pro: Higher-package tracks for Programmer Analyst Trainee

Cognizant's higher fresher tracks, GenC Pro and GenC Next, add harder coding on top of the GenC assessment. Sources disagree on the exact test (a two-problem coding section, an Automata Fix section, a SQL section) and on interview length, and pay figures differ by site. Always check Cognizant's official notice for your drive.

34 questions · 4 rounds · updated Nov 2026

How the interview works

  1. Online assessment: Aptitude, verbal, reasoning and communication; coding sections for the higher tracks.
  2. Coding and SQL: Automata Fix, two coding problems and sometimes SQL.
  3. Technical interview: OOP, DBMS and project; live coding for GenC Next.
  4. HR interview: Flexibility and background.

Sample questions

  • 01

    Walk me through the project on your resume you are most proud of.

    MediumProject

    Model answer

    What the interviewer checks

    Depth and ownership. Expect five or six follow-up "why" questions: why that database, what broke, what you would change at ten times the scale.

    How to answer

    Use this order and keep the first pass to two minutes: 1. Problem and user: "Students missed placement deadlines because updates were spread across WhatsApp groups." 2. What you built and your part: "A web app where the placement cell posts drives and students get reminders. I built the backend in Spring Boot and designed the MySQL schema." 3. One hard technical decision: "Reminders had to go out at exact times for 1,200 students. A cron job polling every minute duplicated messages when the job overran, so I moved to a queue with a unique key per student and drive, which made sending idempotent." 4. Result with a number: "400 active users; missed deadlines reported by the cell fell from about 30 a semester to 4." 5. What you would do differently: "Add tests earlier: a timezone bug reached production because we had none." Prepare answers for: the architecture diagram, the database tables, the hardest bug, how you tested it, how it would handle 100 times the users, and what each teammate did.

    Common mistakes

    • Describing only features, not decisions.
    • Not knowing parts of a group project you list as yours.
    • No numbers anywhere.
  • 02

    In an election between two candidates, the winner got 58% of the valid votes and won by 1,440 votes. How many valid votes were cast?

    MediumPercentages

  • 03

    Find the maximum sum of a contiguous subarray (Kadane's algorithm). Example: [-2,1,-3,4,-1,2,1,-5,4] → 6 (the subarray [4,-1,2,1])

    MediumArrays

    Approach and solution

    Approach

    Walk the array keeping the best sum of a subarray ending here: either extend the previous one or start fresh at this element. Track the best seen. Starting with the first element (not 0) handles all-negative arrays.

    def max_subarray(a):
        best = cur = a[0]
        for x in a[1:]:
            cur = max(x, cur + x)
            best = max(best, cur)
        return best
    
    assert max_subarray([-2, 1, -3, 4, -1, 2, 1, -5, 4]) == 6
    assert max_subarray([-3, -1, -2]) == -1

    Complexity: O(n) time, O(1) space.

31 more questions, members only

  • Online assessment12
  • Coding and SQL11
  • Technical interview6
  • HR interview5

Members also get how to answer each question and a preparation plan for this company.

See plans from ₹399

Every question and answer is written by Hirecept and the code is run before it is published. How a company runs its process comes from candidate reports and public pages, and companies change it, so treat that part as a guide, not a promise.