95 docs tagged with "Math"

This is a solution to the 2348. Number of Zero-Filled Subarrays problem on LeetCode.

This is a solution to the 3115. Maximum Prime Difference problem on LeetCode.

find the number of triplets with given sum .

This is a solution to the 973. K Closest Points to Origin problem on LeetCode.

Problem Description

Given an integer num, repeatedly add all its digits until the result has only one digit, and return it.

Problem Description

This is a solution to the Add Two Numbers problem on LeetCode.

This gives solution to the problem basic calculator

This gives solution to the problem basic calculator II

Alice and Bob take turns erasing one number from the chalkboard. If removing a number makes the bitwise XOR of all remaining numbers become 0, the player who made that move loses. If at any player's turn, the XOR of all numbers on the chalkboard is already 0, that player wins. Alice starts first, and both play optimally to avoid losing.

This document provides a solution where we need to reach the point (targetX, targetY) using a finite number of steps.

This is a solution to the 2729.

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

This is a solution to consecutive-numbers-sum problem on LeetCode.

Problem Description

The problem no. is 2180. The Problem is to Count Integers With Even Digit Sum

The problem no. is 2169. The Problem is to count Operations to Obtain Zero.

This is a solution to the Count Primes problem on LeetCode.

This is a solution to the Difference Between Element Sum and Digit Sum of an Array problem on LeetCode.

This is a solution to the 2894. Find difference of divisible and nondivisible sums.

Solve the problem of finding the number of ways to tile a 2 x n board using 2 x 1 dominos and tromino shapes.

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

Given an integer n, return the number of trailing zeroes in n!.

This document provides a solution where we need to Write an API that generates fancy sequences using the append, addAll, and multAll operations.

Problem Description

This document provides solutions for the Find Minimum Operations to Make All Elements Divisible by Three problem.

Solution for finding the child who has the ball after K seconds.

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.

Given two arrays of equal length, nums1 and nums2, find the integer that has been added to each element of nums1 to obtain nums2.

This is a solution to the 2769.

This is a solution to the Find the N-th Value After K Seconds problem on LeetCode.

This is a solution to the Find the Square Root problem on Geeks for Geeks.

Calculate the sum of encrypted integers by replacing each digit in the integer with the largest digit in the integer.

This is a solution to the Find the Winner of the Circular Game problem on 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.

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

Solution to Leetcode 2600. K Items With the Maximum Sum

This document provides a solution where we Return the $k^th$ smallest amount that can be made using these coins.

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

Given a set of distinct positive integers nums, return the largest subset answer such that every pair (answer[i], answer[j])

Problem Description

finds logest comman prefix for a given string.

This tutorial covers the solution to the Magic Number problem from the GeeksforGeeks.

Problem Description

This document provides a solution where we Return an integer denoting the maximum number of groups you can create while satisfying these conditions.

This is a solution to the Maximum Product of Three Numbers problem on LeetCode.

Given a square room with mirrored walls and receptors at corners, a laser ray emitted from the southwest corner reflects off mirrors and reaches a receptor based on specified conditions.

Problem Description

This tutorial covers the solution to the Nth Fibonacci Number problem from the GeeksforGeeks.

This tutorial covers the solution to the Nth Fibonacci Number problem from the GeeksforGeeks website, featuring implementations in Python and C++.

This is a solution to the Number of Common Factors

This document provides a solution where we count the total number of digit $1$ appearing in all non-negative integers less than or equal to n.

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

Problem Description

This is a solution to the Numbers At Most N Given Digit Set 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.

Given an integer x, return true if x is a palindrome, and false otherwise.

Solution to Leetcode 2582. Pass the Pillow

This document provides solutions for the Perfect Number problem.

The set [1, 2, 3, ..., n] contains a total of n! unique permutations. Given n and k, return the kth permutation sequence.

Problem Description

This is a solution to the Power of Four problem on LeetCode.

Problem Description

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

Solution to Leetcode 2614. Prime In Diagonal

solution to the leetcode problem Random Pick With Weight.

This gives solution to the problem rectangle area

Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-2^31, 2^31 - 1], then return 0.

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

Solution to Leetcode 396. Rotate Function.

given an 2D matrix which is representing an image, rotate the image by 90 degrees.

This is a solution to the Score of Students Solving Math Expression problem on LeetCode.

This is a solution to the Self Dividing Numbers problem on LeetCode.

Problem Description

Problem Description

This document provides a solution where we split an array into two non-empty subsets such that both subsets have the same average.

This is a solution to the Split Linked List in Parts problem on LeetCode.

This is a solution to the Stone Game III problem on LeetCode.

This document provides solutions for the Strictly Palindromic Number problem.

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

Problem Description

This is the solution of question Super Ugly Number on leetcode

This is a solution to the Third Maximum Number problem on LeetCode.

Problem Description

This is a solution to the total hamming distance problem on LeetCode.

This document provides a solution to the Ugly Number problem, where we need to determine if a number is an ugly number.

This document provides a solution to the Ugly Number II problem, where we need to find the nth ugly number.

Solution to Leetcode 1201. Ugly Number III

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

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

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