[medium] Path with Maximum Probability - LeetCode You are given an undirected weighted graph of n nodes (0-indexed), represented by an edge list where edges[i] = [a, b]…leetcode.com You are given an undirected weighted graph of n nodes (0-indexed), represented by an edge list where edges[i] = [a, b] is an undirected edge connecting the nodes a and b with a probability of success of traversing that edge succProb[i].

[medium] Group the People Given the Group Size They Belong To - LeetCode There are n people that are split into some unknown number of groups. Each person is labeled with a unique ID from 0 to…leetcode.com There are n people that are split into some unknown number of groups. Each person is labeled with a unique ID from 0 to n - 1. You are given an integer array groupSizes, where groupSizes[i] is the size of the group that person i is in. For example…

[medium] Koko Eating Bananas - LeetCode Koko loves to eat bananas. There are n piles of bananas, the pile has piles[i] bananas. The guards have gone and will…leetcode.com Koko loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours. Koko can decide her bananas-per-hour eating speed of k. Each hour, she chooses some pile of bananas and eats k bananas…

[medium] Linked List Cycle II - LeetCode Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null. There is a…leetcode.com Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null. There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally…

[easy] Word Pattern - LeetCode Given a pattern and a string s, find if s follows the same pattern. Here follow means a full match, such that there is…leetcode.com Given a pattern and a string s, find if s follows the same pattern. Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in s. Example 1: Input: pattern = "abba", s = "dog cat cat dog" Output…

[medium] String to Integer (atoi) - LeetCode Implement the myAtoi(string s) function, which converts a string to a 32-bit signed integer (similar to C/C++'s atoi…leetcode.com Implement the myAtoi(string s) function, which converts a string to a 32-bit signed integer (similar to C/C++'s atoi function). The algorithm for myAtoi(string s) is as follows: Read in and ignore any leading whitespace. Check if the next character (if not already at the end of the string) is…

[medium] Minimum Number of Arrows to Burst Balloons - LeetCode There are some spherical balloons taped onto a flat wall that represents the XY-plane. The balloons are represented as…leetcode.com There are some spherical balloons taped onto a flat wall that represents the XY-plane. The balloons are represented as a 2D integer array points where points[i] = [xstart, xend] denotes a balloon whose horizontal diameter stretches between xstart and xend. You do not know the exact y-coordinates of the…

[hard] Shortest Subarray with Sum at Least K - LeetCode Given an integer array nums and an integer k, return the length of the shortest non-empty subarray of nums with a sum…leetcode.com Given an integer array nums and an integer k, return the length of the shortest non-empty subarray of nums with a sum of at least k. If there is no such subarray, return -1. A subarray is a contiguous part of an array.

[medium] Insert into a Binary Search Tree - LeetCode You are given the root node of a binary search tree (BST) and a value to insert into the tree. Return the root node of…leetcode.com You are given the root node of a binary search tree (BST) and a value to insert into the tree. Return the root node of the BST after the insertion. It is guaranteed that the new value does not exist in the original BST.