This is a verified interview question from Accenture. Candidates reporting seeing this problem in recent Online Assessments (OAs) and onsite rounds. Mastering "DSA Question Accenture - IIT Hyderabad" covers key patterns like Other.
"**Mode:** On-Campus **Exam Pattern:** 1 dsa +1 sql+1 web dev(html,css ,js) **OA Date:** 2026-10-10 1 sql query : join 3 tables ,use of group by , IS NULL , and multiple join conditions , the schema is too complex to understand 1 web dev (html,css, js): hints are given for each , like change the colour from this to this , every thing is clearly written in comments , same. for js part as well, {for practise : just go through the basics , what component it is ,and write the code 3,4 times , that's it, i don't think for html and css you need to practise, just go through the js practice} ## Dsa question Problem Statement You are given N trees and K units of total water. Each tree initially requires M units of water. For the ith tree: - array1[i] denotes the number of additional times the tree needs to be watered. - array2[i] denotes the amount of water required during each additional watering. The total water required by the ith tree is: M + (array1[i] × array2[i]) Calculate and return the amount of water remaining after watering all N trees. If the total water required is greater than K, return 0. Input: - An integer N, representing the number of trees. - An integer K, representing the total available water. - An integer M, representing the initial water requirement of each tree. - An array array1 of size N. - An array array2 of size N. Output: Return the remaining amount of water: max(0, K - totalWaterRequired)"
Join thousands of developers practicing for Accenture.