Skip to content
  • Home
  • YouTube
  • About
  • Contact
Learn to Code and Code to Learn

Learn to Code and Code to Learn

Your Journey to Code Mastery

  • Interview Prep Sheet
    • TCP DSA 75
    • TCP DSA 150
    • TCP DSA 351
    • TCP HLD 50
    • TCP HLD 101
  • General
    • Setup
    • Mastering in C programming (Crash Course)
  • DSA Patterns
    • Fast and Slow Pointer
    • sliding window
      • fixed size sliding window
      • Variable size sliding window
  • Coding Prep
    • Leetcode Problems
      • Leetcode Practice
      • Leetcode PTOD
      • TCP DSA 150
    • GFG
      • GFG Practice
      • GFG PTOD
    • Company wise Interview Questions
      • Google
      • Microsoft
  • Programming
    • C Programming
    • C++
      • C++-11
      • c++-14
      • STL
    • Python
  • HLD
    • TCP HLD 50
    • TCP HLD 101
  • LLD
    • SOLID Principle
    • Design Pattern
      • Creational Design Patterns
        • Singleton
  • Toggle search form

Liskov Substitution Principle

Posted on February 1, 2022February 5, 2022 By thecodepathshala 5 Comments on Liskov Substitution Principle

Subtypes must be substitutable for their base types without altering the correctness of the program

Methods that use references to base classes must be able to use objects of derived classes without knowing it.

If S is a subtype of T, then objects of type T in a program may be replaced with objects of type S without altering any of the desirable properties of that program

Violating the Liskov’s Substitution Principle :

A Square is a Rectangle. Indeed it is a specialization of a rectangle. The “IS A” makes you want to model this with inheritance. However if in code you made Square derive from Rectangle, then a Square should be usable anywhere you expect a Rectangle. This makes for some strange behavior as follows:

class Rectangle {
protected:
    uint32_t m_width, m_height;

Public:
    Rectangle(const uint32_t width, const uint32_t height) : m_width{width}, m_height{height} {}
    uint32_t get_width() const { return m_width; }
    uint32_t get_height() const { return m_height; }
    virtual void set_width(const uint32_t width) { this->m_width = width; }
    virtual void set_height(const uint32_t height) { this->m_height = height; }
    uint32_t area() const { return m_width * m_height; }

};
class Square : public Rectangle {
Public:
    Square(uint32_t size) : Rectangle(size, size) {}
    void set_width(const uint32_t width) override { this->m_width = m_height = width; }
    void set_height(const uint32_t height) override { this->m_height = m_width = height; }
};
void process(Rectangle &r) {
    uint32_t w = r.get_width();
    r.set_height(10);
    assert((w * 10) == r.area()); // Fails for Square <--------------------
}
int main() {
    Rectangle r{5, 5};
    process(r);
    Square s{5};
    process(s);
    return EXIT_SUCCESS;
}
  • As you can see above, we have violated Liskovs’s Substitution Principle in the void process(Rectangle &r) function. Therefore Square is not a valid substitute of Rectangle.
  • If you see from the design perspective, the very idea of inheriting Square from Rectangle is not a good idea. Because Square does not have height & width, rather it has the size/length of sides.

Solution:

Use dynamic_cast to check the type of the class. This is not a good Idea.

void process(Rectangle &r) {
    uint32_t w = r.get_width();
    r.set_height(10);
    if (dynamic_cast<Square *>(&r) != nullptr)
        assert((r.get_width() * r.get_width()) == r.area());
    else
        assert((w * 10) == r.area());
}

No need to create a separate class for Square. Instead, you can simply check for bool flag within the Rectangle class to validate Square property. Though not a recommended way. This is just OK.

void process(Rectangle &r) {
    uint32_t w = r.get_width();
    r.set_height(10);
    if (r.is_square())
        assert((r.get_width() * r.get_width()) == r.area());
    else
        assert((w * 10) == r.area());
}

