Implement a DFS to calculate maximum path (by summing node's data)
Open Source And Java Developer Interview Questions
5 open source and java developer interview questions shared by candidates
Create an algorithm to calculate the minimum number of coins to make change. No dynamic programming involved.
Homework: Implement an HTTP monitoring program
Implement an algorithm to make change returning the lowest number of coins possible. No dp involved thanks to the available coins.
Implement a DFS traversal to find the path with the highest score
Viewing 1 - 10 interview questions
See Interview Questions for Similar Jobs
Erp AnalystLead Business Systems AnalistLead Data ArchitectEtl EngineerSap Bi Project ManagerBi Project ManagerBiProject Controls Engineer Planner SchedulerData ArchitectConstruction SchedulerProject SchedulerData Architect ManagerProject Manager RcddSenior Gis-analistErp Project ManagerSenior Data ArchitectData EngineeringEngineering Business AnalystBim Building Information Modelling Engineer