Table of Contents Problem Statement Using Breadth First Search Complexity Conclusion Problem Statement You are given an m x n grid where each cell can have one of three values: ...

Table of Contents Problem Statement Using Breadth First Search Complexity Conclusion Problem Statement Given the root of a binary tree, imagine yourself standing on the right side of it,...

Table of Contents Problem Statement Using Dynamic Programming Complexity Conclusion Problem Statement Given a string s and a dictionary of strings wordDict, return true if s can be segme...

Table of Contents Problem Statement Using Bucket Sort Complexity Conclusion Problem Statement Given an integer array nums and an integer k, return the k most frequent elements. You may r...

Table of Contents Problem Statement Using Tree DFS (Depth First Search) Conclusion Problem Statement Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tr...

Table of Contents Problem Statement Using Dynamic Programming Conclusion Problem Statement On day 1, one person discovers a secret. You are given an integer delay, which means that each p...

Table of Contents Problem Statement Using Two Stacks Conclusion Problem Statement Given an encoded string, return its decoded string. The encoding rule is: k[encoded_string], where the en...

Table of Contents Problem Statement Using Two Stacks Conclusion Problem Statement Implement a first in first out (FIFO) queue using only two stacks. The implemented queue should support al...

Table of Contents Problem Statement Using In-place Conclusion Problem Statement Given an m x n integer matrix matrix, if an element is 0, set its entire row and column to 0’s. You must do ...

Table of Contents Problem Statement Using Two Pointers Conclusion Problem Statement You are given the head of a singly linked-list. The list can be represented as: L0 → L1 → … → Ln - 1 → ...