Best Solution: Use proper inheritance hierarchy

Create base class name Shape and inherit this class to Circle and Rectangular derived class.

class Shape {
public:
    virtual uint32_t area() const = 0;
};
class Rectangle : public Shape {
Public:
    Rectangle(const uint32_t width, const uint32_t height) : m_width{width}, m_height{height} {}
    uint32_t get_width() const { return m_width; }
    uint32_t get_height() const { return m_height; }
    virtual void set_width(const uint32_t width) { this->m_width = width; }
    virtual void set_height(const uint32_t height) { this->m_height = height; }
    uint32_t area() const override { return m_width * m_height; }
private:
    uint32_t m_width, m_height;
};
class Square : public Shape {
public:
    Square(uint32_t size) : m_size(size) {}
    void set_size(const uint32_t size) { this->m_size = size; }
    uint32_t area() const override { return m_size * m_size; }
private:
    uint32_t m_size;
};
void process(Shape &s) {
    // Use polymorphic behaviour only i.e. area()
}

Another Example:

Violating the Liskov’s Substitution Principle
  • There is a abstract base class “Bird” in which there is 1 pure virtual function “Fly”.
  • The Bird class derived in Parrot class. Parrot class can have the Fly function. So this is good.
  • The Bird class derived in Ostrich class. Ostrich class should not have the Fly function. So this is not a good implementation.
   class Bird {
      public:
      virtual void Fly();
   };
   class Parrot : public Bird {
      public:
      void Fly() { throw new NotImplementedException(); } // To implement
   };
   class Ostrich : public Bird {
      public:
      void Fly() { throw new NotImplementedException(); } // How to implement this, Ostrih can't fly??
   };
Solution:
class Bird {
   };
   class FlyingBird : public Bird {
      public:
      virtual void Fly() { throw new NotImplementedException(); }
   };
   class Parrot : public FlyingBird {
      public:
      void Fly() { throw new NotImplementedException(); }
   };
   class Ostrich : public Bird {
   };
C++, C++, Design Pattern, SOLID Principle, System Design Tags:c++, design pattern, solid

Post navigation

Previous Post: Open-Closed Principle
Next Post: Interface Segregation Principle(ISP)

More Related Articles

Queue in C++ STL C++
Interface Segregation Principle(ISP) C++
Unordered Sets in C++ STL C++
SOLID Design Principles in C++ C++
Vector in C++ STL C++
Multimap in C++ STL C++

Comments (5) on “Liskov Substitution Principle”

  1. Pingback: SOLID Design Principles in C++ - The Code Pathshala
  2. Pingback: Dependency Inversion Principle - The Code Pathshala
  3. Israel-lady נערות ליווי says:
    July 28, 2022 at 4:00 pm

    I was pretty pleased to discover this great site. I want to to thank you for ones time due to this fantastic read!! I definitely appreciated every part of it and I have you book marked to look at new stuff on your web site.

    Reply
  4. נערות ליווי באילת לבילוי משותף says:
    August 4, 2022 at 9:45 pm

    I was very happy to discover this great site. I need to to thank you for your time for this particularly wonderful read!! I definitely liked every part of it and I have you bookmarked to check out new information on your blog.

    Reply
  5. נערות ליווי romantik 69 says:
    August 14, 2022 at 2:31 pm

    Good day! I simply want to offer you a big thumbs up for the excellent info youve got right here on this post. Ill be coming back to your site for more soon.

    Reply

Leave a Reply Cancel reply

Your email address will not be published. Required fields are marked *

Archives

  • May 2026
  • August 2025
  • March 2025
  • February 2025
  • January 2025
  • December 2024
  • August 2024
  • April 2024
  • March 2024
  • February 2024
  • January 2024
  • December 2023
  • November 2023
  • September 2023
  • February 2023
  • February 2022
  • January 2022
  • December 2021
  • November 2021
  • October 2021

