DATA

Task


SCALA

A guide to dealing with Dependency Hell in Sbt

How did we get here?


AGILE

The Late Guy / The No-Show Guy


AGILE

  • Inspect how the last Sprint went with regards to people, relationships, process, and tools
  • Identify and order the major items that went well and potential improvements
  • Create a plan for implementing improvements to the way the Scrum Team does its work.


CODING

Input: [3,4,5,1,2] 
Output: 1
Input: [4,5,6,7,0,1,2]
Output: 0
def findMin(nums: List[int]) -> int:
left, right = 0, len(nums) - 1
while nums[left] > nums[right]:
middle = int((left + right)/2)
if nums[middle] < nums[right]:
right = middle
else:
left = middle + 1
return nums[left]


CODING

Input: weights = [1,2,3,4,5,6,7,8,9,10], D = 5
Output: 15
Explanation:
A ship capacity of…


CODING

  • push(x) — Push element x onto stack.
  • pop() — Removes the element on top of the stack.
  • top() — Get the top element.
  • getMin() — Retrieve the minimum element in the stack.
Input
["MinStack","push","push","push","getMin","pop","top","getMin"]
[[],[-2],[0],[-3],[],[],[],[]]
Output
[null,null,null,null,-3,null,0,-2]
Explanation
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin(); // return -3
minStack.pop();
minStack.top(); // return 0
minStack.getMin(); // return -2
  • Methods pop, top and getMin operations will always be called on non-empty stacks.
class MinStack:
def __init__(self):
self.topNode …


CODING

Input: nums1 = [1,7,11], nums2 = [2,4,6], k = 3
Output: [[1,2],[1,4],[1,6]]
Explanation: The first 3 pairs are returned from the sequence:
[1,2],[1,4],[1,6],[7,2],[7,4],[11,2],[7,6],[11,4],[11,6]
Input: nums1 = [1,1,2], nums2 = [1,2,3], k = 2
Output: [1,1],[1,1]
Explanation: The first 2 pairs are returned from the sequence:
[1,1],[1,1],[1,2],[2,1],[1,2],[2,2],[1,3],[1,3],[2,3]


DATA

Terminology

Directed Acyclic Graph (DAG)


CODING

Input: [1,3,4,2,2]
Output: 2
Input: [3,1,3,4,2]
Output: 3
  1. You must not modify the array (assume the array is read only).
  2. You must use only constant, O(1) extra space.
  3. Your runtime complexity should be less than O(n2).
  4. There is only one duplicate number in the array, but it could be repeated more than once.

Anjana Sudhir

Senior Software Engineer & Scrum Master @ Agoda (Booking Holdings Inc.)

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store