149 docs tagged with "String"

This is a solution to the 1190. Reverse Substrings Between Each Pair of Parentheses problem on LeetCode.

This is a solution to the 1717. Maximum Score From Removing Substrings problem on LeetCode.

This is a solution to the 3211. Generate Binary Strings Without Adjacent Zeros.

This is a solution to the 3216. Lexicographically Smallest String After a Swap problem on LeetCode.

find the number of triplets with given sum .

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

This is a solution to the 786. K-th Smallest Prime Fraction problem on LeetCode.

This gives solution to the problem basic calculator

This gives solution to the problem basic calculator II

This is a solution to the Binary Number with Alternating Bits problem on LeetCode.

This is a solution to the Check if the sentence is Pangram problem on LeetCode.

This tutorial covers the solution to the Check if Two Strings are Anagram problem from the GeeksforGeeks website, featuring implementations in Python and C++.

This is a solution to clear digits in leetcode

This is a solution to the Clone graph problem on LeetCode.

Given two version strings, compare them. Return -1, 1, or 0 based on the comparison.

This is a solution to the Complex Number Multiplication problem on LeetCode.

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

This is a solution to the Count Binary Substrings problem on LeetCode.

Count pairs of indices where one string is both a prefix and suffix of another string.

Return the total number of substrings of a string that start and end with a given character.

This is a solution to the Count the Number of Powerful Integers problem on LeetCode.

This is a solution to count unique characters of all substrings of a given-string problem on LeetCode.

This is a solution to the Count Vowel Strings in Ranges problem on LeetCode.

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

This document provides a solution to the leetcode 211

Problem Description

This is a solution to the Detect Pattern problem on LeetCode.

This is a solution to the Determine if String Halves Are Alike problem on LeetCode.

Given two strings s and t, return the number of distinct subsequences of s which equals t. The test cases are generated so that the answer fits on a 32-bit signed integer.

Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2.

Given an integer columnNumber, return its corresponding column title as it appears in an Excel sheet.

Check if any substring of length 2 in a string is also present in its reverse.

Given a string s and an array of query strings words, return the number of words that can be transformed into s by extending groups of identical characters in the word to have a size of three or more.

This is a solution to the Fascinating Number problem on Geeks for Geeks.

Given a list of strings words and a string pattern, return words that match pattern where each unique character in pattern maps uniquely to characters in the word.

This is a solution to the Find Beautiful Indices in the Given Array I problem on LeetCode.

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 First Palindromic String in the Array in leetcode

This document provides a solution where we need to find the nearest palindrome to a given number n, the idea is to generate potential palindromic candidates close to n and then determine which one is closest in terms of absolute difference.

Problem Description

Write a function that returns the count of arguments passed to it.

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

Given an integer n, return a string array answer (1-indexed) where "FizzBuzz" if i is divisible by 3 and 5, "Fizz" if i is divisible by 3, "Buzz" if i is divisible by 5, i (as a string) if none of the above conditions are true.

This is a solution to the Fraction Addition and Subtraction problem on LeetCode.

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

This is a solution to the Gas station problem on LeetCode.

This is a solution to the Generate Parentheses problem on LeetCode.

This is a solution to the goal parser interpretation in leetcode

Given an array of strings , group the anagrams together.

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

This document provides solutions to check if a string is a substring of another.

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

This is a solution to Is Subsequence in leetcode

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

This is a solution to the Jewels and Stones on leetcode

Determine the minimum number of adjacent letter swaps needed to transform string s1 into string s2, given that s1 and s2 are anagrams.

Problem Description

Given a list of non-negative integers nums, arrange them such that they form the largest number and return it.

This is a solution to the Length of the Longest Alphabetical Continuous Substring problem on LeetCode.

Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.

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

This document provides a solution where we Return a string denoting the lexicographically smallest string t

finds logest comman prefix for a given string.

This is a solution to the Longest Happy String problem on LeetCode.

Given a string s, find the longest palindromic subsequence's length in s.

Given a string s, return the longest palindromic substring in s.

This is a solution to the Longest Subsequence Repeated k Times problem on LeetCode.

This is a solution to the Longest Substring Of All Vowels in Order problem on LeetCode.

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

Given an array of strings strs, return the length of the longest uncommon subsequence between them. If the longest uncommon subsequence does not exist, return -1.

This is a solution to the longest word in dictionary through deleting problem on LeetCode.

This is a solution to the Maximize the Confusion of an Exam problem on LeetCode.

This is a solution to the Maximize the Number of Partitions After Operations problem on LeetCode.

