Create a beautiful profile card using HTML and CSS

We often need to create a Profile Card for our website or web app. In this blog, let’s try to create a profile card using HTML and CSS. First of all, we create a container (profile-card), which represents the whole card. HTML CSS For icons, I have used LineIcons here. CDN link: Here, I have […]

Recursion | An Awesome Method for Solving Problems

Before getting into details, you don’t need to be disappointed if you don’t understand the recursion quickly. Initially, it may seem a bit complex or fuzzy to you. But don’t worry, it still seems vague to me. That’s why I will try to write on this topic to make it a little clearer to myself.

Overview of Python Dictionary | Data Structure

Dictionary in Python is a data structure. Dictionary is similar to HashTable with some extra features. HashTable is one of the most important data structures in computer science. You can use a dictionary as a HashTable. HashTable is excellent in terms of time complexity and easy data access. We can access, add, update, and delete

Number of Islands | LeetCode 200 | Python | Solution

LeetCode 200 The number of islands is one of the most popular programming problems. Read the problem description first. Before getting into the solution, I assume you already know about the DFS algorithm. We will use this algorithm to solve this problem. The four edges and ‘0’s will be counted as water in the given

If you are a self-learner, especially a computer programmer or developer, keep the following things in mind. I think keeping these in mind will help you. And save you a lot of time. I made a lot of mistakes during my learning period. I wasted an excessive amount of time, and I mean it. These

Binary Search Tree | Data Structure

Before getting into the Binary Search Tree (BST), you have to know the basics of Tree and Binary Tree. I assume that you have the basic idea of Tree and Binary Tree. Intro A Binary Search Tree is a special type of Binary Tree with some extra conditions. In a binary tree, a node can

Same Tree | LeetCode 100 | Python | Solution

LeetCode 100 It’s an easy LeetCode problem, and the description is concise and straightforward. We can solve this problem using the DFS algorithm. From two binary trees, we have to check whether both are the same or not. Consider the following cases for two different nodes. If both nodes are null, we can say that

Kth Smallest Element in a BST | LeetCode 230 | Python | Solution

LeetCode 230 I hope you already know about Binary Search Tree. In BST, each node is greater than its left subtree and smaller than its right subtree. If we print all the nodes of a BST using an inorder traversal algorithm, we will get the sorted value in ascending order. Inorder traversal follows the rule:

Binary Tree Level Order Traversal | LeetCode 102 | Python | Solution

LeetCode 102 This problem just simply the implementation of the level order traversal algorithm. If you don’t know about level order traversal yet, you can check my blog on this topic. As we know, using level order traversal, we traverse through the tree level by level. But in this problem, we have to separate values

Maximum Depth of Binary Tree | LeetCode 104 | Python | Solution

LeetCode 104 It’s a common and basic type of problem. The problem title is self-explanatory. We all know about a binary tree. To solve this problem, we have to find the maximum depth of a binary tree. We can solve this using both DFS and BFS algorithms. I am going to use the DFS solution.

Scroll to Top