SUMMARY.md

Table of contents

• Notebook

DSA

• Introduction
• Algorithm analysis
  • Asymptotic Notation
  • Memory
• Sorting
  • Selection Sort
  • Insertion Sort
  • Merge Sort
  • Quick Sort
  • Quick'3 Sort
  • Shell Sort
  • Shuffle sort
  • Heap Sort
  • Arrays.sort()
  • Key Points
  • Problems
    • Reorder Log files
• Stacks and Queues
  • Stack Implementations
  • Queue Implementations
  • Priority Queues
  • Problems
    • Dijkstra's two-stack algorithm
• Binary Search Tree
  • Left Leaning Red Black Tree
    • Java Implementations
  • 2-3 Tree
    • Search Operation - 2-3 Tree
    • Insert Operation - 2-3 Tree
  • Geometric Applications of BST
• B-Tree
• Graphs
  • Undirected Graphs
  • Directed Graphs
  • Topological Sort
• Union Find
  • Dynamic Connectivity
  • Quick Find - Eager Approach
  • Quick Find - Lazy Approach
  • Defects
  • Weighted Quick Union
  • Quick Union + path comparison
  • Amortized Analysis
• Convex Hull
• Binary Heaps and Priority Queue
• Hash Table vs Binary Search Trees

Concurrency and Multithreading

• Introduction
• Visibility Problem
• Interview Questions
• References

Design Patterns

• ℹ Introduction
• 💠 Classification of patterns
• 1⃣ Creational Design Patterns
  • Abstract Factory Design Pattern
  • Builder Design Pattern
  • Factory Method Design Pattern
  • Object Pool Design Pattern
  • Prototype Design Pattern
  • Singleton Design Pattern
• 2⃣ Structural Design Patterns
  • Adapter Design Pattern
  • Bridge Design Pattern
  • Composite Design Pattern
  • Decorator Design Pattern
  • Facade Design Pattern
  • Flyweight Design Pattern
  • Private Class Data Design Pattern
  • Proxy Design Pattern
• 3⃣ Behavioral Design Patterns
  • Chain Of Responsibility
  • Command Design Pattern
  • Interpreter Design Pattern
  • Iterator Design Pattern
  • Mediator Design Pattern
  • Memento Design Pattern
  • Null Object Design Pattern
  • Observer Design Pattern
  • State Design Pattern
  • Strategy Design Pattern
  • Template Design Pattern
• Java Pass by Value or Pass by Reference

Designing Data-Intensive Applications - O'Reilly

• Read Me
• 1⃣ Reliable, Scalable, and Maintainable Applications
  • Reliability
  • Scalability
  • Maintainability
  • References
• 2⃣ Data Models and Query Languages
  • Read me
  • References
• Miscellaneous

Preparation Manual

• Disclaimer
• What is it all about?
• About a bunch of links
• Before you start preparing
• Algorithms and Coding
• Concurrency and Multithreading
• Programming Language and Fundementals
• Best Practices and Experience

Miscellaneous

• My Preparation for Tech Giants
• Top Product Based Companies

Links

• Github
• LinkedIn
• leetcode