This is a solution to the Maximum Binary String After Change problem on LeetCode.

The given Solution class uses a greedy approach to maximize the number of potholes repaired within the given budget by prioritizing the repair of larger contiguous pothole segments first.

Determine the maximum number of palindromes that can be formed from an array of strings after performing some operations.

This is a solution to the 2002. Maximum Product of the Length of Two Palindromic Subsequences problem on LeetCode.

Solve the problem of finding the maximum product of the lengths of two non-intersecting palindromic substrings in a given string.

This is a solution to the Mini Parser problem on LeetCode.

This document explores different approaches to solving the problem of finding the minimum index of a character in a string that is also present in another string, including solutions in JavaScript, TypeScript, Python, Java, and C++.

Problem Description

Find the minimum number of pushes needed to type a string word after remapping keys on a telephone keypad.

Solve the problem of finding the minimum time required for a word to revert to its initial state after performing specific operations.

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 "".

This document provides a solution of Minimum-cost-walk-in-weighted-graph

This document provides a solution of Minimum-operation-to-make-median-of-array-equal-to-k

This document provides a solution of minimum-rectangle-to-cover-point

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

Determine the number of times a user has to change the key when typing a given string.

Write the string ss across multiple lines with each line no wider than 100 pixels, counting the total number of lines and the width of the last line, given the widths of each letter.

This is a solution to the Number of Pairs of Strings With Concatenation Equal to Target problem on LeetCode.

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

This is a solution to the Optimal Division problem on LeetCode.

Given a string s and an integer k, return the lexicographically smallest string that can be formed by repeatedly moving one of the first k characters of s to the end of the string.

This is a solution to the Palindrom Partitioning problem on LeetCode.

This is a solution to the Palindrom Partitioning -II problem on LeetCode.

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

Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order.

This is a solution to positions-of-large-groups problem on LeetCode.

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

This document provides solutions to this problem implemented in C++, Java, and Python.

This is a solution to the Rearrange Spaces Between Words problem on LeetCode.

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

Given an input string s and a pattern p, implement regular expression matching with support for '.' and '*' where '.' matches any single character and '*' matches zero or more of the preceding element.

Solution to Leetcode 1209. Remove All Adjacent Duplicates in String II

This is a solution to Remove All Occurences of a Substring in leetcode

This document provides a solution to the Remove Invalid Parentheses

This is a solution to the Replace All ?'s to Avoid Consecutive Repeating Characters problem on LeetCode.

Problem Description

This is a solution to the Reverse Only Letters problem on LeetCode.

This is a solution to the Reverse String II problem on LeetCode.

This is a solution to the Reverse Vowels of a String problem on LeetCode.

This tutorial covers the solution to the Reverse Words in a Given String problem from the GeeksforGeeks website, featuring implementations in Python and C++.

Given an input string s, reverse the order of the words.

This is a solution to the Reverse Words in a String III problem on LeetCode.

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

This is a solution to the Rotate String problem on LeetCode.

Determine if it is possible to assign integers to variable names to satisfy all given equality and inequality equations.

Given a string ss and a character cc that appears in ss, return an array where each element at index ii represents the minimum distance from ii to any occurrence of cc in ss.

This document provides a solution to finding the shortest palindrome by adding characters in front of the given string.

This is a solution to the Shuffle String problem on LeetCode.

Problem Description

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 sort the people in leetcode

Solution to Leetcode 1221. Split a String in Balanced Strings

This is a solution to the Split a String Into the Max Number of Unique Substrings problem on LeetCode.

This is a solution to split-concatenated-strings problem on LeetCode.

This is a solution to the String Matching in an Array problem on LeetCode.

Implement the myAtoi(string s) function, which converts a string to a 32-bit signed integer.

This is a solution to the String Without AAA or BBB problem on LeetCode.

This is a solution to student-attendance-record-i 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.

This is a solution to the Tag Validator problem on LeetCode.

This is a solution to To Lower Case in leetcode

Given a sentence and a number k, truncate the sentence to the first k words.

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

Given a string s, return whether s is a valid number.

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

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

solution to the leetcode problem Word Abbreviation.

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 ladder II problem on LeetCode.

This is a solution to the word ladder problem on LeetCode.

This document provides a solution to the Word Search II problem, where we need to return all words on the board, given an mXn board of characters and a list of strings words.

Given an m x n grid of characters board and a string word, return true if word exists in the grid.

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

Convert the given string into a zigzag pattern with a specified number of rows.