given a matrix, you can move right or down only and cost of each move is 1. Find an optimal way to reach to right-bottom from top-left of the matrix.
Programador De Java Interview Questions
712,328 programador de java interview questions shared by candidates
given 2 unsigned ints a and b, return 1 unsigned int = a/b, rounded to nearest int without float operation
Implement memcpy.
They asked me to do a recursive function of a powerset (Ex. powerset(a,b,c) = ((),(a),(b),(c),(a,b),(a,c),(b,c))
Some questions on graph theory and then I was asked to write a function to check if a graph was bipartite.
How can one implement a queue with only a stack implementation?
Implement the functions for a stack and function getMinimum() all with O(1) complexity.
Java question was around String pattern searching which you can do easily in around 20 minutes, if you can keep your mind calm where that clock is also ticking.
Print a binary search tree. Each level on a new line.
write a function which returns a fibonacci number for a given number n.
Viewing 1371 - 1380 interview questions
See Interview Questions for Similar Jobs
Programador JavaDesarrollador De Software JavaDesarrollador JavaProgramador De SoftwareDesarrollador De Software Java J2eeIngeniero De Software PhpDesarrollador De Software C SeniorProgramador C ++Desarrollador Java J2eeProgramador CDesarrollador De Java CoreDesarrollador De Software En Net Desarrollador Net SeniorDesarrollador De Software PhpDesarrollador De Software Java J2ee SeniorDesarrollador De Software C ++Desarrollador De Software WebDesarrollador De Software Java Desarrollador