We have aggregated your Search needs regarding the Various Famous Programming Interview Questions. These questions have been asked at Google, Facebook, Apple, Microsoft and many other top companies. Refer to the series of Expert Videos. We would be adding one or multiple question and answer videos every day to make it a collection of Best Videos for Coding Interview Questions. Keep checking this space.
Write a Program to find the Length of longest substring without repeating characters (Python Program)
1. Write a Program to find the first Recurring Character in a given String.
2. The Famous SUM OF TWO Problem asked at Google/Facebook
Given a list/array of integers “nums” and an integer “target”, Find the sum of the two numbers such that they add up to the target number and return their indices.
Assumption -there is only one unique solution in the list/array, no two sets of indices for the same target will be there. For example, suppose the array is like nums = [5, 9, 14, 21], and the target sum is 14. Then it will return indices 1 and 2, as nums + nums  = 20.” There are quite a few Expert References. We provide the best recommended ones.
Sum of Two Reference Video 1
Sum of Two Reference Video 2
Sum of Two Reference Video 3 – Two Sum HashMap Program in Python
3. The Famous Sum of Two asked at Amazon
Given an array of integers that is already sorted in Ascending Order, Find Two Numbers such that they add to a specific Target Number. The Function TWOSUM should return the indices of the two numbers such that they add up to the target where Index 1 is less than Index 2.
4. Modified 2 SUM Problem-SUM OF THREE
Given an array “nums” of n integers, there are 3 integers a, b, c such that a + b + c = 0. Find all unique triplets in the array which give Sum of Zero.
5. Amazon Recursive Climbing Staircase Problem
There’s a staircase with N steps, and you can climb 1 or 2 steps at a time. Given N, write a Program or a Function that returns the number of unique ways you can take to climb the staircase. The order of the steps matters. For example, if N is 4, then there are 5 unique ways:
- 1, 1, 1, 1
- 2, 1, 1
- 1, 2, 1
- 1, 1, 2
- 2, 2
Again, there are quite a few Expert References. We provide the best 3 recommended ones.