Accenture Coding Questions: 5 Coding Solutions for Freshers 2025
Accenture is one of the world’s leading consulting and technology services firms. For fresh graduates aspiring to join Accenture, preparing for the coding round is crucial as it tests your technical prowess, problem-solving ability, and coding skills.
In this guide, we’ll break down the important aspects of Accenture’s coding questions, focusing on key areas like coding, pseudo code, and problem-solving techniques, helping you prepare effectively for the coding round. We’ll also explore the previous year's coding questions and share valuable tips to crack the exam.
Overview of Accenture Coding Round
Accenture’s coding round typically involves solving a series of technical problems within a limited time frame. The questions generally test your proficiency in data structures, algorithms, and logical problem-solving. Here's a breakdown of the Accenture coding round structure:
Section |
Topics Covered |
Focus Area |
Recommended Preparation Time |
Problem-Solving |
Arrays, Strings, Searching, Sorting |
Tests basic algorithm skills and how you approach problems |
2-3 hours per day |
Data Structures |
Linked List, Stack, Queue, Trees |
Tests knowledge of fundamental data structures and their usage |
3-4 hours per day |
Algorithms |
Sorting, Recursion, Dynamic Programming |
Evaluates problem-solving approaches to complex algorithms |
3-4 hours per week |
Pseudo Code |
Problem Representation in Pseudocode |
Measures ability to logically represent solutions to problems |
1-2 hours per day |
Breakdown of Accenture Coding Questions
Accenture Coding Questions
Accenture’s coding questions typically consist of problems that require you to write code that solves real-world challenges. The types of questions you might encounter include:
Type of Question |
Description |
Example Topics |
Tips |
Algorithmic Problems |
Solving problems using algorithms like sorting, searching |
Sorting Algorithms, Binary Search, Merge Sort |
Focus on time complexity and edge cases. |
Data Structure Problems |
Working with data structures like arrays, linked lists |
Arrays, Stacks, Queues, Trees |
Practice implementing and manipulating data structures. |
Mathematical Problems |
Applying mathematical logic to solve problems |
Prime Numbers, Fibonacci Series, Factorials |
Use math-based functions and optimise for efficiency. |
Logical Problems |
Using logic to create efficient solutions |
Puzzles, number sequences, or logical deductions |
Understand the core logic and optimise the solution. |
Are you preparing for the upcoming Accenture Coding test? Click here to access coding practice sessions from moderate to challenging levels.
Accenture Pseudo Code Questions
In pseudo-code questions, you’ll be asked to represent a solution in a human-readable format before implementing it in a programming language. The objective is to assess your logical thinking and ability to plan before coding.
Topic |
Description |
Example |
Tips |
Problem Decomposition |
Breaking down a problem into smaller, manageable steps |
Write pseudo code to find the factorial of a number. |
Use simple structures like loops, conditionals, and function calls. |
Flow Representation |
Representing the flow of the algorithm without syntax errors |
Write pseudo code to reverse a string. |
Ensure clarity in representation, focusing on logic over syntax. |
Time Complexity Analysis |
Analyzing the time complexity of an algorithm before coding |
Pseudo code for finding the sum of an array using recursion. |
Think about efficient solutions using Big O notation. |
Accenture Previous Year Coding Questions
Studying the previous year's coding questions is an excellent way to prepare for Accenture’s coding round. Here’s a summary of common topics:
Year |
Question Type |
Topics Tested |
Difficulty Level |
2023 |
Data Structures |
Arrays, Linked List |
Moderate |
2022 |
Algorithms and Math |
Sorting, Prime Numbers |
Moderate |
2021 |
Dynamic Programming |
Fibonacci Series, Factorial |
High |
2020 |
Recursion and Searching |
Binary Search, Recursion Problems |
Easy |
2019 |
Logical & Analytical Problems |
Puzzles, String Manipulation |
Easy to Moderate |
Top 5 Coding Problems with Solutions
Problem Statement 1
Vikas is starting to study math for his class 10 boards, because unfortunately everything went offline. He is currently studying circles and geometry. He is stuck on a particular problem, and needs your help.
You are given an array points where points[i] = [xi, yi] is the coordinates of the ith point on a 2D plane. Multiple points can have the same coordinates.
You are also given an array queries where queries[j] = [xj, yj, rj] describes a circle centered at (xj, yj) with a radius of rj.
For each query queries[j], compute the number of points inside the jth circle. Points on the border of the circle are considered inside.
Print an array answer, where answer[j] is the answer to the jth query.
Constraints:
- 1 <= points.length <= 500
- points[i].length == 2
- 0 <= xi, yi <= 500
- 1 <= queries.length <= 500
- queries[j].length == 3
- 0 <= xj, yj <= 500
- 1 <= rj <= 500
- All coordinates are integers.
Input format:
First line of the input contains integer n (length of first 2D Vector) no of coordinate points.
Second line contain 2n (x,y) space separated integer values of first vector.
Third line contain integer value m (length of second 2D Vector) no of queries
Fourth line contain 3m (x,y,r) space separated integer values of second vector.
Ex:
4
1 3 3 3 5 3 2 2
3
2 3 1 4 3 1 1 1 2
Output Format :
Print an array answer, where answer[j] is the answer to the jth query.
Solution C++
Solution Python
Solution Java
Problem Statement 2
There are N employees in a company, each with a certain power level represented in a sorted array pow of size N. Each employee has been assigned a message, and they need to pass this message to the next employee under the following conditions:
If Employee A passes a message to Employee B, then Employee B can only pass that message to Employee C if and only if the difference in power between A and B is equal to the difference in power between B and C.
Your task is to determine the maximum number of employees that can be part of a continuous message-passing sequence under these conditions.
Constraints :
1 <= N <= 10^3
1 <= pow[i] <= 10^4
Input Format :
The first line of input contains a single integer N representing the number of employees.
The second line of input contains N space-separated integers representing the power levels of the employees in a sorted array pow.
Output Format:
Print the maximum number of employees that can pass the same message in a sequence.
Solution C++
Solution Java
Solution Python
Problem Statement 3
You are a shopkeeper and bought N pairs of socks of several colours in bulk. The colour of each pair of socks is represented as a non-negative integer. The socks are sold as sets of 3 each. A set of socks consists of 3 socks of the same colour.
You want to find the number of different sets that can be made from the N pairs of socks you bought today.
Note: order of indices of sock pairs in the set does not matter.
Question Constraints:
1 <= N <= 105
0 <= ai <= 10^3
Input Format:
The first line of the input contains a single integer N which denotes the number of pairs of socks that you have.
The second line of the input contains n space-separated integers a1, a2, …, an, where ai represents the colour of the ith pair.
Output Format:
Print a single integer representing the total number of different sets of 3 socks that can be formed from the N pairs of socks.
Solution C++
Solution Python
Solution Java
Problem Statement 4
Alex and Carrie are playing a binary game. In this game, Alex gives Carrie a number, and Carrie's task is to start from 0 and incrementally go up to the given number N. For each number in this range, Carrie must count the number of 1s in its binary representation.
Question Constraints:
1 <= N<= 5*10^6
Input Format:
The input consists of a single character representing the number N.
Output Format:
Print a vector where each element is the count of 1s in the binary representation of numbers from 0 up to N.
Solution C++
Solution Python
Solution Java
Problem Statement 5
Alex and Carrie are playing a binary game. In this game, Alex gives Carrie a number, and Carrie's task is to start from 0 and incrementally go up to the given number N.
For each number in this range, Carrie must count the number of 1s in its binary representation.
Question Constraints:
1 <= N<= 5*10^6
Input Format:
The input consists of a single character representing the number N.
Output Format:
Print a vector where each element is the count of 1s in the binary representation of numbers from 0 up to N.
Solution C++
Solution Python
Preparation Tips for Accenture Coding Round
- Focus on Core Data Structures and Algorithms: Strong understanding of arrays, strings, sorting, searching, and dynamic programming is crucial. Practice coding problems on platforms like LeetCode, HackerRank, and CodeSignal.
- Practice Time-Management: Accenture coding rounds are time-bound. Practice solving problems within a limited timeframe to simulate real exam conditions.
- Work on Problem-Solving Skills: Before jumping into coding, take time to break down the problem logically. Write pseudocode, and only then move to actual coding. This approach helps in managing complex problems.
- Review Previous Year’s Coding Questions: Solving previous year's coding questions can help you identify common problem types and the level of difficulty you can expect during the test.
- Improve Coding Speed: Focus on improving your coding speed without compromising on accuracy. Regular practice of coding challenges will help you build speed over time.
Conclusion
The Accenture coding round is designed to test your ability to solve complex problems efficiently using coding skills and logical reasoning. By focusing on data structures, algorithms, pseudo code, and problem-solving techniques, you can effectively prepare for this crucial part of the recruitment process.
Regular practice of coding questions, understanding time complexity, and working on pseudo code will greatly enhance your chances of cracking the Accenture coding round.
Frequently Asked Questions (FAQs)
1. What topics should I focus on for Accenture’s coding round?
Focus on core data structures (arrays, strings, linked lists), algorithms (sorting, searching), and problem-solving techniques such as recursion and dynamic programming.
2. How can I improve my speed in solving Accenture coding questions?
Practice coding regularly within a time limit, and work on improving your problem-solving approach by analysing the problem before coding.
3. Is pseudo code important in Accenture’s coding round?
Yes, pseudo code is important as it tests your ability to break down problems logically and represent solutions before coding them.
4. How many coding questions are there in the Accenture coding round?
The coding round typically consists of 2-3 questions, with a mix of algorithmic, data structure, and mathematical problems.
5. Where can I find the previous year's Accenture coding questions?
Previous year coding questions can be found on coding practice platforms, forums, and preparation websites available online.
Disclaimer: While we strive for accuracy, we do not guarantee its completeness or reliability. Readers are encouraged to verify all facts and statistics from the official company website or check independently before making decisions.
Suggested reads:
- Detailed Exam Syllabus of Accenture: A Guide for Freshers 2025
- Eligibility Criteria for Accenture: Freshers' Guide for 2025
- Accenture Technical Assessment 2025: A Detailed Guide for Freshers
- Latest Accenture Communication Assessment: A Guide for Freshers 2025
- Accenture Previous Year Papers: Placement Guide for Freshers 2025
Login to continue reading
And access exclusive content, personalized recommendations, and career-boosting opportunities.
Comments
Add comment