Tuesday, September 27, 2016
Design Google Maps, Calender, Big Table, File System, Spanner
http://massivetechinterview.blogspot.in/2015/10/google-file-system.html
http://massivetechinterview.blogspot.in/2015/10/google-map-architecture.html
http://massivetechinterview.blogspot.in/2015/10/google-calendar-architecture.html
http://massivetechinterview.blogspot.in/2015/10/google-bigtable-architecture.html
http://massivetechinterview.blogspot.in/2015/10/google-spanner-architecture.html
http://massivetechinterview.blogspot.in/2015/10/google-map-architecture.html
http://massivetechinterview.blogspot.in/2015/10/google-calendar-architecture.html
http://massivetechinterview.blogspot.in/2015/10/google-bigtable-architecture.html
http://massivetechinterview.blogspot.in/2015/10/google-spanner-architecture.html
Design a generic automated test suite
Design a generic automated test suite.
Wednesday, September 14, 2016
Active and Inactive cells after k Days
Given a binary array of size n where n > 3. A true (or 1) value in the array means active and false (or 0) means inactive. Given a number k, the task is to find count of active and inactive cells after k days. After every day, status of i’th cell becomes inactive if its left and right cells have same value, i.e., either both are 0 or both are 1.
Since there are no cells before leftmost and after rightmost cells, the value cells before leftmost and after rightmost cells is always considered as 0 (or inactive).
http://www.geeksforgeeks.org/active-inactive-cells-k-days/
Since there are no cells before leftmost and after rightmost cells, the value cells before leftmost and after rightmost cells is always considered as 0 (or inactive).
http://www.geeksforgeeks.org/active-inactive-cells-k-days/
Maximize value of (arr[i] – i) – (arr[j] – j) in an array
Given an array, arr[] find the maximum value of (arr[i] – i) – (arr[j] – j) where i is not equal to j. Where i and j vary from 0 to n-1 and n is size of input array arr[].
Tuesday, September 13, 2016
Behavioural Questions
Behavioral Questions
- Things u learn in 3 years of experience which makes u different from fresher guy?
- Project description
- Discussion about my project details and challenging task
Miscellaneous Interview Questions
1. Draw the recursion stack of any program and find in what order one function is called and stored in the stack and in what order it is returned back to its callee function. And to prove what is the space complexity through that recursion stack.
2.
2.
Design a Server to keep track of shares and clients
Design an object oriented design system for an server that keeps track of shares and clients can ask the server to get the most up to date information about value of the shares.
Subscribe to:
Posts (Atom)