Find if a word can be constructed from the dictionary
Engineer Developer Interview Questions
467,942 engineer developer interview questions shared by candidates
Please read about us
Given a set of integers, print out all its subsets. Write C/C++ code to solve it.
Write a piece of code to calculate a square root of a number.
given an array of strings, find all the lists of anagrams present.
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.
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.
Viewing 2181 - 2190 interview questions