Categories

  • Algo
  • Array in C
  • C Programming
  • C++
  • C++
  • Company Wise
  • Competitive Programming
  • Design Pattern
  • DS
  • DS & Algo
  • Fast and Slow Pointer
  • fixed size sliding window
  • General
  • GFG
  • GFG PTOD
  • HLD
  • hld101
  • Interview Prep Sheet
  • Interview Questions
  • Leetcode Problems
  • Leetcode PTOD
  • LLD
  • Low-level design
  • Mastering in C programming (Crash Course)
  • Neetcode 150
  • Programming
  • Roadmap
  • Setup
  • Setup
  • sliding window
  • SOLID Principle
  • STL
  • string in c
  • System Design
  • TCP DSA 150
  • TCP DSA 351
  • TCP DSA 75
  • TCP HLD50
  • Top X
  • Variable size sliding window

Tags

algorithm array basic c++ coding interview C Programming Crash Course data structure and algorithm design pattern dsa easy Fixed size sliding window fubctions GFD gfg GFG PTOD hard HLD jump game LC PTOD leetcode Leetcode PTOD Leetcode Top Interview 150 LLD loop loops Low-level design Mastering C Programming in 15 Days matrix medium rotate array searching&sorting sliding window solid STL string string in c sunction in c system design TCP HLD50 TCP HLD101 Template in C++ Top Top 20 coding patterns to master MAANG Interview Top interview 150

C++ Vector + 20 Minutes + Complete Tutorial + DSA + Coding Interviews

Agar aap C++ mein DSA ya Coding Interview ki preparation kar rahe hain, toh ek STL container aapko sabse zyada use karna padega — Vector! 🔥

Lekin kya aapko actually pata hai ki Vector internally kaise kaam karta hai?

Normal array aur vector mein actual difference kya hai?

size() aur capacity() alag kyun hote hain?

push_back() ke peeche kya hota hai?

Aur sabse important — reserve() aur resize() mein kya difference hai?

Is video mein hum C++ STL Vector ko zero se interview level tak samjhenge — sirf functions nahi, balki vector ke internal working, memory allocation aur time complexity ko bhi understand karenge.

🚀 C++ VECTOR IN 20 MINUTES — COMPLETE GUIDE

🔥 IMPORTANT CONCEPTS

In this video, we'll understand:

✅ vector [int] v
✅ Vector vs Array
✅ Dynamic Array
✅ Contiguous Memory
✅ size()
✅ capacity()
✅ push_back()
✅ pop_back()
✅ reserve()
✅ resize()
✅ clear()
✅ empty()
✅ front() / back()
✅ operator[]
✅ Iteration
✅ Reallocation
✅ Amortized O(1) push_back()
✅ O(1) Random Access
✅ Vector Time & Space Complexity
✅ Interview-oriented Vector usage

🧠 SIZE vs CAPACITY

size() → Vector mein currently kitne elements hain.

capacity() → Current allocated storage mein maximum kitne elements fit ho sakte hain without another allocation.

Example:

vector[int] v;

v.push_back(10);
v.push_back(20);
v.push_back(30);

cout - v.size();
cout - v.capacity();

Size aur capacity ka difference samajhna vector ke internal working ko samajhne ke liye extremely important hai.

⚡ push_back() INTERNALLY KYA KARTA HAI?

Jab vector ke paas extra capacity hoti hai, push_back() new element ko available storage mein add kar deta hai.

Lekin jab:

size == capacity

toh vector ko larger memory block allocate karke existing elements ko move/copy karna pad sakta hai. Isi wajah se individual reallocation expensive ho sakti hai, although push_back() ka amortized complexity O(1) hota hai.

🚀 reserve() vs resize()

reserve(n)
→ Future growth ke liye capacity reserve karta hai.
→ Existing size ko change nahi karta.

resize(n)
→ Vector ke actual number of elements ko change karta hai.
→ Elements add ya remove ho sakte hain.

Ye dono functions coding interviews mein frequently confuse kiye jaate hain.

