You have two linked lists that merge at some node. The lists could be billions of nodes long. Find the node where the lists merge in the most optimal time while using a low amount of memory.
Development Interview Questions
137,190 development interview questions shared by candidates
string compression: aaabbbbcc ->a3b4c2
They also asked me how will you explain the the terms "force" and "kinetic energy " to a 5th class child ?
Given an array as an input: [1,2,3,4,5] Return an array, which has a given index the product of all the other numbers in the array (except for the number at the given index), without using the divide operator: [120,60,40,30,24]
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.
Identify pairs of integers in an array which sum to a specified x.
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.
Write a program takes in a string and a delimiter, and uses that delimiter to split a string and then will reverse the characters in every word (or jumble of characters between the delimiters), stuffing them back into a string when finished. ('The dog walks' becomes..... 'ehT god sklaw')
finding a missing number in a continuous number sequence.
Given a string, konylabsinterview write a program to return bool if a given pattern matches.pattern example - kon*lab*terview*
Viewing 151 - 160 interview questions