Find largest sub-array formed by consecutive integers. Find a duplicate element in a limited range array. Check if subarray with 0 sum is exists or not. Keep calm and remember you can still proceed to the next stage with partially incorrect testcases.
Array: Find pair with given sum in the array. Cracking the Coding Interview (CTCI) and Elements of Programming Interviews (EPI) will be of great assistance here as well. I have compiled the below list based on a lot of web research and going through the countless number of articles from top engineers about technical interview preparations for Google, Facebook, Microsoft, Apple and Amazon. 500 Data Structures and Algorithms interview questions and their solutions. I am currently working as an Engineer at Microsoft.
0 kommentar(er)
