97 docs tagged with "Hash Table"

This is a solution to the Integer to English Words problem on LeetCode.

This is a solution to the Count Number of Nice Subarrays problem on LeetCode.

This is a solution to the Number of Good Pairs problem on LeetCode.

This is a solution to the Sum of Beauty of All Substrings problem on LeetCode.

This is a solution to the 2150. Find All Lonely Numbers in the Array problem on LeetCode.

This is a solution to the 2653. Sliding Subarray Beauty problem on LeetCode.

find the number of triplets with given sum .

Given a string s, sort it in decreasing order based on the frequency of the characters. The frequency of a character is the number of times it appears in the string.

This is a solution to the 567. Permutation in String problem on LeetCode.

This is a solution to the 846. Hand of Straights.

Problem Description

This is a solution to the 2729.

This is a solution to clear digits in leetcode

Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i - j) <= k.

Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.

Given a binary array nums, return the maximum length of a contiguous subarray with an equal number of 0 and 1.

This is a solution to the Convert an Array Into a 2D Array With Conditions problem on LeetCode.

This is a solution to the Count Distinct Numbers on Board problem on LeetCode.

This is a solution to the Count Elements With Maximum Frequency problem on LeetCode.

This is a solution to Count Number of Texts problem on LeetCode.

This is a solution to the Custom Sort String problem on LeetCode.

This is a solution to the Degree of an Array problem on LeetCode.

This is a solution to the Design a Food Rating System problem on LeetCode.

This is a solution to the Design HashMap problem on LeetCode.

This is a solution to the Evaluate Bracket Pairs problem on LeetCode.

Find one pair of candy boxes, one from Alice and one from Bob, to swap so they both end up with the same total number of candies.

Problem Description

This document provides solutions for the Find Common Characters problem on LeetCode.

This is a solution to the Find Duplicate File in System problem on LeetCode.

This is a solution to the Find Original Array From Doubled Array problem on LeetCode.

This is a solution to the Find the number of good pairs 1 in leetcode

This is a solution to the Find The Town Judge problem on LeetCode.

Find the smallest missing positive integer.

This is a solution to the first unique character in a string in leetcode

Solution to Leetcode 2605. Form Smallest Number From Two Digit Arrays

Given two integers representing the numerator and denominator of a fraction, return the fraction in string format.

Given an array of strings , group the anagrams together.

This document provides a solution for Happy Number problem on LeetCode.

The problem no. is 1365. The Problem is How Many Numbers Are Smaller Than the Current Number

This is a solution to the HTML Entity Parser problem on LeetCode.

Convert a given integer to a Roman numeral using specific rules for the Roman numeral system.

Solution to Leetcode 349. Intersection of Two Arrays

Solution to Leetcode 350. Intersection of Two Arrays II

This document provides solutions for determining if two strings are isomorphic.

This is a solution to the Jewels and Stones on leetcode

The problem no. is 1351. The Problem is Count Negative Numbers in a Sorted Matrix.

This is a solution to the Largest Component Size by Common Factor problem on LeetCode.

This is a solution to the Lexicographically Minimum String After Removing Stars problem on LeetCode.

This is a solution to the LFU Cache problem on LeetCode.

Given an m x n picture consisting of black 'B' and white 'W' pixels, return the number of black lonely pixels.

finds logest comman prefix for a given string.

Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence.

This is a solution to the Longest Substring Without Repeating Characters problem on LeetCode.

Given an array nums of size n, return the majority element. The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.

This is a solution to the Make Sum Divisible by P problem on LeetCode.

This is a solution to the Maximum Size of a Set After Removals problem on LeetCode.

This is a solution to the maximum xor of two numbers in an array problem on LeetCode.

This is a solution to minimum common value in leetcode

This is a solution to the 2260. Minimum Consecutive Cards to Pick Up problem on LeetCode.

This is a solution to the Minimum Index Sum of Two Lists problem on LeetCode.

This is a solution to the Minimum Time to Collect All Apples in a Tree problem on LeetCode.

Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "".

Problem Description

Given the root of a binary tree, return the most frequent subtree sum. If there is a tie, return all the values with the highest frequency in any order.

Given an array of size 2N, find the element that is repeated N times.

This is a solution to the next greater element I problem on LeetCode.

This is a solution to the Number of Arithmetic Triplets in leetcode

Solve the problem of counting the number of words that are subsequences of a given string using various efficient methods.

This is a solution to the Number of Pairs of Interchangeable Rectangles problem on LeetCode.

This is a solution to the Open the Lock problem on LeetCode.

This is a solution to the Palindrome Pairs problem on LeetCode.

This is a solution to the Prefix and Suffix Search problem on LeetCode.

This is a solution to the Rearranging Fruits problem on LeetCode.

This is a solution to the Replace Words problem on LeetCode.

Convert a given Roman numeral to an integer using specific rules for the Roman numeral system.

Problem Description

This is a solution to the Shortest Word Distance II problem on LeetCode.

Given a string s, sort it in decreasing order based on the frequency of the characters. The frequency of a character is the number of times it appears in the string.

Given a string s, sort it in decreasing order based on the frequency of the characters. The frequency of a character is the number of times it appears in the string.

This is a solution to the Split Array into Consecutive Subsequences problem on LeetCode.

Given an array of count-paired domains, return an array showing the total visit counts for each subdomain and its parent domains.

A concatenated string is a string that exactly contains all the strings of any permutation of `words` concatenated.

Problem Description

Solution to Leetcode 2615. Sum of Distances

This is a solution to the Task Scheduler problem on LeetCode.

This is a solution to theTuple with Same Product problem on LeetCode.

Return a distinct array containing all the values that are present in at least two out of the three arrays.

Design and implement a TwoSum class.

This is a solution to the Two Sum problem on LeetCode.

Problem Description

Solution to Leetcode 1207. Unique Number of Occurrences

This is a solution to the Valid Anagram problem on LeetCode.

Problem Description

Problem Description

Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words.

This is a solution to the Word Subsets problem on LeetCode.

This is a solution to the X of a Kind in a Deck of Cards problem on LeetCode.