Interview Questions

T I. - "Idempotence refers to the property that the same request multiple times produces the same result on the server side. No matter how many times I repeat the request, the server state does not change after the first request. This concept is important to ensure consistency, especially in systems where requests may be repeated due to network failures or other problems. Let's take a look at different HTTP methods for a clearer understanding. GET: By definition, GET requests must be powerless. Execut"See full answer

Khushbu R. - "Let’s say the matrix is m x n (i.e., m rows and n columns). Start from the top-right corner of the matrix. Move left if you see a 1. Move down if you see a 0. Keep track of the row index where you last saw the leftmost 1 — that row has the most 1s. public class MaxOnesRow { public static int rowWithMostOnes(int matrix) { int rows = matrix.length; int cols = matrix[0].length; int maxRowIndex = -1; int j = cols - 1; /"See full answer

Exponent - "Although it's not totally obvious, this is a Strategy Question, which asks you to justify business decisions at a high level. First, let's provide a few reasons why Display Ads are bad, and then propose an alternative solution. > There are a few reasons why display ads are a bad idea. I'll go into them in-depth shortly, but in summary, display ads degrade the user experience and monetize poorly, which has all sorts of cascading effects. Loss of control > Typically, display ads are run thr"See full answer

Ankita V. - "As a PM at google, If I found a glowing magic relic to accurately predict weather, I would like to explore its functions and properties to integrate with multiple google products such as weather, maps or even google home I would go and find out how this works- assume that this tennis ball sized aritfact is able to accurately predict weather forecast for next 30 days for all geaographies, inside and outside temperature and is quite accurate i would shorlist usecases where this could be made appl"See full answer

Vivek A. - "Clarifying question:"See full answer

Ravi C. - "boolean isMatch(String s, String p) { int i=0; int j=0; int sID=-1; int prevM=-1; while(i<s.length()){ if(j<p.length() && (s.charAt(i)==p.charAt(j) || p.charAt(j)=='?')){ i++; j++; }else if(j<p.length() && p.charAt(j)=='*'){ sID=j; prevM=i; j++; }else if(sID!=-1){ j=sID+1; prevM++; i=prevM; }else{ return false; } } while(j<p.length() && p.charAt(j)=='*') j++; if(i!=s.length() || j!=p.leng"See full answer

Prashant B. - "Anonymity breeds honest & trustworthy responses. Readers find this relatable and feel motivated to share their story - which kicks off the UGC flywheel."See full answer