'Coding has over 700 languages', '67% of programming jobs aren’t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
Cognizant interview experience Real time questions & tips from candidates to crack your interview
Program Analyst
Cognizant
upvote
share-icon
2 rounds | 2 Coding problems
Interview preparation journey
expand-icon
Preparation
Duration: 1 month
Topics: Data Structures & Algorithm, Java Fundamentals, SQL, Numerical Ability, Python Fundamentals
Tip
Tip

Tip 1 : First clear programming fundamentals
Tip 2 : Then practice coding questions
Tip 3 : Now you can go with Data Structures and Algorithms
Tip 4 : You can prepare SQL daily 1-2 hr

Application process
Where: Campus
Eligibility: Above 6.5 CGPA
Resume Tip
Resume tip

Tip 1 : Only Mention technologies you have worked on.
Tip 2 : Highlight quick learner, hard working personality in resume

Interview rounds
01
Round
Medium
Online Coding Interview
Duration165 Minutes
Interview date16 Oct 2020
Coding problem0

Total time -2.45hr
45 mins was for coding round, in which we have to find errors in 7 codes.
The codes where pre written based on some problem, we just have to spot errors and make the code work correctly.

In the first 2hr we have numerical ability questions, mostly based on work and time, ages and profit and loss.
25 questions based on English grammar and sentences

02
Round
Medium
Face to Face
Duration60 Minutes
Interview date27 Nov 2020
Coding problem2

Timing - 1hr
Environment- Skype
Interviewer- with 10-25 year experience

1. String Palindrome
Easy
0/40
Asked in companies
UnacademyIBMPaytm (One97 Communications Limited)

Given a string, determine if it is a palindrome, considering only alphanumeric characters.

Palindrome
A palindrome is a word, number, phrase, or other sequences of c...
View more
Try solving now
2. Nth Fibonacci Number
Easy
0/40
Asked in companies
SnapdealAccentureTata Consultancy Services (TCS)

The n-th term of Fibonacci series F(n), where F(n) is a function, is calculated using the following formula -

    F(n) = F(n - 1) + F(n - 2), 
    Where, F(1) = 1, F(2) = 1
View more
Try solving now
Join the Discussion
1 reply
profile
4 months ago
def Fibonacci(n):

    if n<= 0:

        print("Incorrect input")

    elif n == 1:

        return 0
    elif n == 2:

        return 1

    else:

        return Fibonacci(n-1)+Fibonacci(n-2)
print(Fibonacci(10))
0 upvotes
0 replies
Reply
Similar interview experiences
company logo
Program Analyst
3 rounds | 4 problems
Interviewed by Cognizant
378 views
0 comments
0 upvotes
company logo
Program Analyst
2 rounds | 3 problems
Interviewed by Cognizant
519 views
0 comments
0 upvotes
company logo
Program Analyst
2 rounds | 3 problems
Interviewed by Cognizant
269 views
0 comments
0 upvotes
company logo
Program Analyst
2 rounds | 3 problems
Interviewed by Cognizant
320 views
0 comments
0 upvotes