Accenture interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Accenture
2 rounds | 4 Coding
problems
Rejected
Interview preparation journey
Journey
My journey began with learning programming languages like C, C++, and Java, gradually progressing to web development and problem-solving through competitive programming, projects, and internships. Along the way, I explored frameworks like React, honed technical skills, and improved communication and teamwork. Preparing for Accenture, I focused on aligning my skills with its core values of innovation and collaboration. I worked on impactful projects, learned from challenges, and gained hands-on experience that strengthened my confidence. This journey taught me persistence, adaptability, and the importance of continuous learning, shaping me into a well-rounded individual ready to contribute meaningfully in a dynamic environment.
Application story
The Accenture on-campus recruitment process was a valuable learning experience. It began with an online test assessing aptitude and technical skills, followed by a technical interview that allowed me to discuss my technical knowledge and problem-solving abilities. This journey enhanced my confidence and prepared me for future opportunities.
Why selected/rejected for the role?
I was not selected for the role because I lacked confidence in explaining my thought process during one of the coding questions. While I had a good understanding of the underlying concepts, I struggled to effectively communicate my approach and reasoning to the interviewer. Also I was not able to solve one interview question given to me by the interviewer.
Preparation
Duration: 1 month
Topics: Arrays, Strings, Trees, LinkedList, OOPS, DBMS, API Integration, Version Control
Tip 1: Collaborate on GitHub projects to showcase your skills, learn teamwork, and gain real-world coding experience.
Tip 2: Practice at least 100-150 coding questions to strengthen problem-solving skills on platforms like Coding Ninjas.
Tip 3: Simulate interview scenarios to improve problem-solving, communication, and time management under pressure.
Application process
Where: Campus
Eligibility: Above 7 CGPA (Salary package: 4.5 LPA)
Tip 1: Have 3 unique and full stack projects according to the role applying to.
Tip 2: Avoid including inaccurate information on your resume.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration80 minutes
Interview date10 Sep 2024
Coding problem2
There were 60 MCQs based on vocabulary, aptitude, MS office and 2 coding problems to solve.
1. Second largest element in the array
Easy
15m average time
80% success
0/40
Asked in companies
Given an array of integers, find the second largest element in the array. If there is no second largest element, return -1.
Problem approach
Array: [12, 35, 1, 10, 34, 1]
Start with largest = -1 and second_largest = -1.
First element: 12 becomes the largest (largest = 12).
Next element: 35 is greater than 12, so 35 becomes the largest, and 12 becomes the second largest (largest = 35, second_largest = 12).
Next elements (1, 10, 34) are smaller than 35 but greater than 12, so second_largest becomes 34 after processing all elements.
Final result: The second largest value is 34.
2. Team Game
Easy
0/40
Asked in company
You are given an array of characters, where each character represents the outcome of a game. The character 'A' indicates a win for Team A, and the character 'B' indicates a win for Team B. Your task is to count the number of wins for each team and determine which team has won the most games.
Problem approach
Array: ['B', 'A', 'B', 'B', 'A']
Initialize countA = 0 and countB = 0.
Traverse the array:
First element is 'B', so countB = 1.
Second element is 'A', so countA = 1.
Third element is 'B', so countB = 2.
Fourth element is 'B', so countB = 3.
Fifth element is 'A', so `countA = 2
02
Round
Medium
Video Call
Duration30 minutes
Interview date20 Sep 2024
Coding problem2
1. First non repeating character
Easy
15m average time
80% success
0/40
Asked in companies
You are given a string s. Your task is to find the first non-repeated character in the string and return it. If no such character exists, return -1.
Problem approach
Input: "level"
Count Frequencies:
'l' appears 2 times
'e' appears 2 times
'v' appears 1 time
First Non-Repeated Character:
The first character with a frequency of 1 is 'v'.
Output: 'v'
2. Longest Path
Moderate
25m average time
65% success
0/80
Asked in companies
Find the length of the longest path in a Directed Acyclic Graph (DAG) with N nodes and M edges.
Problem approach
I was not able to solve this question
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
SDE - 1
2 rounds | 3 problems
Interviewed by Accenture
Selected 
1512 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Accenture
Selected 1204 views
0 comments
0 upvotes
SDE - 1
2 rounds | 3 problems
Interviewed by Accenture
Rejected
1088 views
0 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by Accenture
Selected 3901 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
1 rounds | 2 problems
Interviewed by Tata Consultancy Services (TCS)
Rejected
0 views
0 comments
0 upvotes
SDE - 1
3 rounds | 4 problems
Interviewed by Tata Consultancy Services (TCS)
Selected 6877 views
0 comments
0 upvotes
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
Selected 6240 views
3 comments
0 upvotes