Given a string of digits, where every digit represents a letter (1->a, 2->b, 26->z). Find the number of words that we can generate from that string. For example: 123 -> abc, lc, aw. The answer: 3 456 -> def. The answer: 1
Software Interview Questions
748,383 software interview questions shared by candidates
How would you quickly find the kth smallest number in an unsorted array?
Given a list 1,0,3,5,0,0,34,5,0,36 push all the zeroes to the end. Develop an in-place algorithm
To set 'N' bits in a number efficiently , N is a variable.
How do you test if water is toxic without tasting it
Difference between Thread and Process. Code for Reversing elements of array and sorting of an array elements. About project in detail OOP concepts like inheritance,polymorphism,abstraction,encapsulation Name the methods of "Object" class in Java. DBMS queries and normalization.
explain basic OOP concepts.
Leetcode
How do you detect for the first repeated character in a string? How do you detect whether or not a word is a palindrome?
Bar-raiser was difficult and unexpected (to me) as I'm from embedded application dev background and haven't dealt with such scenario's.
Viewing 1641 - 1650 interview questions