🎯 VECTOR INDEXING O(1) KYUN HAI?

Vector elements contiguous memory mein store hote hain.

Isliye:

v[i]

ko direct address calculation ke through access kiya ja sakta hai.

Conceptually:

address = base_address + i × sizeof(element)

Isi wajah se vector random access O(1) provide karta hai.

💼 CODING INTERVIEWS MEIN VECTOR

Vector DSA problems mein bahut commonly use hota hai:

🔥 Two Sum
🔥 Sliding Window
🔥 Prefix Sum
🔥 Sorting Problems
🔥 Binary Search
🔥 Two Pointers
🔥 Matrix / 2D Vector
🔥 Dynamic Programming
🔥 Graph Representation
🔥 Frequency Arrays
🔥 LeetCode Problems

Agar aap C++ mein DSA kar rahe hain, toh Vector ko sirf ek STL function nahi, balki dynamic array ke concept ke roop mein samajhna bahut important hai.

🔔 WHO IS THIS VIDEO FOR?

This video is perfect for:

✔️ C++ Beginners
✔️ DSA Beginners
✔️ Coding Interview Preparation
✔️ Placement Preparation
✔️ LeetCode Beginners
✔️ Competitive Programming
✔️ Software Engineer Interviews

Agar aapko C++ STL ko practical DSA + interview perspective se seekhna hai, toh TheCodePathshala ko subscribe karein. 🚀

👍 Video helpful lage toh Like karein
💬 Comment karein: size() aur capacity() mein difference pehle pata tha?

🔔 Subscribe for C++, DSA, LeetCode & System Design

#Cpp #CPlusPlus #Vector #CPPSTL #STL #DSA #CodingInterview #LeetCode #CompetitiveProgramming #DSAInCPlusPlus #CPlusPlusProgramming #TheCodePathshala  #LeetCode

🔎 Tags:
c++ vector,
c++ vector tutorial,
c++ vector in 20 minutes,
c++ vector explained,
vector in c++,
vector c++ tutorial,
c++ stl vector,
c++ stl vector tutorial,
c++ vector for dsa,
c++ vector for coding interview,
vector in c++ for beginners,
c++ vector size capacity,
size vs capacity c++,
c++ vector push_back,
push_back internally c++,
c++ vector reserve resize,
reserve vs resize c++,
c++ vector internals,
how vector works in c++,
vector vs array c++,
c++ dynamic array,
c++ vector time complexity,
vector indexing o(1),
c++ vector interview questions,
vector interview questions,
c++ dsa,
dsa in c++,
c++ coding interview,
c++ placement preparation,
leetcode c++,
c++ stl tutorial hindi,
c++ vector hindi,
vector kya hai c++,
c++ vector explained hindi,
c++ vector
c++ vector explained
vector in c++
vector in c++ stl
c++ stl vector
c++ vector tutorial
c++ vector complete tutorial
c++ vector complete introduction
vector c++
vector stl
stl vector
c++ stl
c++ dsa
c++ data structures
vector data structure
dynamic array c++
array vs vector c++
vector vs array
size vs capacity c++
vector size capacity
push_back c++
push_back internally
reserve vs resize c++
vector reserve
vector resize
vector indexing
c++ coding interview
dsa interview preparation
c++ placement preparation
learn c++ stl
c++ for beginners
C++ Vector in 20 Minutes 🔥 | Complete Vector Tutorial for DSA & Coding Interviews
🔥 C++ STL IN 30 MINUTES — Complete Introduction for DSA & Coding Interviews!

Confused about C++ STL while solving DSA and LeetCode problems? In this video, we’ll understand the Standard Template Library (STL) from scratch and learn the most important concepts you actually need for competitive programming, DSA, placements and coding interviews.

Instead of spending hours learning STL, this 30-minute C++ STL crash course gives you a practical overview of the most important STL components with examples and complexity.

🚀 What You'll Learn

