Given a m*n grid starting from (1, 1). At any point (x, y), you has two choices for the next move: 1) move to (x+y, y); 2) move to (x, y+x); From point (1, 1), how to move to (m, n) in least moves? (or there's no such a path)
Developer It Applications Interview Questions
717,448 developer it applications interview questions shared by candidates
Write a recursive function to determine prime number
How to remove a node from a singly-linked list when only given the pointer to the node
Find max k elements among mostly sorted list.
Was asked how I would implement division without using division or mod operators. The answer should return in the form quotient r remainder.
Given 2 numbers x and y, check if x is an integer power of y. For instance, x = 8, y = 2 would return true and x = 10 and y = 2 would return false since the first one is an integer power but the second isn't.
How to reverse a number, e.g. 1234.
Given heads of two linked lists. Find if the two linked lists intersect. Solution should not use extra memory.
Print a singly-linked list backwards, in constant space and linear time.
Given nested arrays, write an enumerator class such that next() returns the elements in sequential order, e.g.: [1,[4,3],6,[5,[1,0]]] -> 1, 4, 3, 6, 5, 1, 0 also implement allObjects for this class
Viewing 251 - 260 interview questions
See Interview Questions for Similar Jobs
Data Warehouse DeveloperSenior Data Warehouse AnalystSenior Oracle Database AdministratorSenior Data Warehouse ArchitectEtl DeveloperSenior Data Warehouse DeveloperData Warehouse Etl DeveloperSenior Database AdministratorSenior Database DeveloperSenior Sql DeveloperPl Sql DeveloperSenior Data Stage DeveloperSenior Data EngineerSenior Database EngineerOracle Data Warehouse DeveloperInformatica DeveloperEtl Informatica DeveloperTechnical Analyst