Given a Bank class java code, list all the test cases you would come up with.
Given a tree, decide if it's a binary tree.
Given a tree node and integer number, write a method that returns true/false if any path from that node sums up to that number.
Given a matrix of 0 and 1, return a set of connected unions of 1s.
More code on recursion, Stack, Queue

Question

Given a Bank class java code, list all the test cases you would come up with.
Given a tree, decide if it's a binary tree.
Given a tree node and integer number, write a method that returns true/false if any path from that node sums up to that number.
Given a matrix of 0 and 1, return a set of connected unions of 1s.
More code on recursion, Stack, Queue

Cloudera

Pergunta de entrevista da empresa Cloudera

Empresas seguidas

Buscas de vagas