Accenture Software Developer Intern Interview Questions and Answers

It is easy and not that much tough.

Both questions from strings

Q1. Introduce yourself
Ans. 
I am a passionate software developer with experience in Java, Python, and web development.
• Experienced in Java and Python programming languages

• Proficient in web development technologies like HTML, CSS, and JavaScript

• Currently pursuing a degree in Computer Science
Answered by AI
Add your answer
Q2. Projects
Add your answer

Blood relation, date and time

Beginner level questions

Q1. Repeat what's written on the screen
Add your answer
Q2. Repeat what you hear
Add your answer

Q1. Basic Introduction questions, followed by technical interview as well
Add your answer

English grammar - paragraph question answer, basic Maths questions - time series, distances, sequences. and technical questions related to sql & java

Q1. About projects, teamwork, experience, practical knowledge
Add your answer

Round duration - 120 Minutes
Round difficulty - Easy

Aptitude+Coding
Both the rounds were easy only student should have confidence in himself.
Coding Round 3 question-:
1.Array related
2.Level order traversal
3. Graph

Q1. 
Sum At Kth Level
Given the root of a binary tree, calculate the sum of all nodes located at the Kth level from the top. Consider the root node as level 1, and each level beneath it sequentially increases ...read more
Ans. Inorder Traversal.
The idea is to do an inorder traversal of the tree, and at each level, we go down, reduce K by 1, and all the states where K = 1, add that node's value in our answer, and recursively do this for all the nodes at Kth level.
 
The steps are as follows: 
• If the ‘root’ is NULL return 0, since that node does not exist.
• If K is equal to 1, then return current nodes data because the given node is at th...read more
Answered Anonymously
Add your answer
Q2. 
Maximum Subarray Sum Problem Statement
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Out...read more
Ans. Brute Force Approach
1. Create a nested loop. The outer loop will go from i = 0 to i = n - k. This will cover the starting indices of all k-subarrays
2. The inner loop will go from j = i to j = i + k - 1. This will cover all the elements of the k-subarray starting from index i
3. Keep track of the maximum element in the inner loop and print it.
Space Complexity: O(1)Explanation:
O(1) because the extra space being used (looping vari...read more
Answered Anonymously
Add your answer
Q3. 
Number of Triangles in an Undirected Graph
Determine how many triangles exist in an undirected graph. A triangle is defined as a cyclic path of length three that begins and ends at the same vertex.
Input...read more
Ans. Brute Force
We call a cycle triangle if its length is 3. So all we need to do is find three vertices such that they all share an edge with each other. In order to find that cycle, we can fix three-pointer ‘i’ , ‘j’ , ‘k’.
If there is an Edge between (i, j), (j, k), and (k, i) then we will add this cycle to our answer.
Algorithm : 
• Initialize first pointer ‘i’ with 0 value, it will loop till ‘V’ where V is the number o...read more
Answered Anonymously
Add your answer