Check out interview experiences shared by users:
https://www.geeksforgeeks.org/company-interview-corner/
Here are some links to puzzles asked by different companies:
https://www.interviewbit.com/puzzles/
https://www.geeksforgeeks.org/puzzles/
Link to company wise codding questions asked during interviews:
https://www.geeksforgeeks.org/must-coding-questions-company-wise/
Links to interview problems/algorithms:
https://www.interviewbit.com/courses/programming/
https://leetcode.com/problemset/algorithms/
https://www.geeksforgeeks.org/must-do-coding-questions-for-companies-like-amazon-microsoft-adobe/
-
You are given a chess board which has marked and unmarked squares. Given the initial position of rook, find the least number of moves required for the rook to reach the given target position. Catch is, the rook can't step on marked squares.
Solution: https://www.geeksforgeeks.org/minimum-steps-reach-target-knight/
Continuing the last question, if you are given multiple of such queries what will be efficeint way to solve it?
Solution: Apply BFS from the target position. -
Given an array of size 'n', find a local minima i.e. find any index 'i' such that a[i-1]>a[i]<a[i+1] and for edge points a[0]<a[1] and a[n-2]>a[n-1]
Hint: Efficent algorithm is of order O(logn)
Solution: https://www.geeksforgeeks.org/find-local-minima-array/ -
Implement LRU-cache (Least Recently Used)
Solution: https://www.geeksforgeeks.org/lru-cache-implementation/
More coming ....