✅ What is C++ STL?
✅ Why STL is important for DSA
✅ STL Containers
✅ Vector
✅ Pair
✅ List
✅ Stack
✅ Queue
✅ Priority Queue
✅ Set
✅ Map
✅ Unordered Map / Set
✅ Iterators
✅ Important STL Algorithms
✅ sort()
✅ reverse()
✅ find()
✅ binary_search()
✅ lower_bound()
✅ upper_bound()
✅ min() / max()
✅ Time Complexity of important STL operations
✅ How STL helps in LeetCode & Coding Interviews

💡 Why Should You Learn STL?

If you're preparing for:

🔥 LeetCode
🔥 Coding Interviews
🔥 DSA Placements
🔥 Competitive Programming
🔥 Amazon / Microsoft / Google / Meta Interviews
🔥 C++ Programming

then knowing STL can significantly reduce the amount of code you need to write and help you focus on the actual problem-solving logic.

By the end of this video, you should have a clear roadmap of which C++ STL containers, functions and algorithms you need to learn for DSA.

👉 Subscribe to TheCodePathshala for practical DSA, C++, LeetCode and System Design videos.

👍 Like the video if this STL crash course helped you!

💬 Comment below: Which STL topic confuses you the most?

#️⃣ HASHTAGS

#Cpp #CPlusPlus #STL #CPPSTL #DSA #DSAInCPlusPlus #CodingInterview #LeetCode #CompetitiveProgramming #Programming #CppProgramming #Coding #SoftwareEngineering #TheCodePathshala

SEO KEYWORDS / TAGS

c++ stl, c++ stl tutorial, c++ stl complete tutorial, c++ stl in 30 minutes, c++ stl crash course, c++ standard template library, standard template library in c++, c++ stl for dsa, c++ stl for beginners, c++ stl interview, c++ stl coding interview, c++ stl containers, c++ vector, c++ pair, c++ list, c++ stack, c++ queue, c++ priority queue, c++ set, c++ map, unordered_map c++, unordered_set c++, c++ iterators, c++ algorithms, c++ sort, c++ lower_bound, c++ upper_bound, c++ dsa, dsa in c++, leetcode c++, competitive programming c++, c++ coding interview, c++ placement preparation, c++ interview preparation, learn c++ stl, c++ stl explained, c++ stl one shot, c++ stl complete guide, c++ stl tutorial hindi, c++ stl hindi, standard template library tutorial
c++, stl, standard template library, dsa, data structures, algorithms, c++ interviews, stl introduction, c++ programming, coding interviews, competitive programming, stl functions, stl containers, learn c++, c++ basics, stl, cplus, cpp, stl, stl, cppp, alogrithms, c++ in 30 minutes, c stl, datastructure, algorithims
C++ STL IN 30 MINUTES 🔥 | Complete STL Introduction for DSA & Interviews
Important!!
Is DSA required for FAANG interview 🇮🇳♥️
Bug free code | prod ready #google #leetcode #codeprep #codeadventure #codeeveryday
2 sum in O(n) #google #microsoft
Design a system for 10 million users #Design #google #microsoft #interview
System design basic #systemdesign #apple #google
LeetCode #1 – Two Sum | Under 3 Minutes #leetcode #viral #codeeveryday #codelife
Load More... Subscribe

TCP DSA

75
150
351

TCP HLD

50
101

Recent Posts

  • CAP THEOREM
  • TCP DSA 351
  • TCP HLD 101
  • TCP HLD 50
  • TCP DSA-150

    Recent Comments

    1. Odell Volner on C program to print multiplication table of a given number
    2. Crista Diegidio on C program to print multiplication table of a given number
    3. Daniel Pauling on C program to print multiplication table of a given number
    4. Tonisha Hepp on C program to print multiplication table of a given number
    5. Jorge Layng on C program to print multiplication table of a given number

    Copyright © 2026 Learn to Code and Code to Learn.

    Powered by PressBook Blog WordPress theme