In-depth Backtracking with LeetCode Problems — Part 1

Introduction and Permutation

Backtracking is a general algorithm for finding all (or some) solutions to some computational problems, that incrementally builds candidates to the solutions. As…

Best Time To Buy & Sell Stocks On Leetcode — The Ultimate Guide

Monotonic Queue Explained with LeetCode Problems

I have been searching online about an article related to monotonic queue or stack, there not much organized information. So, I decided to just write something about it on my own.

Definition of Monotonic Queue

Want to Crack Leetcode Problems Easily?

Greedy Algorithm Explained using LeetCode Problems

This article includes five sections:

1. What is Greedy Algorithm?
2. Guideline of Greedy Algorithm
3. LeetCode Examples
4. Exercises

Data Structures: Introductions and Implementation with Python

Including queue and stack, linked list, hast table, heap, tree.

1. Hashmap or Hash tables

Solving Tree Problems on LeetCode

Part of this great node comes from blog:

Solving Matrix/Graph Problems on LeetCode using Python

787. Cheapest Flights Within K Stops

There are n cities connected by m flights. Each fight starts from city u and arrives at v with a price w.

Solve Problems on LeetCode using Divide and Conquer, Dynamic Programming, and Backtracking

Array problems on LeetCode

1 Linked List Introduction

Like arrays, Linked List is a linear data structure. Unlike arrays, linked list elements are not stored at contiguous location; the elements are linked using pointers.