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 Engineers Interview Questions
419,688 software engineers 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.
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 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.
Parse a string containing numbers and "+", "-" and parentheses. Evaluate the expression. -2+(3-5) should return -4.
The questions are easy and common, but I was very disappointed with the second phone interviewer. The first interviewer was very nice and supportive. The first question was to return the value of a roman number given in a string. The question for the second phone interview was to print out the paths to all leaves of a binary tree.
Viewing 2221 - 2230 interview questions