Data Adventurer


  • Home

  • About

  • Categories

  • Archives

product-metrics

Posted on 2018-06-19 | In Interview_Prep , product_sense |
Frameworks for feature metricsThere are two frameworks that I have known to be useful to track feature success: Dave McClure’s Pirate MetricsAcquisiti ...
Read more »

star-schema

Posted on 2018-06-19 | In Interview_Prep , database |
Table Designhttps://github.com/yoosuf/Messenger ConstraintsKey words NOT NULL Ensures that a column cannot have a NULL value UNIQUE Ensures that all ...
Read more »

Distributed-Systems

Posted on 2018-06-15 | In Interview_Prep , design |
Everything is a trade off! Performance vs scalabilityA service is scalable if it results in increased performance in a manner proportional to resource ...
Read more »

Object-Oriented_Design

Posted on 2018-06-15 | In Interview_Prep , design |
Multiple Inheritance12345678910111213141516class Father(): def skills(self): print("gardening,programming")class Mother(): def skills(self): ...
Read more »

Multiprocessing-Multithreading.md

Posted on 2018-06-15 | In Interview_Prep , system |
OverviewBoth multiprocessing and multithreading both are ways to achieve multitasking Multithreading will share the same address space (global variabl ...
Read more »

Dynamic-Programming

Posted on 2018-05-26 | In Interview_Prep , algorithm |
general strategy Start with the recursive backtracking solution Optimize by using a memoization table (top-down[3] dynamic programming) Remove the nee ...
Read more »

Binary-Search

Posted on 2018-05-26 | In Interview_Prep , algorithm |
binary searchhttps://blog.csdn.net/itsyarkee/article/details/6852338http://www.cnblogs.com/grandyang/p/6854825.htmlhttps://leetcode.com/problems/minim ...
Read more »

Advanced-Topics

Posted on 2018-05-13 | In Interview_Prep , algorithm |
AlgorithmTopological SortDijkstra’s Algorithm Dijkstra’s algorithm is an algorithm for finding the shortest paths between nodes in a graph, Dijkstra ...
Read more »

Graph-Algorithms

Posted on 2018-05-13 | In Interview_Prep , algorithm |
Topological orderingDefinitionA topological ordering of a directed graph G is a a labelling f of G’s nodes such that: the f(v)’s are the set {1, 2, … ...
Read more »

Tricks-and-Tips

Posted on 2018-05-13 | In Interview_Prep , algorithm |
Time Complexity get sublist/substring continuous substring: O(N^2) any substring/sublist without changing order O(2^N) ? #Tips: Bug-free consider ...
Read more »
1234
Jeff Sang

Jeff Sang

34 posts
19 categories
10 tags
GitHub
© 2019 Jeff Sang
Powered by Hexo
|
Theme — NexT.Pisces v5.1.4