Waymo Data Structures & Algorithms Interview Questions

Richard W. - "int getMaxWater(vector& nums) { int n = nums.size(); int mx = INT_MIN; int i=0, j=n-1; while(i<j) { int water = (j - i) * min(nums[i], nums[j]); mx = max(mx, water); if(nums[i] < nums[j]){ i++; } else { j--; } } return mx; } `"See full answer

Konye U. - "select (case when scity < dcity then scity else dcity end) as city1, (case when scity < dcity then dcity else scity end) as city2, avg(distance) distance from city group by 1,2"See full answer

Jonathan michael J. - "add two strings `"See full answer