Shreyansh's Everything Notebook đź“–

          • Basic Java Syntax and Notes
          • Resources
          • 0-1 Matrix
          • 3 Sum
          • 238. Product of Array Except Self
          • 283. Move Zeroes
          • 345. Reverse Vowels of a String
          • 394. Decode String
          • 443. String Compression
          • 643. Maximum Average Subarray I
          • 724. Find Pivot Index
          • 735. Asteroid Collision
          • 1004. Max Consecutive Ones III
          • 1071. Greatest Common Divisor of Strings
          • 1456. Maximum Number of Vowels in a Substring of Given Length
          • 1657. Determine if Two Strings Are Close
          • 1679. Max Number of K Sum Pairs
          • 2390. Removing Stars From a String
          • Accounts Merge
          • Acquire and Release Strategy
          • Alien Dictionary
          • Amount of Time for Binary Tree to Be Infected
          • Backtracking
          • Bellman Ford
          • Best Time to Buy and Sell Stock
          • Best Time to Buy and Sell Stock II
          • BFS
          • Binary Search Template
          • Binary Tree
          • Binary Tree 1
          • Binary Tree Maximum Path Sum
          • Binary Tree Zigzag Level Order Traversal or Spiral Traversal
          • Bottom View
          • Boundary Order Traversal
          • Boundary Order Traversal 1
          • Capacity To Ship Packages Within D Days
          • Climbing Stairs
          • Coin Change II
          • Combination Sum
          • Combination Sum 2
          • Combination Sum 4
          • Count-the-number-of-complete-components
          • Course Schedule
          • Design Linked List - 707
          • Detect Cycle in a graph
          • Diameter of a Binary Tree
          • Dijkstra Algorithm
          • DisJoint Set
          • Distinct Subsequences
          • Edit Distance
          • Find All The Anagrams in a String
          • Find Minimum in Rotated Sorted Array
          • Find Peak Element
          • Find the nth Root
          • First and Last Position Of An Element In A Sorted Array
          • First Bad Version
          • First Bad Version [Easy]
          • Fixed Window Size Template
          • Flatten a binary tree
          • Floyd Warshall
          • Friends Pairing Problem
          • Frog Jump - Codestudio
          • Fruit Into Baskets
          • House Robber
          • House Robber II
          • is Balanced Binary Tree
          • is Graph Bipartite
          • K-Sum
          • Koko Eating Bananas
          • Kth Smallest Number in Multiplication Table
          • Least Common Ancestor
          • Left View
          • Linked List Cycle - 141
          • Longest Common Subsequence
          • Longest Repeating Character Replacement
          • Longest Substring Without Repeating Window
          • Maximum Number of occurrences of Substring
          • Maximum Points You Can Obtain from Cards
          • Maximum Score words formed by letters
          • Maximum Subarray
          • Merge Intervals
          • Minimal Cost OR Frog with K distance
          • Minimum consecutive cards to pick
          • Minimum cost to connect all points
          • Minimum Falling Path Sum
          • Minimum Height Trees
          • Minimum in rotated sorted array
          • Minimum in rotated sorted array II
          • Minimum Number of Days to Make m Bouquets
          • Minimum Path Sum
          • Minimum Size Subarray Sum
          • Minimum Window Maximum
          • Network Delay
          • Ninja Training
          • NOTE
          • Number of Dice Rolls With Target Sum
          • Number of operations to make a network connected
          • Number Of Provinces
          • Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold
          • Partition equal Subset Sum
          • Partition to K Equal Sum Subsets
          • Path Sum 2
          • Pattern + Template
          • Prims Algorithm (Greedy Algorithm)
          • Reverse a Linked List - 206
          • Right View
          • Rod Cutting
          • Rotten Oranges
          • Same Tree
          • Search in Rotated Sorted Array
          • Search in Rotated Sorted Array II
          • Search Insert Position
          • Shortest Common SuperSequence
          • Single Element in a Sorted Array
          • Sliding Window Maximum
          • Split Array Largest Sum
          • Sqrt(x)
          • Subarrays with K Different Integers
          • Subset Sum Equal To K
          • SubSets
          • SubSets-II
          • Substrings of Size K with Distinct Characters
          • Symmetric Trees
          • Template to solve substring problems
          • Top View
          • Topological Sort
          • Two Sum 2 - Input array is sorted
          • Two Sum IV - Input in BST
          • Unique Paths
          • Unique Paths II
          • Variable Window Size Template
          • Vertical Order Traversal
          • Wildcard Matching
          • Quick Sort
        • Leetcode and Grind 75 (Mix)
          • Interview Problems
          • Resources
            • Conclude Replication
            • Conflict-Free Replicated Data Types - CRDTs
            • Dealing with Stale Reads
            • Intro to Replication - Need to knows
            • Leaderless Replication
            • MultiLeader Replication - chaos
            • Quorums
            • Single Leader Replication
            • Write Conflicts
            • Atomic Commit and Two-Phase Commit (2PC)
            • Into to Partitioning or Sharding
            • Rebalancing Partitions
            • Coordination Services
            • Distributed Consensus
            • Lamport Clocks ⤾
            • Linearizability
            • Raft Writes
            • The Raft Consensus Algorithm - Leader Election
            • Version Vector →
            • MongoDB vs Cassandra
            • Relational Vs Non-Relational | Relational Model vs Document Model | SQL vs No SQL (not preferred!)
            • SQL(Relational) Databases: The Ultimate Data Guardians—B-Trees, Locks, and the Art of Keeping Data Drama-Free
            • Kafka vs RabbitMQ
            • Stream Processing + When to use it?
            • Coordination Services
            • Distributed Consensus
            • Lamport Clocks ⤾
            • Linearizability
            • Raft Writes
            • The Raft Consensus Algorithm - Leader Election
            • Version Vector →
            • MongoDB vs Cassandra
            • Relational Vs Non-Relational | Relational Model vs Document Model | SQL vs No SQL (not preferred!)
            • SQL(Relational) Databases: The Ultimate Data Guardians—B-Trees, Locks, and the Art of Keeping Data Drama-Free
            • Kafka vs RabbitMQ
            • Stream Processing + When to use it?
        • !ndex of High Level Design
          • !ndex of Design Patterns
          • Decorator (a.k.a. Wrapper) Design Pattern
          • Observer Design Pattern
          • Strategy Design Pattern
            • 1. Encapsulation
            • 2. Abstraction
            • 3. Inheritance
            • 4. Polymorphism
            • Object Relationships
          • !ndex of OOPs
          • OOP Overview
          • !ndex of Solid Principles
          • 1. Single Responsibility Principle
          • 2. Open and Closed Principle
          • 3. Liskov Substitution Principle
          • 4. Interface Segregation Principle
          • 5. Dependency Inversion Principle
        • !ndex of LLD Notes
        • Java Notes
        • Memory Management and Garbage Collector in JAVA
        • Resources
        • CART
        • Introduction
        • OMS
        • Introduction to Spring Boot
      • DAG-Topo
      • Diamond Problem Inheritance
      • Dijkstra Negative Cycle Issue!
      • Drawing 2024-06-15 19.08.50.excalidraw
      • Drawing 2024-06-17 14.18.54.excalidraw
      • Drawing 2024-06-26 15.15.56.excalidraw
      • Drawing 2024-08-09 09.39.04.excalidraw
      • Drawing 2024-08-25 12.01.30.excalidraw
      • Drawing 2024-08-25 12.48.46.excalidraw
      • DSU1
      • InvoiceDao
      • MouseKeyboardInterface
        • 8752bc2ed95403ab2bc9f380e62f5410_MD5.jpg
      • Find Eventual Safe States
      • sasa
      • Search Indexes

    !ndex of OOPs

    Dec 11, 20241 min read

    Graph View

    1. Pillars of OOP
      1. 2. Abstraction
      2. 1. Encapsulation
      3. 3. Inheritance
      4. 4. Polymorphism
      5. Object Relationships

            • Basic Java Syntax and Notes
            • Resources
            • 0-1 Matrix
            • 3 Sum
            • 238. Product of Array Except Self
            • 283. Move Zeroes
            • 345. Reverse Vowels of a String
            • 394. Decode String
            • 443. String Compression
            • 643. Maximum Average Subarray I
            • 724. Find Pivot Index
            • 735. Asteroid Collision
            • 1004. Max Consecutive Ones III
            • 1071. Greatest Common Divisor of Strings
            • 1456. Maximum Number of Vowels in a Substring of Given Length
            • 1657. Determine if Two Strings Are Close
            • 1679. Max Number of K Sum Pairs
            • 2390. Removing Stars From a String
            • Accounts Merge
            • Acquire and Release Strategy
            • Alien Dictionary
            • Amount of Time for Binary Tree to Be Infected
            • Backtracking
            • Bellman Ford
            • Best Time to Buy and Sell Stock
            • Best Time to Buy and Sell Stock II
            • BFS
            • Binary Search Template
            • Binary Tree
            • Binary Tree 1
            • Binary Tree Maximum Path Sum
            • Binary Tree Zigzag Level Order Traversal or Spiral Traversal
            • Bottom View
            • Boundary Order Traversal
            • Boundary Order Traversal 1
            • Capacity To Ship Packages Within D Days
            • Climbing Stairs
            • Coin Change II
            • Combination Sum
            • Combination Sum 2
            • Combination Sum 4
            • Count-the-number-of-complete-components
            • Course Schedule
            • Design Linked List - 707
            • Detect Cycle in a graph
            • Diameter of a Binary Tree
            • Dijkstra Algorithm
            • DisJoint Set
            • Distinct Subsequences
            • Edit Distance
            • Find All The Anagrams in a String
            • Find Minimum in Rotated Sorted Array
            • Find Peak Element
            • Find the nth Root
            • First and Last Position Of An Element In A Sorted Array
            • First Bad Version
            • First Bad Version [Easy]
            • Fixed Window Size Template
            • Flatten a binary tree
            • Floyd Warshall
            • Friends Pairing Problem
            • Frog Jump - Codestudio
            • Fruit Into Baskets
            • House Robber
            • House Robber II
            • is Balanced Binary Tree
            • is Graph Bipartite
            • K-Sum
            • Koko Eating Bananas
            • Kth Smallest Number in Multiplication Table
            • Least Common Ancestor
            • Left View
            • Linked List Cycle - 141
            • Longest Common Subsequence
            • Longest Repeating Character Replacement
            • Longest Substring Without Repeating Window
            • Maximum Number of occurrences of Substring
            • Maximum Points You Can Obtain from Cards
            • Maximum Score words formed by letters
            • Maximum Subarray
            • Merge Intervals
            • Minimal Cost OR Frog with K distance
            • Minimum consecutive cards to pick
            • Minimum cost to connect all points
            • Minimum Falling Path Sum
            • Minimum Height Trees
            • Minimum in rotated sorted array
            • Minimum in rotated sorted array II
            • Minimum Number of Days to Make m Bouquets
            • Minimum Path Sum
            • Minimum Size Subarray Sum
            • Minimum Window Maximum
            • Network Delay
            • Ninja Training
            • NOTE
            • Number of Dice Rolls With Target Sum
            • Number of operations to make a network connected
            • Number Of Provinces
            • Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold
            • Partition equal Subset Sum
            • Partition to K Equal Sum Subsets
            • Path Sum 2
            • Pattern + Template
            • Prims Algorithm (Greedy Algorithm)
            • Reverse a Linked List - 206
            • Right View
            • Rod Cutting
            • Rotten Oranges
            • Same Tree
            • Search in Rotated Sorted Array
            • Search in Rotated Sorted Array II
            • Search Insert Position
            • Shortest Common SuperSequence
            • Single Element in a Sorted Array
            • Sliding Window Maximum
            • Split Array Largest Sum
            • Sqrt(x)
            • Subarrays with K Different Integers
            • Subset Sum Equal To K
            • SubSets
            • SubSets-II
            • Substrings of Size K with Distinct Characters
            • Symmetric Trees
            • Template to solve substring problems
            • Top View
            • Topological Sort
            • Two Sum 2 - Input array is sorted
            • Two Sum IV - Input in BST
            • Unique Paths
            • Unique Paths II
            • Variable Window Size Template
            • Vertical Order Traversal
            • Wildcard Matching
            • Quick Sort
          • Leetcode and Grind 75 (Mix)
            • Interview Problems
            • Resources
              • Conclude Replication
              • Conflict-Free Replicated Data Types - CRDTs
              • Dealing with Stale Reads
              • Intro to Replication - Need to knows
              • Leaderless Replication
              • MultiLeader Replication - chaos
              • Quorums
              • Single Leader Replication
              • Write Conflicts
              • Atomic Commit and Two-Phase Commit (2PC)
              • Into to Partitioning or Sharding
              • Rebalancing Partitions
              • Coordination Services
              • Distributed Consensus
              • Lamport Clocks ⤾
              • Linearizability
              • Raft Writes
              • The Raft Consensus Algorithm - Leader Election
              • Version Vector →
              • MongoDB vs Cassandra
              • Relational Vs Non-Relational | Relational Model vs Document Model | SQL vs No SQL (not preferred!)
              • SQL(Relational) Databases: The Ultimate Data Guardians—B-Trees, Locks, and the Art of Keeping Data Drama-Free
              • Kafka vs RabbitMQ
              • Stream Processing + When to use it?
              • Coordination Services
              • Distributed Consensus
              • Lamport Clocks ⤾
              • Linearizability
              • Raft Writes
              • The Raft Consensus Algorithm - Leader Election
              • Version Vector →
              • MongoDB vs Cassandra
              • Relational Vs Non-Relational | Relational Model vs Document Model | SQL vs No SQL (not preferred!)
              • SQL(Relational) Databases: The Ultimate Data Guardians—B-Trees, Locks, and the Art of Keeping Data Drama-Free
              • Kafka vs RabbitMQ
              • Stream Processing + When to use it?
          • !ndex of High Level Design
            • !ndex of Design Patterns
            • Decorator (a.k.a. Wrapper) Design Pattern
            • Observer Design Pattern
            • Strategy Design Pattern
              • 1. Encapsulation
              • 2. Abstraction
              • 3. Inheritance
              • 4. Polymorphism
              • Object Relationships
            • !ndex of OOPs
            • OOP Overview
            • !ndex of Solid Principles
            • 1. Single Responsibility Principle
            • 2. Open and Closed Principle
            • 3. Liskov Substitution Principle
            • 4. Interface Segregation Principle
            • 5. Dependency Inversion Principle
          • !ndex of LLD Notes
          • Java Notes
          • Memory Management and Garbage Collector in JAVA
          • Resources
          • CART
          • Introduction
          • OMS
          • Introduction to Spring Boot
        • DAG-Topo
        • Diamond Problem Inheritance
        • Dijkstra Negative Cycle Issue!
        • Drawing 2024-06-15 19.08.50.excalidraw
        • Drawing 2024-06-17 14.18.54.excalidraw
        • Drawing 2024-06-26 15.15.56.excalidraw
        • Drawing 2024-08-09 09.39.04.excalidraw
        • Drawing 2024-08-25 12.01.30.excalidraw
        • Drawing 2024-08-25 12.48.46.excalidraw
        • DSU1
        • InvoiceDao
        • MouseKeyboardInterface
          • 8752bc2ed95403ab2bc9f380e62f5410_MD5.jpg
        • Find Eventual Safe States
        • sasa
        • Search Indexes

      Recent writing

      • Search Indexes

        Dec 11, 2024

      • My Digital Garden 🪴

        Dec 11, 2024

      • sasa

        Dec 11, 2024

      Backlinks

      • !ndex of LLD Notes

      Created with Quartz v4.4.0 © 2024

      • GitHub
      • LinkedIn