One of the difficult topics in programming is the Sliding Window. It helps you to solve problems in a lower time complexity. This method is useful when we are solving...

Trie is an advanced data structure used to store strings so that we can search the string in O(N) time complexity, where N is the maximum length of a string....

Learn how I tackled 1000 LeetCode problems in just 300 days. Find out the strategies and tips that helped me boost my coding skills.

We will find the first and last position of element in a sorted array using binary search, with implementation in C++, Java, and Python.

Dynamic Programming is one of the important topics from DSA. It is asked in most of the interviews. Having a good grasp of Dynamic Programming helps you crack most interview...

We will solve the leetcode problem to Balance a Binary Search Tree using in-order traversal approach and implement it in C++, Java, and Python.

We will the leetcode problem to Sort Integers by the Number of 1 Bits, with implementation in C++, Java, and Python.

The undirected graph allows you to move in both directions of the edge, unlike the directed graph where you can only move in one direction which is specified. One interesting...

Understand the Subtree of Another Tree problem using the recursive approach, with implementation in C++, Java, and Python.

Understand how to Find Kth smallest element in a sorted matrix. This leetcode problem can be solved using Binary Search.