Accenture interview experience Real time questions & tips from candidates to crack your interview
Associate Software Engineer
Accenture
2 rounds | 3 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip 1 : Practice at least 100 questions of coding
Tip 2 : Practice Data structures questions.
Application process
Where: Campus
Eligibility: Above 7 CGPA
Tip 1 : Never lie about anything on resume
Tip 2 : Have some projects on resume
Interview rounds
01
Round
Easy
Online Coding Interview
Duration90 Minutes
Interview date8 Sep 2021
Coding problem2
MCQs- Aptitude + Quantitative ( if we clear this round then only we can go for coding round).
2 questions came in coding round
1. Armstrong Number
Easy
15m average time
85% success
0/40
Asked in companies
You are given an integer ‘NUM’ . Your task is to find out whether this number is an Armstrong number or not.
A k-digit number ‘NUM’ is an Armstrong number if and only if the k-th power of each digit sums to ‘NUM’.
Example
153 = 1^3 + 5^3 + 3^3.
Therefore 153 is an Armstrong number.
Problem approach
A positive integer of n digits is called an Armstrong number of order n (order is number of digits) if.
abcd… = pow(a,n) + pow(b,n) + pow(c,n) + pow(d,n) + ….
2. Check If The String Is A Palindrome
Easy
10m average time
90% success
0/40
Asked in companies
You are given a string 'S'. Your task is to check whether the string is palindrome or not. For checking palindrome, consider alphabets and numbers only and ignore the symbols and whitespaces.
Note :
String 'S' is NOT case sensitive.
Example :
Let S = “c1 O$d@eeD o1c”.
If we ignore the special characters, whitespaces and convert all uppercase letters to lowercase, we get S = “c1odeedo1c”, which is a palindrome. Hence, the given string is also a palindrome.
Problem approach
1) Find length of str. Let length be n.
2) Initialize low and high indexes as 0 and n-1 respectively.
3) Do following while low index ‘l’ is smaller than high index ‘h’.
…..a) If str[l] is not same as str[h], then return false.
…..b) Increment l and decrement h, i.e., do l++ and h–.
02
Round
Easy
HR Round
Duration20 Minutes
Interview date11 Sep 2021
Coding problem1
Basic Hr questions was asked.
This round mainly focus on projects
1. Basic HR questions
Q1. Tell me about yourself
Q2. Tell me about your projects.
Q3. What are your hobbies?
Q4. why do you want to join Accenture
Problem approach
Tip 1 : Do interesting projects
Tip 2 : Don't be overconfident.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
To make an AI less repetitive in a long paragraph, you should increase:
Choose another skill to practice
Similar interview experiences
Associate Software Engineer
3 rounds | 2 problems
Interviewed by Accenture
Selected 
3747 views
1 comments
0 upvotes
Associate Software Engineer
4 rounds | 10 problems
Interviewed by Accenture
Selected 2174 views
0 comments
0 upvotes
Associate Software Engineer
3 rounds | 11 problems
Interviewed by Accenture
Rejected
4985 views
1 comments
0 upvotes
Associate Software Engineer
4 rounds | 3 problems
Interviewed by Accenture
Rejected
371 views
0 comments
0 upvotes
Companies with similar interview experiences
Associate Software Engineer
2 rounds | 2 problems
Interviewed by Tata Consultancy Services (TCS)
Selected 5153 views
1 comments
0 upvotes
Associate Software Engineer
3 rounds | 5 problems
Interviewed by Tata Consultancy Services (TCS)
Selected 3313 views
2 comments
0 upvotes
Associate Software Engineer
2 rounds | 3 problems
Interviewed by Tata Consultancy Services (TCS)
Selected 2363 views
0 comments
0 upvotes