Binary Search is one of the most popular searching algorithms. We use this to search specific elements on a sorted list. It doesn’t matter it’s ascending...
Continue reading...Reverse Vowels of a String | LeetCode 345 | Python | Solution
Click here to see the problem details on LeetCode. Reverse a string is a pretty common type of problem. We all know how to reverse a...
Continue reading...Overview of Tree Data Structure
Intro When we hear the word tree before we know the tree of computer science, the image of the tree of real-life floats in our eyes....
Continue reading...Markdown | Simple and Easy language for Formatting Text
Intro Markdown is a light Markup language for formatting text and more readable content. It’s easy to learn, and you will not regret it after learning...
Continue reading...Richest Customer Wealth | LeetCode 1672 | Python | Solution
Click here to see the problem details. And read the problem details. Pretty simple problem. We will receive a 2D array. Where array[i] is the list...
Continue reading...How to Get Current Time and Date Using JavaScript Date Object
Date object is pretty useful. Often, you have to use it If you use JavaScript. Not only current time and date, but also we can do...
Continue reading...Average of Levels in Binary Tree | LeetCode 637 | Python | Solution
Click here to see the problem details on LeetCode. Pretty simple Binary Tree problem. We can solve this using the Level Order Traversal algorithm. This way,...
Continue reading...Create Queue Data Structure Using JavaScript Array Methods
I already have an article about it. Click here to see it. I am not going to details of it but the code implementation. Queue is...
Continue reading...Create Stack Data Structure Using JavaScript Array Method
I already have an article about it. Click here to see it. I am not going to details of it but the code implementation. Stack is...
Continue reading...Remove All Occurrences of a Substring | LeetCode 1910 | Python | Solution
Click here to see the problem details. Problem Overview We will be given a string (s) and a substring (part). We have to remove all occurrences...
Continue reading...