Kunal Shaw

Number System

What is a number? A number is a mathematical object used to count, measure, and label. Numbers are also used to represent quantities and make calculations. For example, we use numbers in everyday life to count money, time, and things. Numbers themselves are categorized into various types, such as Natural

Sort Array By Parity

Problem Statement Given an integer array nums, move all the even integers at the beginning of the array followed by all the odd integers. Return any array that satisfies this condition. Examples Input: nums = [3,1,2,4] Output: [2,4,3,1] Explanation: The outputs [4,2,3,1]

Merge Sorted Array

Problem Description You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively. Merge nums1 and nums2 into a single array sorted in non-decreasing order. The final sorted array should not be

Merge Two 2D Arrays by Summing Values

Problem Statement You are given two 2D integer arrays nums1 and nums2. nums1[i] = [idᵢ, valᵢ] indicate that the number with the idᵢ has a value equal to valᵢ. nums2[i] = [idᵢ, valᵢ] indicate that the number with the idᵢ has a value equal to valᵢ. Each array contains unique

Merge Strings Alternately

Problem Description You are given two strings word1 and word2. Merge the strings by adding letters in alternating order, starting with word1. If a string is longer than the other, append the additional letters onto the end of the merged string. Return the merged string. Examples Input: word1 = "abc&

Assign Cookies

Problem Statement Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor greed[i], which is the minimum size of a cookie that the child will be content with;

Lemonade Change

Problem Statement At a lemonade stand, each lemonade costs $5. Customers are standing in a queue to buy from you and order one at a time (in the order specified by bills). Each customer will only buy one lemonade and pay with either a $5, $10, or $20 bill. You

Check Divisibility Rules for Numbers from 1 to 20

In this article, we'll take a closer look at divisibility rules. These are simple tricks that help you quickly determine if one number can be divided by another, without actually doing the division. These rules are really helpful for mental math, allowing you to solve problems faster, whether

Perform Modulo Operations

Introduction When dividing a number a by another number b, the result can either be a complete division with no remainder or leave a remainder. For instance, consider dividing 15 by 5: 15÷5=3 with no remainder. Here, 15 is divided by 5 with a quotient of 3 and

Counting Sort

Counting Sort is a simple sorting algorithm that sorts an array by counting the occurrences of each unique element and using those counts to determine their correct positions. It is efficient for datasets with a limited range of values and does not rely on comparisons to sort. Since the name

Find All Divisors of a Given Number

In this section, we will explore how to find all the divisors of a given number n. What is the divisor of a number? Divisors of a given number n are the numbers that divide n evenly without leaving a remainder. In other words, if n is divisible by k,

Quick Sort

Quick Sort is a highly efficient, comparison-based sorting algorithm that uses the divide-and-conquer approach. It works by selecting a "pivot" element, partitioning the array into two subarrays—elements smaller than the pivot and elements larger than or equal to it—and then recursively sorting these subarrays. Let us

Merge Sort

Merge Sort is a divide-and-conquer algorithm that efficiently sorts an array or list by dividing it into smaller parts, sorting those parts, and then merging them back together. What is a Divide and Conquer Algorithm? A divide-and-conquer algorithmic paradigm is a systematic approach to solving complex problems by breaking them

Find the Number of Trailing Zeroes in the Factorial of a Given Number n

Examples :  Input: 5 Output: 1 Explanation: A factorial of 5 is 120, so it had only 1 trailing zero.  Input: 10 Output: 2 Explanation: A factorial of 5 is 3628800, so it had only 2 trailing zeros.  💡Try it yourself first! Intuition The brute force approach to this question is

Contains Duplicate Solution In C++/Python/Java/Javascript

Problem Description 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. Examples: Input: nums = [1, 2, 4, 3, 1]. Output: true Explanation: Here element 1 occurs two times at index 0 and 4. Input:

Calculate the Factorial of a Number

The factorial of a non-negative integer n is a mathematical function denoted by n! It represents the product of all positive integers from 1 up to n. Examples :  Input: 5 Output: 120 Explanation: 5! is equal to 5*4*3*2*1 = 120. Input: 4 Output: 24 Explanation: 4! is

Generate Fibonacci Numbers up to a Given Limit Solution in C++/Java/Python/JS

A Fibonacci number is part of a sequence of numbers known as the Fibonacci sequence, which is characterized by the fact that every number after the first two is the sum of the two preceding ones. The sequence starts with 0 and 1, and from there, each subsequent number is

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

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 a few 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.