Topic Difficulty
Hard Depth-First Search OA Questions
Practice 36+ hard Depth-First Search coding questions from real online assessments. Filter by company, solve in the OAHelper editor, and prepare for company-wise OAs.
Walking in LightalgouniversityHardQuestion 22ciscoHardCollecting CoinsciscoHardQuestion 1ciscoHardWord PuzzleciscoHardWord SearchciscoHardCryptarithmoptiverHardCluster QueriessalesforceHardResource Locking in an m-Ary TreeamazonHardTown Network Population CountingboeingHardHouse Cleaningbny mellonHardIdeal Pathbny codedivasHardMinimum Heightintuit 1marchHardDisk StorageuberHardSalesforce Data CollectionsalesforceHardCount Tree PathsgameskraftHardHamilton pathhummingbirdHardProduct Dependency TreeintuitHard2. Count Good PathshandsonHardProduct Dependency TreeintuitHardMinimum HeightintuitHardWord Search in a GridciscoHardVillage Route Population Sum QueryuidaiHardMaximum strengthskyforceHardGraph Challengejupiter moneyHardThe Great Rubrik Zone Challengerubrik 23novHardNumber of NodesimpetusHardTown Network Population CountingmoveinsyncHardNeural Network Neuron Vigorservice now 16novHardRecover Binary Search TreemedianetHardTree Valuepoint72HardBlack and white treedeutsche bankHardRemove Leaves to Create Special Treebny mellonHardDora's Preferred Routegoldman sachsHardOptimal Reconstructiongoldman sachsHardKey Salesforce TeamssalesforceHardFinding bridges in a graph in O(N + M)plutus researchHardTown Network Population Countinggraviton 4novHardMinimize Expected Reading TimedevrevHardDynamic Tree Path SuminmobiHardUpdate Nodes at K Distancede shawHardVillage Route Population Sum QueryteradataHardMinimum Data Protection Hierarchyrubrik 2novHardRecover Binary Search TreemedianetHardReverse EdgespaypalHardCount Of ShopsinfoedgeHardMinimize Max Distance in Connected NetworkstekionHardCoins Respawnhushh aiHardWater Pipeline Cost ManagementjuspayHardDivisor powertrimbleHard