Find the deepest common ancestor of two nodes in a tree structure.
Developer Big Data Interview Questions
729,792 developer big data interview questions shared by candidates
class A { public A() { foo(); } public void foo() { System.out.println("Class A"); } } class B extends A { public B(){} public void foo() { System.out.println("Class B"); } } class main { public static void main(String[] args) { A a = new B(); } } What does it print? Class A or Class B?
Given two strings representing integer numbers ("123" , "30") return a string representing the sum of the two numbers ("153")
You have datastructure my $users = [ { name => 'John', score => 10, }, { name => 'Bob', score => 1, }, { name => 'Carlos', score => 5 }, { name => 'Alice', score => 5, }, { name => 'Donald', score => 7 } ]; now u have to arrange the name with highest to lower score, if score is same than in alphabetical order #expected output: # John # Donald # Alice # Carlos # Bob
Determine if an array from 1..n has a duplicate in constant time and space.
Find number of ones in an integer.
Write a function(int[]) -> int that returns the lowest unassigned integer. For example [] -> 1 (empty set), [1] -> 2, [5, 3, 1] -> 2. Basically just sort the array, iterate, and compare current and previous. If there is a gap then that's your number.
Verify that a binary search tree is indeed a binary search tree.
Write a program to print * * * * * * * * * * * * * * * * * * * * * * * * * * * * * with minimum number of variable use
Viewing 101 - 110 interview questions
See Interview Questions for Similar Jobs
Developer JavaBig DataPrincipal Statistical ProgrammerSenior Big Data EngineerBig Data Hadoop ConsultantActimize DeveloperSoftware Developer JavaBig Data Hadoop DeveloperPrincipal StatisticianSenior Statistical ProgrammerSenior StatisticianDatabase SqlHadoop Developer Or Hadoop AdministratorStatistical Programmer AnalystMedical Software Developer Java DeveloperMathematical StatisticianSenior BiostatisticianSql Analyst