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.
Engineers Interview Questions
843,412 engineers 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
Write a basic Regex engine implementing the "." (any character) and "*" (previous rule, 0 to many). The function receives a string (letters only, no need for escaping) and a string pattern. It returns a bool whether the string matches the pattern. For example, the pattern "AB.*E" should match both "ABCDE" and "ABEEE".
Given an array push all non zero elements to the end
when you saw many system interrupts, what could be the possible reason in linux
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.
if(..) { printf("Hello"); } else {printf("world") } fill in the if condition to get the result "helllo world"
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]).
Viewing 2561 - 2570 interview questions