Find the longest subsequence in a given array of numbers in O(n)
Development Engineer Interview Questions
37,115 development engineer interview questions shared by candidates
unlimited supply of coins of different demoninations. pick min number of coins to get given amount.
Write a program that sees if two binary trees are equal.
Write a program that reverses the words in a sentence.
Give a deck of card, calculate total number of point that is closes to 21. ex A,A,J = 12 , J,J,A,2 = 23 A, 2 = 13
Make an accordion where when clicked, text expands from it and when another item is clicked, the first one collapses and the second one expands.
Write a function to find a substring in a string. Test your code, write the test cases.
Given an unfair coin, devise an algorithm to produce a fair coin's output.
Given a string of format '2+3*2-1', calculate and return the result. No parenthesis in the input, just integers and + - * / operators. Operator precedence has to be considered. Linear time complexity and minimal data structure use is preferred.
Given a triangle, determine if its a scalene, equilateral, isosceles or neither... required knowledge of triangle properties, I learnt these properties about two decades ago so ofcourse I was fuzzy on the details, completely unexpected
Viewing 211 - 220 interview questions