Given a list of denominations (e.g., [ 1, 2, 5 ] means you have coins worth $1, $2, and $5) and a number k, find all possible combinations, if any, of coins in the given denominations that add up to k, including repeats.
Engineer Developer Interview Questions
467,765 engineer developer interview questions shared by candidates
Simple OOPs question, a BFS problem, elementary number theory problem
Convert a tree to a doubly linked list.
Given a string A and B return true if A occurs as an anagram in B
Given an array push all non zero elements to the end
1. merge two sorted arrays together 2. given a m * n grids, and one is allowed to move up or right, find the number of paths between two grids.
You are given a bunch of dominoes. Write a function that determines if any two of those dominoes add up to [6, 6] (e.g. [1,4] + [5, 2]).
Given an array of integers, find the maximum number that can be reached by summing the best possible consecutive subsequence of the array.
They had asked me what's wrong with this particular code and how/which part would I improve it?
2D matrix BFS. Can't believe the interviewer does not know how to use queue to do BFS.
Viewing 1681 - 1690 interview questions