Leetcode #: 239 Name: Sliding Window Maximum Difficulty: Hard Url: https://leetcode.com/problems/sliding-window-maximum/ Problem Statement You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the…

Leetcode #: 1472 Name: Design Browser History Difficulty: Medium Url: https://leetcode.com/problems/design-browser-history/ Prompt You have a browser of one tab where you start on the homepage and you can visit another url, get back in the history number of steps or move forward in the history number of steps. Implement the BrowserHistory…

Leetcode #: 797 Name: All Paths From Source to Target Difficulty: Medium Url: https://leetcode.com/problems/all-paths-from-source-to-target/ Prompt Given a directed acyclic graph (DAG) of n nodes labeled from 0 to n - 1, find all possible paths from node 0 to node n - 1 and return them in any order. The graph…

Leetcode #: 430 Name: Flatten a Multilevel Doubly Linked List Difficulty: Medium Url: https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/ Prompt You are given a doubly linked list, which contains nodes that have a next pointer, a previous pointer, and an additional child pointer. This child pointer may or may not point to a separate doubly linked…

Leetcode #: 394 Name: Decode String Difficulty: Medium Url: https://leetcode.com/problems/decode-string/ Prompt Given an encoded string, return its decoded string. The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note that k is guaranteed to be a positive integer. You may assume that…

Leetcode #: 1209 Name: Remove All Adjacent Duplicates in String II Difficulty: Medium Url: https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/ Prompt You are given a string s and an integer k, a k duplicate removal consists of choosing k adjacent and equal letters from s and removing them, causing the left and the right side of…

Leetcode #: 380 Name: Insert Delete GetRandom O(1) Difficulty: Medium Url: https://leetcode.com/problems/insert-delete-getrandom-o1/ Prompt Implement the RandomizedSet class: RandomizedSet() Initializes the RandomizedSet object. bool insert(int val) Inserts an item val into the set if not present. Returns true if the item was not present, false otherwise. bool remove(int val) Removes an item…

Leetcode #: 62 Name: Unique Paths Difficulty: Medium Url: https://leetcode.com/problems/unique-paths/ Prompt There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner (i.e., grid[m - 1][n - 1]). …

Leetcode #: 70 Name: Climbing Stairs Difficulty: Easy Url: https://leetcode.com/problems/climbing-stairs/ Prompt You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Example 1 Input: n = 2 Output…