I was asked a question about the following. If a user types in a n digit number on the telephone, how do you write a function to deduce if the number constitutes a valid word. For example, if the user enters 123, then can a valid word be made out of (a/b/c) + (d/e/f) + (g/h/i)
Merge to sorted arrays into second array, both arrays has N elements, but second array size is N * 2. So you merge both arrays in second array in a sorted way.
What are the most challenging tasks you faced in your previous projects and how did you handle them
One of the question was on Designing & Code a TTL Cache with some modifications
Probability of a knight making a valid move on NxN matrix in m steps.
Given an NxN matrix, find out the number of ways to get to the NxNth cell from the 1x1 cell...
Given an array with duplicate elements give an algorithm to get the count of distinct elements in the array
2. /** * A tournament tree is a binary tree * where the parent is the minimum of the two children. * Given a tournament tree find the second minimum value in the tree. * A node in the tree will always have 2 or 0 children. * Also all leaves will have distinct and unique values. * 2 * / \ * 2 3 * / \ | \ * 4 2 5 3 * * In this given tree the answer is 3. */ class Node { Integer value; Node left, right; Node(Integer value, Node left, Node right) { this.value = value; this.left = left; this.right = right; } } class Solution { /** * This should return the second minimum * int value in the given tournament tree */ public static Integer secondMin(Node root) { } }
1.How to find the nearest parent of any two nodes in a given tree. Tree has mother and father nodes.
Do company tagged leetcode questions.
Viewing 111 - 120 interview questions