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.
Software Interview Questions
550,661 software 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.
Find largest element in array without using any extra variables or any functions
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?
In een RDBMS, een zekere tabel met de volgende kolommen: business_id, lengte- en breedtegraad De database heeft een functie genaamd afstand die positie neemt voor bedrijven en gebruikerspositie en berekent afstand. De db vraagd om uit te zoeken of bedri
Given any number of arrays containing numbers, write a function which finds the numbers that appear in exactly two arrays. arrays = [ [6, 2, 2, 0, 4], [5, 0, 2, 6, 7, 1], [6, 7, 9, 9], ] find_in_two(arrays) should return [2, 0, 7]
Viewing 701 - 710 interview questions