Convert a binary tree into a circular doubly linked list. The order of the elements in the linked list have to be the order of elements you get when you do an in order traversal of the binary tree.
Software Engineer Interview Questions
467,307 software engineer interview questions shared by candidates
Find if one string is "oneEditAway" from another string
Implement method oneEditApart that return boolean: true, if using one operations (insert or remove or replace) we can modify one string to get another. False otherwise. // Signature: boolean oneEditApart(String s1, String s2) // Allowing operations insert remove replace Example: oea("cat", "cut") => true // replace "u" -> "a" oea("cat", "cuts") => false // no operations oea("ca", "ca") => false // no operations oea("cats", "cat") => true // remove "s" oea("cat", "at") => true // insert "c" oea("cat", "cbat") => true // remove "b"
There was a tree and I was supposed to make a double linked list from the tree using a pre order traversal.
A and B are 32 bit numbers with first 16 bits valid in A and next 16 bits valid in B. (The non-valid bits aren't necessarily 0). WAP that adds A and B without using arithmetic operator.
Is having more cores in processor always solve the problem of throughput
Multiply two big ints.
Write a function to find how many valid letters are in a string of digits give the mapping: a -> 1 b -> 2 ... z - > 26 ex) '123' =>1, 12, 23 => 'a', 'l', 'w'
you have a list of people, and a function that return true/false if one person knows the second person. write a function that finds a VIP, which everybody knows and he doesn't know anybody else.
You have a 4 x 4 board with words. For example: A B G H O L L E E R T Y G E F Y You need to write a function that finds if a certain word exists in the board. The rules are as followed: 1. Each character needs to be close to one another (neighbor cell). For example: The function will return false for the word HERE but true for the word HEY.
Viewing 2181 - 2190 interview questions