life is too short for a diary



Posts Tagged: java (Page 5)

Maximum Width of Binary Tree
The problem statement, as given on LeetCode, asks us to find the maximum width of a binary tree. The width of a level is defined as the number of nodes at that level. The maximum width of the binary tree is the maximum width among all levels...

Continue reading → python queue java


Binary Tree Right Side View Leetcode
We delve into a popular algorithmic problem from LeetCode: the "Binary Tree Right Side View". This problem is an excellent exercise for understanding tree-based data structures and breadth-first traversal techniques...

Continue reading → python queue java


Understanding Liskov Substitution Principle
The Liskov Substitution Principle, named after Barbara Liskov who introduced it in 1987, is one of the five SOLID principles of object-oriented design and programming. It states that..

Continue reading → oop java