How can you solve n^m efficiently only using +, -, *, /.
Software Engineers Interview Questions
419,197 software engineers interview questions shared by candidates
Palindrome date.
What is a pure virtual function?
Recent experience and describing current job
1. Finding first non repeated character in an array 2. Linux command to list files containing specific string 3. Mysql query related to Group by Second phone interview 1. create a doubly linked list out of that tree where each node represents sum of all nodes in the same vertical line. 2. Implement search for a sorted rotated array.
Why is multiple inheritances not supported in Java?
Can you work without salary
C++ advanced topics, r-value reference, pimpl idiom, smart pointers, koenig lookup, bits of boost library, bits of STL datastructures, OS basics, some leetcode easy algorithm problem, 1 medium leetcode algorithm, 1 leetcode hard.
Given a series of strings, find the biggest common prefix.
Return the coins combination with the minimum number of coins.Time complexity O(MN), where M is the target value and N is the number of distinct coins. Space complexity O(M).
Viewing 1091 - 1100 interview questions