LCA of 'k' given nodes in an arbitrary tree having N nodes?
Software Engineer Data Interview Questions
439,223 software engineer data interview questions shared by candidates
Write a program print the outsides nodes in a binary tree.
Given a 2D rectangular matrix of boolean values, write a function which returns whether or not the matrix is the same when rotated 180 degrees. Additionally verify that every boolean true is accessible from every other boolean true if a traversal can be made to an adjacent cell in the matrix, excluding diagonal cells. That is , (x , y ) can access the set [ ( x + 1 , y ) , ( x - 1 , y ) , (x , y - 1 ) , (x , y + 1 ) ] For example, the matrix { { true , false } , { false , true } } should not pass this test.
given list[list[String], where each list[String] represents a node in the following manner: node.id -> child0.id -> child1.id -> ... rebuild the tree.
Similar to this: Given an NxN grid of 0s, 1s, and 2s, find out whether 1s or 2s is surrounded starting at (i,j). Being surrounded means that 1s is surrounded by 2s or that 2s is surrounded by 1s.
Cannot disclose due to NDA but generally algorithmic questions and system design.
What happens when you type www.google.com in your browser?
Implement on a board a shortest path algorithm when traveling from point A to point B on a board. Once you produce a solution, they throw modifications to an initial problem like what if you know that points x, y, z cannot be used in a path.
Give the sizeof of the following struct : struct{ char a,b; int c; }
how do you find out if there is a cycle in linked list.
Viewing 1671 - 1680 interview questions