We discussed a problem from graph theory: finding if there exists a path in a graph containg a color a single time in a graph of colored vertices. Timothy proposed a pseudocode based on dynamic programming. We discussed the same problem also in terms of the boolean satisfiability (SAT) algorithm. Timothy would know and explain quite well the setting of the propositional logical based clauses to transform the initial problem into a boolean one. I will take new lessons in the furure.
Danil is an excellent computer science and discrete mathematics tutor. He helped me design a complex dynamic programming algorithm and implement it in Python. He explained the problem in ways I was able to understand, and I'm confident I’ll apply the knowledge and skills I learned from him to solve future problems. This guy is great! He's very patient, knowledgeable, and eager to help you understand advanced computer science problems.
Jean Benoit is very knowledgeable. He is able to hit the ground running very quickly. We worked on dynamic programming and deterministic inventory problems. During our lesson, we worked efficiently to try to get me to understand how to do the problem and understand the concept.