Skip to main content

Algorithm you should know before system design.

I collected the algorithm and example we may need during the system design on https://github.com/resumejob/system-design-algorithms Frugal Streaming Geohash / S2 Geometry Leaky bucket / Token bucket Loosy Counting Operational transformation Quadtree / Rtree Ray casting Reverse index Rsync algorithm Trie algorithm Check out the examples on the repo.

Comments

Blog said…
texas lottery
The Team members' sound mathematical abilities can be attributed to their graduation course of 'Mathematical Thinking' where they studied Probability in great detail.
September 16, 2020 at 10:31 PM
sumon said…
Rothy's Promo Code
$20 Rothys Coupon. Verified Rothys Coupons and Promo Codes
October 7, 2020 at 8:03 PM
cpatipsnews said…
Email Address: customer@jurllyshe.com

Tel: (727) 827-8586

Street: 1st Floor, Building 15J, No. 80, Dianchang Road
Zhengzhou High-tech Industrial Development Zone
jurllyshe
November 6, 2020 at 6:45 AM
SEO service said…
If you want to know how much a bifolds door costs in London, you have come to the right place. If you are struggling to figure out the installation charges for bifolds doors London, you can get an idea in noise protection
February 16, 2021 at 6:39 AM
Post a Comment

Popular posts from this blog

MS interview

Algorithm Collection Q1: How would you find a cycle in a linked list? Try to do it in O(n) time. Try it using constant amount of memory. Q2: Given a history of URLs, how would you determine if a particular URL had been seen before? Q3: Since pages can have multiple URLs pointing to them, how can you make sure you've never seen the same CONTENT before? Q4: Come up with the plan on how to traverse a graph, as well as to quickly determine if a given URL is one of the million or so you've previously seen. Q5: The Web can be modeled as a directed graph. Come up with a graph traversal algorithm. Make the algorithm non-recursive and breadth-first. Q6: Write a function to print the Fibonacci numbers Q7: Write a function to print all of the permutations of a string. Q8: Design a memory management scheme. Q9: Give a one-line C expression to test whether a number is a power of 2. Now implement it without using loops. Q10: How can I swap two integers in a single l...
111 comments
Read more

Amazon interview question Collection

General Questions and Comments [more] generic questions on software development -------------------------------------------------------------------------------- What is the complexity of this algorithm -------------------------------------------------------------------------------- What is your stronger language (Java or C#) -------------------------------------------------------------------------------- Lot of design questions and OOAD stuff 2 -------------------------------------------------------------------------------- Programming questions asked were more or less same as the ones listed at this site -------------------------------------------------------------------------------- more architectural view about solve problem capability. I think the intervier was more realistic than the other two . Not just because he recommend to 2nd interview, since I also have the experience with recuriting other employees in the past. I felt the potenial is more than anything in work. Coding is j...
184 comments
Read more

Algorithm Interview questions Answers ( Microsoft, Google and Amazon )

1. Reverse a singly linked list // // iterative version // Node* ReverseList( Node ** List ) { Node *temp1 = *List; Node * temp2 = NULL; Node * temp3 = NULL; while ( temp1 ) { *List = temp1; //set the head to last node temp2= temp1->pNext; // save the next ptr in temp2 temp1->pNext = temp3; // change next to privous temp3 = temp1; temp1 = temp2; } return *List; } 2. Delete a node in double linked list void deleteNode(node *n) { node *np = n->prev; node *nn = n->next; np->next = n->next; nn->prev = n->prev; delete n; } 3. Sort a linked list //sorting in descending order struct node { int value; node* NEXT; } //Assume HEAD pointer denotes the first element in the //linked list // only change the values…don’t have to change the //pointers Sort( Node *Head) { node* first,second,temp; first= Head; while(first!=null) { second=first->NEXT; while(second!=null) { if(first->value value) { temp = new node(); temp->value=first->value; first-...
76 comments
Read more