Eventual consistency vs Strong consistency.Observability - wavefront, prometheus, nagios.Horizontal partition, Vertical Partition.Isolation level - READ_UNCOMMITED, READ_COMMITED, READ_REPEATABLE, READ_SERIALIZABLE.Two phase (prepare & commit) & Three phase commit (prepare, pre-commit & commit).Http2, Websocket, long polling, short polling.Functional & Non-functional requirement.find employees who are in project1 and project2 Left join employee_project_mapping m on e.id = m.emp_id Left join employee_project_mapping m on p.id = m.project_id find the project and number of employees working on it. Select e.id, e.name, max(age( CURRENT_DATE, e.dob)) emp_age Where EXTRACT( YEAR FROM age( CURRENT_DATE, e.dob)) > 25 Select e.name, e.dob, age( CURRENT_DATE, e.dob) find employees who age is greater than 25 Select e.name, d.name department, p.name project one employee can work on multiple projects find all employees and the projects they are working in along with department. LEFT JOIN employee m on e.manager = m.id find all employees and their manager, if they dont have manager show null find all employees who dont have a manager SELECT e.name as emp_name, d.name as department find people with same name in same department Tushar Roy - Coding Made Simple Algo Techniques The Tushar Roy - Coding Made Simple is also highly recommended to understand some of the concepts The NeetCode youtube channel is highly recommended, the explanation of concepts is just awesome! Such problems are grouped as similar in the solutions. Most problems have a parent problem, Once you solve this parent problem you can solve various subset or variation of this problem. What is the time & space complexity? Best case, worst case time complexity? Average case is usually difficult to derive.Do any design patterns apply that could make it easier to maintain, like observer pattern?.Can I use any algorithmic techniques, like bfs, dfs, two pointer.Will sorting make the problem easier to solve?.
Does this problem look similar to other problems you have solved?.How do I break the problem into smaller units, is there a problem within a problem, can i write a decision tree?.Do I need to use 2 data structures? eg: LRU.Which data structure can I use? Arrays, LinkedList, HashMap, Heap, Tree, or Trie.
#Grokking the coding interview torrent how to#
Given a problem here are some questions that should help you figure out the general direction of how to solve it Some problems will be easy to solve once and never forget, others will take time and will require you to visit them again and again. This is very important when it comes to the learning aspect. Eg: if you learn back-tracking solution in one problem the pattern is similar when you solve it in other problem.
#Grokking the coding interview torrent code#
Each of the problems solved here are concise.A smaller consice code is easier to understand and revise.Then we will cover system design aspects.Then we will cover some SQL and database queries.