Anil Pai anilpai

Identity and Access Management Our customers trust us with some of their most sensitive data, but with thousands of systems and employees around the globe, we've never been systematic about access control. We want to give employees exactly the right set of privileges they need to do their work.

Welcome! You have been appointed the technical lead of a project to build an identity and access management (IAM) system. At a high level, the components are:

• A way of storing access policies (who can do what); • An API to query these access policies; and • An APl to manage these access policies.

Examples of requests that the system should serve

	# Computing current rank of a node in a stream

	class Node:
	def __init__(self, val, left=None, right=None, left_size=0):
	self.val = val
	self.left = left
	self.right = right
	self.left_size = left_size

	class Solution:

	# Computing Rank of a node in a stream

	"""Source: https://www.geeksforgeeks.org/rank-element-stream """

	class Node:
	def __init__(self, val):
	self.val = val
	self.left = None
	self.right = None
	self.left_size = 0

	Dynamo: How to Design a Key-value Store?

	Amazon’s Dynamo : https://www.allthingsdistributed.com/2007/10/amazons_dynamo.html
	Eventually Consistent : https://www.allthingsdistributed.com/2007/12/eventually_consistent.html
	Bigtable : https://research.google/pubs/pub27898/
	DynamoDB : https://www.allthingsdistributed.com/2012/01/amazon-dynamodb.html
	CRDT : https://en.wikipedia.org/wiki/Conflict-free_replicated_data_type
	A Decade of Dynamo : https://www.allthingsdistributed.com/2017/10/a-decade-of-dynamo.html
	Riak : https://docs.riak.com/riak/kv/2.2.0/learn/dynamo/
	Dynamo Architecture : https://www.youtube.com/watch?v=w96lLsbI1q8

	import heapq as hq


	def generate_time_series(trips):
	trips.sort(key=lambda x: (x[0], x[1]))
	series = {}
	minStartTime = []

	for trip in trips:
	if minStartTime and minStartTime[0] <= trip[0]:

	/* Priority Queue based Heap implementation in TypeScript */

	class BinaryHeap<T> {
	private heapArray: T[] = [];

	constructor(private lessThan: (a:T, b:T) => boolean) {
	}

	size() {
	return this.heapArray.length;

	import requests
	from typing import Tuple, List
	from math import log

	currencies = ('PLN', 'EUR', 'USD', 'RUB', 'INR', 'MXN')
	api_key = 'fe69bd3037f74f699cf2bf8070b44374'

	def get_rates(currencies: Tuple[str, ...], api_key: str) -> List[List[float]]:
	rates = []
	response = requests.get(f'https://openexchangerates.org/api/latest.json?app_id={api_key}')

	from collections import defaultdict

	class Graph:
	def __init__(self):
	self.graph = defaultdict(list)

	def add_edge(self, node, neighbour):
	self.graph[node].append(neighbour)
	self.graph[neighbour].append(node)

	from collections import deque, defaultdict

	class Graph:
	def __init__(self):
	self.graph = defaultdict(list)

	def add_edge(self, node, neighbour):
	self.graph[node].append(neighbour)
	self.graph[neighbour].append(node)

	class FenwickTree:
	def __init__(self, size):
	self.size = size
	self.tree = [0] * (size + 1)

	def update(self, index, value):
	while index <= self.size:
	self.tree[index] += value
	index += index & -index