Topic Difficulty
Hard Binary Indexed Tree OA Questions
Practice 12+ hard Binary Indexed Tree coding questions from real online assessments. Filter by company, solve in the OAHelper editor, and prepare for company-wise OAs.
Median Path Sum From The RootgoogleHardInversion Counts Across Every Cyclic Value ShiftadobeHardTotal Client Waiting Time in a Craft Queuedeutsche bankHardMinimum Swaps to Form SubarraydeshawHardTrain Reservation Reroute AuditorciscoHardOdd queriesnokiaHardMaximum Subsequence Sum with Inversion ConstraintinfosysHardSatellite Signal ProcessinginfosysHardTown Network Population CountingboeingHardCompetitor Comparative ScoreamazonHardCode Question 2amazonHardDistribute Elements Into Two Arrays IIvisaHardVillage Route Population Sum QueryuidaiHardThe best subsequenceuidaiHardProductive Team of Four WorkersamazonHardTown Network Population CountingmoveinsyncHardTricky SubarraysgoogleHardAnomalous Pairs in Alert ArrayhashedinHardKth Next greater element for each index in an arrayklaHardVillage Route Population Sum QueryteradataHardOrder of People HeightsmedianetHardBridge Crossing Problemnk securitiesHardPacking EfficiencyamazonHardWater Pipeline Cost ManagementjuspayHardFunny Jumping GameinfosysHardQuestion 10nk securitiesHardCity populationkompriseHardGet Minimum RemovalsamaoznHardMinimum Removals to Stay within BudgetamazonHardGet Subarray MedianamazonHardSubarray Median CountamazonHardSum of Beauty of Increasing SubsequencesinfosysHardInternet Service Provider Cable ManagementjuspayHardCount Swaps During Custom SortinguberHardSort the arraygoogleHardFire nation's fury ImedianetHardSum of Indices for Good SubarraysinfosysHard