Interview Questions

Nilay B. - "int reverse(int x) { int rev = 0; bool isNegative = false; if(x 0){ int r = x % 10; rev = rev * 10 + r; x = x / 10; } if(isNegative){ return -rev; } return rev; } `"See full answer

Aashka C. - "Sorted the array and stored the minimum difference in a variable and then traversed the array for the pairs having minimum difference"See full answer

Istvan K. - "Thanks you for sharing insight about the app which I would liek to summarize in 2 structures: functional 2 technical requirement. Requirements: Functional requirement: Able to share messages, siles , and other content like photos, sounds Create groups for conversaion Size: 500 million users, 50m DAU -> 500M active chats daily Files not stored in the system but is can be shared.. Integaration with other APPs Technical requirement: Availability: Can you help me to understand the a"See full answer

Rahul J. - "find total sum. assign that to rightsum traverse from left to right: keep updating left sum and right sum, when they match return the index. else if you reach end return -1 or not found"See full answer

Sohum S. - "I would assume that this is similar to an intervals question. Meeting Rooms II (https://www.lintcode.com/problem/919/?fromId=203&_from=collection) on Leetcode seems like the closest comparison, it's a premium question so I linked Lintcode. I'm assuming that we also need to just return the minimum number of cars used. You need to sort for the most optimal solution, so you're constrained by an O(nlogn) time complexity. So any sorting solution could work (using a heap, sorting the array input arra"See full answer

Graig - "Do any one know how to build trie using IP address?"See full answer