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.
Developer Net Interview Questions
711,473 developer net 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
Documentum DeveloperAssistant Professor Management Information SystemsComputer Information SystemsInformation SystemsVb6 DeveloperDocumentum AdministratorVxml DeveloperSoftware Developer NetAccess DeveloperComputer Information Systems AnalystComputer TeacherEntry Level Applications DeveloperCloud ComputingDot NetComputer Information Technology TeacherHtml DeveloperInformation ArchitectInformation System