Simple OOPs question, a BFS problem, elementary number theory problem
Software Engineers Interview Questions
420,318 software engineers interview questions shared by candidates
Convert a tree to a doubly linked list.
Given a string A and B return true if A occurs as an anagram in B
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]).
Given an array of integers, find the maximum number that can be reached by summing the best possible consecutive subsequence of the array.
2D matrix BFS. Can't believe the interviewer does not know how to use queue to do BFS.
Tell me ten features of C++ (that are not in C) that have nothing to do with object oriented programming.
Given a list of versions (in string format). The versions can have invalid characters (requires cleaning). Print the list in sorted order of increasing versions. Input: ["1.2.34", "$5.j8", "3.4#", "3.45"] output: 1.2, 3.4, 3.45
Viewing 1671 - 1680 interview questions