Check if a Number is an Armstrong Number

Given a non-negative integer num, check whether the given number is an Armstrong number or not. An Armstrong number is a number that is equal to the sum of its digits each raised to the power of the number of digits in the number. Examples :  Input: 1634 Output: true Explanation:

Check if a Number is a Palindrome

Given a non-negative integer num, check whether the given number is palindrome or not. What is a palindrome? A palindrome is a word, phrase, number, or any other sequence of characters that reads the same forward and backward. Examples Input: 121 Output: true Explanation: The number 121 reads the same

Reverse a Given Number

Given an integer num, reverse the digits of the number and return the reversed number. Examples Input: 687 Output: 786 Explanation: If we reverse the number 687, we will get 786. Input: 120 Output: 21 Explanation: If we reverse the number 120, we will get 021 so after removing trailing

Find the Sum of Digits of a Number

Given a number num, find the sum of digits of the number. What is the "Sum Of Digits of A Number" Input: 687 Output: 21 Explanation: The sum of digits i.e. 6 + 8 + 7 is equal to 21. Input: 12 Output: 3 Explanation: The Sum Of Digits

Introduction to Basic Math

Before diving into the world of programming, it's essential to build a strong foundation in mathematics, In this section, we will walk through fundamental mathematical concepts in a structured manner, ensuring that you not only understand them but also see how they apply to real-world programming challenges. Hold

Substring with Concatenation of All Words

Problem Description You are given a string s and an array of strings words. All the strings of words are of the same length. A concatenated string is a string that exactly contains all the strings of any permutation of words concatenated. For example, if words = ["ab","

Minimum Window Substring

Problem Description 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 "". The testcases will be

Substrings of Size Three with Distinct Characters Solution In C++/Python/Java/Javascript

Problem Description A string is good if there are no repeated characters. Given a string s , return the number of good substrings of length three in s . Note that if there are multiple occurrences of the same substring, every occurrence should be counted. What is a substring? A substring is

Max Consecutive Ones III Solution In C++/Python/Java/JS

Problem Description Given a binary array nums and an integer k, return the maximum number of consecutive 1's in the array if you can flip at most k 0s. Binary Array: An array with only 0s or 1s. Explanation You're given an array of binary values

Longest Repeating Character Replacement

Problem Description You are given a string s with all Upper Case characters (‘A,’’ B,’….’Z’) and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform this operation at most k times. Return the length of

Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit

Problem Description Given an array of integers nums and an integer limit, return the size of the longest non-empty subarray such that the absolute difference between any two elements of this subarray is less than or equal to the limit. What is a Subarray ? It's a sequence of

Minimum Size Subarray Sum

Problem Description Given an array of positive integer nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal to the target. If there is no such subarray, return 0 instead. What is a Subarray ? It's a sequence of

Count the Number of Substrings With Dominant Ones

Problem Description You are given a binary string s. A string is called a good substring if it has dominant ones, i.e., if the number of ones in the string is greater than or equal to the square of the number of zeros in that particular substring. Return the

Longest Substring Without Repeating Characters

Problem Description You will be given a string. Find the longest substring of the string s such that each character in that particular substring is unique. What is a Substring? A substring is a contiguous sequence of characters within a string. For a string s = "abcdef", a substring

Minimum Penalty for a Shop

Problem Description You are given the customer visit log of a shop represented by a 0-indexed string customers consisting only of characters 'N' and 'Y': if the ith character is 'Y', it means that customers come at the ith hour whereas 'N'

Coming Soon..

Hold tight! our team is working on more articles. We're constantly trying to bring a few new articles every week.

Coming Soon..

Hold tight! Our team is working on more articles. We're constantly trying to bring new articles every week.

Coming Soon..

Hold tight! our team is working on more articles. We're constantly trying to bring a few new articles every week.

Coming Soon..

Hold tight! Our team is working on more articles. We're constantly trying to bring new articles every week.

Coming Soon.

Hold tight! our team is working on more articles. We're constantly trying to bring a few new articles every week.

Coming Soon..

Hold tight! Our team is working on more articles. We're constantly trying to bring new articles every week.

Coming Soon..

Hold tight! Our team is working on more articles. We're constantly trying to bring new articles every week.

Coming Soon..

Hold tight! Our team is working on more articles. We're constantly trying to bring new articles every week.

Coming Soon..

Hold tight! Our team is working on more articles. We're constantly trying to bring new articles every week.

Coming Soon..

Hold tight! Our team is working on more articles. We're constantly trying to bring new articles every week.