Given two very large binary trees T1, with millions of nodes, and T2, with hun- dreds of nodes, create an algorithm to decide if T2 is a subtree of T1.
Desarrollador Android Junior Interview Questions
717,484 desarrollador android junior interview questions shared by candidates
find if 2 strings are anagrams
Identify pairs of integers in an array which sum to a specified x.
How to detect loops in a linked list without using a data structure
Write out merge sort and apply it to two arrays of integers.
Given a matrix of integers, start from any column of the first row. can only move diagonally left, diagonally right and down. find the max sum possible. This is a DP problem.
Given a string that has various brackets (e.g. “{“, “(“, “[“, “}”, “)”, “]”) built into it, how would one tell that the string has a balanced number of brackets and in order?
Why did i choose to apply for JATO?
Two trains, each moving at 20 miles per hour towards each other, are initially 60 miles apart. A bee starts at the front of one train, flies to the other train, then back to the first train, and so on. If the bee always flies at 30 miles per hour, how far does the bee fly before the trains collide?
You have 10 boxes of balls (each ball weighing exactly10 gm) with one box with defective balls (each one of the defective balls weigh 9 gm). You are given an electronic weighing machine and only one chance at it. How will find out which box has the defective balls?
Viewing 751 - 760 interview questions