Topic Difficulty
Medium Binary Indexed Tree OA Questions
Practice 60+ medium Binary Indexed Tree coding questions from real online assessments. Filter by company, solve in the OAHelper editor, and prepare for company-wise OAs.
Fewest Adjacent Swaps to a Peak ArrangementsliceMediumMaximum Length Subarray Of ZerosgoogleMediumMaximum Length Zero SubarraygoogleMediumCount Scaled Dominant PairsoracleMediumPoints Scored From Every Starting LevelmeeshoMediumTeam Formation by Repeated Top-Window SelectionvisaMediumNumber of Longest Strictly Increasing SubsequencesmicrosoftMediumMaximum Squad ScorethoughtspotMediumMinimum Adjacent Swaps to Sort an ArraycoupaMediumObject CollisionvisaMediumTime-Versioned Key-Value StoreciscoMediumMinimum Shift-Swap TransformationsdeshawMediumArray TransformationdeshawMediumCount Bitonic SubsequencesatlassianMediumSmart Processor EfficiencyamazonMediumTemporal AnomaliesinmobiMediumDistinct Score Valuesat&tMediumCount Bitonic SubsequencesciscoMediumCount Increasing TripletsinfosysMediumNumber of Longest Increasing Subsequencespublicis sapientMediumNumber of NodesimpetusMediumBridge Weight Limitdeutsche bankMediumDynamic Tree Path SuminmobiMediumEldon's StonesinmobiMediumSmallest Peak Height DifferencevisaMediumFind Number of RetailersamazonMediumCode Question 1amazonMediumCount Swaps During Custom SortinguberMediumSchedule Ride RequestsuberMediumNumber of Retailers Covering a PointamazonMediumFair Contestant PairsphonepeMediumRepublic day paradetoastMediumGood Pair HuntingzetaMediumBuy One Get One FreecohesityMedium