algorithm collections
Algorithm
58. Length of Last WordSolved #Easy #String problem Given a string s consisting of words and spaces, return the length of the last word in the string. A word is a maximal substring consisting of non-space characters only. Example 1: * Input: s = "Hello World" * Output: 5 * Explanation: The
Algorithm
2958. Length of Longest Subarray With at Most K Frequency #Medium #Array #Hash_table #Sliding_window problem You are given an integer array nums and an integer k. The frequency of an element x is the number of times it occurs in an array. An array is called good if
Algorithm
713. Subarray Product Less Than K #Medium #Array #SlidingWindow problem Given an array of integers nums and an integer k, return the number of contiguous subarrays where the product of all the elements in the subarray is strictly less than k. Example 1: * Input: nums = [10,5,2,6], k
Algorithm
442. Find All Duplicates in an Array #Array #HashTable problem Given an integer array nums of length n where all the integers of nums are in the range [1, n] and each integer appears once or twice, return an array of all the integers that appears twice. You must write
Algorithm
1609. Even Odd Tree #Tree #Breadth-First Search #Binary Tree problem A binary tree is named Even-Odd if it meets the following conditions: - The root of the binary tree is at level index 0, its children are at level index 1, their children are at level index 2, etc. -
Algorithm
513. Find Bottom Left Tree Value #Medium #Binary_tree problem Given the root of a binary tree, return the leftmost value in the last row of the tree. python # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.
Algorithm
543. Diameter of Binary Tree #Binary_Tree problem Given the root of a binary tree, return the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not
Algorithm
387. First Unique Character in a String #hash_table problem Given a string s, find the first non-repeating character in it and return its index. If it does not exist, return -1. Example 1: Input: s = "leetcode" Output: 0 Example 2: Input: s = "loveleetcode" Output: 2
Algorithm
1207. Unique Number of Occurrences #Easy #Array #HashTable Problem URL problem Given an array of integers arr, return true if the number of occurrences of each value in the array is unique or false otherwise. Example 1: * Input: arr = [1,2,2,1,1,3] * Output: true * Explanation: The value
Algorithm
2385. Amount of Time for Binary Tree to be Infected #Medium #BFS #DFS #Binary Tree problem You are given the root of a binary tree with unique values, and an integer start. At minute 0, an infection starts from the node with value start. Each minute, a node becomes infected
Algorithm
Problem Consider all the leaves of a binary tree, from left to right order, the values of those leaves form a leaf value sequence. For example, in the given tree above, the leaf value sequence is (6, 7, 4, 9, 8). Two binary trees are considered leaf-similar if their leaf
Algorithm
1335. Minimum Difficulty of a Job Schedule #Hard Problem URL You want to schedule a list of jobs in d days. Jobs are dependent (i.e To work on the ith job, you have to finish all the jobs j where 0 <= j < i). You have to finish