Md Kamran

Add Binary Solution In C++/Java/Python/JS

Problem Description Given two binary strings a and b, return their sum as a binary string. Example Input: a = "11", b = "1" Output: "100" Input: a = "1010", b = "1011" Output: "10101" Constraints * 1 <= a.length, b.length

Number of 1 Bits Solution In C++/Java/Python/JS

Problem Description Given a positive integer n, write a function that returns the number of set bits in its binary representation (also known as the Hamming weight). What are Set Bits in Binary Representation? In binary, a set bit is simply a bit whose value is 1. For example, if

Number Complement Solution In C++/Java/Python/JS

Problem Description The complement of an integer is the integer you get when you flip all the 0's to 1's and all the 1's to 0's in its binary representation. For example, The integer 5 is "101" in binary and

Set the Rightmost Unset Bit Solution In C++/Java/Python/JS

Problem Description Given a non-negative number n. The problem is to set the rightmost unset bit in the binary representation of n. What is Set/Unset Bit? What is a Bit? In binary, every number is made of bits — and each bit can either be 0 or 1. These are

Check Odd or Even Solution In C++/Java/Python/JS

Problem Description Given a positive integer n, determine whether it is odd or even. Return true if the number is even and false if the number is odd. Example Input: n = 15 Output: false Explanation: The number is not divisible by 2, Odd number. Input: n = 44 Output: true Explanation:

Kth Bit is Set or Not Solution In C++/Java/Python/JS

Problem Description Given two positive integer n and  k, check if the kth index bit of n is set or not. What is a Kth Bit and Set Bit? What is the k-th bit? Every number in binary is made up of bits (0s and 1s). These bits are like

Get, Set, Clear ith Bit Solution In C++/Java/Python/JS

Problem Description Given a 32 bit unsigned integer num and an integer i. Perform following operations on the number -  1. Get i-th bit 2. Set i-th bit 3. Clear i-th bit Note : For better understanding, we are starting bits from 1 instead 0. (1-based). You have to print space

Decimal to Binary Solution In C++/Java/Python/JS

Problem Description Given a decimal number n, return its binary equivalent. What is Binary Representation of a Number? Binary representation of a number is a way of expressing it using only two digits: 0 and 1. Each digit represents a power of 2, starting from the right (least significant bit)

Sliding Window

Maximum Average Subarray I Solution In C++/Java/Python/JS

Problem Description You are given an integer array nums consisting of n elements, and an integer k. Find a contiguous subarray whose length is equal to k that has the maximum average value and return this value. Any answer with a calculation error less than 10^-5 will be accepted.

Sliding Window

Maximum Number of Vowels in a Substring of Given Length Solution In C++/Java/Python/JS

Problem Description Given a string s and an integer k, return the maximum number of vowel letters in any substring of s with length k. Vowel letters in English are 'a', 'e', 'i', 'o', and 'u'. What is a Substring?

Sliding Window

Check If a String Contains All Binary Codes of Size K Solution In C++/Java/Python/JS

Problem Description Given a binary string s and an integer k, return true if every binary code of length k is a substring of s. Otherwise, return false. What is a Substring? A substring is a continuous sequence of characters taken from a string, without changing their order. For example,

Sliding Window

Permutation in String Solution In C++/Java/Python/JS

Problem Description Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise. In other words, return true if one of s1's permutations is the substring of s2. What is a Permutation? A permutation of a string is a rearrangement of

Find All Anagrams in a String Solution In C++/Java/Python/JS

Problem Description Given two strings s and p, return an array of all the start indices of p's anagrams in s. You may return the answer in any order. What is an Anagram? An Anagram is when two words contain the exact same characters with the same frequency,

Reverse Vowels of a String Solution In C++/Java/Python/JS

Problem Description Given a string s, reverse only all the vowels in the string and return it. The vowels are 'a', 'e', 'i', 'o', and 'u', and they can appear in both lower and upper cases, more than once. Example

Count Binary Substrings

Problem Description Given a binary string s, return the number of non-empty substrings that have the same number of 0's and 1's, and all the 0's and all the 1's in these substrings are grouped consecutively. Substrings that occur multiple times are

Reverse Prefix of Word

Problem Description Given a 0-indexed string word and a character ch, reverse the segment of word that starts at index 0 and ends at the index of the first occurrence of ch (inclusive). If the character ch does not exist in word, do nothing. For example, if word = "abcdefd&

Greedy

Minimum Cost to Move Chips to the Same Position Solution in C++/Java/Python/JS

Problem Description We have n chips, where the position of the ith chip is position[i]. We need to move all the chips to the same position. In one step, we can change the position of the ith chip from position[i] to: 1) position[i] + 2 or position[i]

Prefix Sum

Left and Right Sum Differences

Problem Description Given a 0-indexed integer array nums, find a 0-indexed integer array answer where: 1) answer.length == nums.length. 2) answer[i] = |leftSum[i] - rightSum[i]|. Where: 1) leftSum[i] is the sum of elements to the left of the index i in the array nums. If there

Minimum Number of Operations to Convert Time

Problem Description You are given two strings current and correct representing two 24-hour times. 24-hour times are formatted as "HH:MM", where HH is between 00 and 23, and MM is between 00 and 59. The earliest 24-hour time is 00:00, and the latest is 23:59.

Minimum Operations to Make the Array Increasing

Problem Description You are given an integer array nums (0-indexed). In one operation, you can choose an element of the array and increment it by 1. For example, if nums = [1,2,3], you can choose to increment nums[1] to make nums = [1,3,3]. Return the minimum number

Minimum Time to Type Word Using Special Typewriter

Problem Description There is a special typewriter with lowercase English letters 'a' to 'z' arranged in a circle with a pointer. A character can only be typed if the pointer is pointing to that character. The pointer is initially pointing to the character 'a'

Sum of Unique Elements Solution In C++/Python/Java/Javascript

Problem Description You are given an integer array nums. The unique elements of an array are the elements that appear exactly once in the array. Return the sum of all the unique elements of nums. Example Input: nums = [1,2,3,2] Output: 4 Explanation: The unique elements are [1,

Maximum Sum With Exactly K Elements

Problem Description You are given a 0-indexed integer array nums and an integer k. Your task is to perform the following operation exactly k times in order to maximize your score: 1. Select an element m from nums. 2. Remove the selected element m from the array. 3. Add a

Maximum 69 Number

Problem Description We are given a positive integer num consisting only of the digits 6 and 9. The task is to return the maximum possible number that can be obtained by changing at most one digit (either a 6 becomes a 9 or a 9 becomes a 6). Examples Input:

Coming Soon..

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