Greedy Algorithms: Understanding the Concept and Implementing in Java

Greedy algorithms are a class of algorithms used in computer science to solve optimization problems. These algorithms work by making the locally optimal choice at each step with the hope of finding a global optimum solution. In other words, at each step, they choose the option that looks best at the moment, without considering the…

Read more...

ModPow Method in Programming – Java

In computer programming, modular exponentiation, or modpow for short, is a common operation used in cryptography and other mathematical applications. It involves calculating the remainder of a number raised to a power modulo another number, where the modulo operation returns the remainder of the division of the first number by the second number. This article…

Read more...

Counting Bits In a Number – Leetcode

Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1‘s in the binary representation of i. Example 1: Input: n = 2 Output: [0,1,1] Explanation: 0 –> 0 1 –> 1 2 –> 10 Example 2: Input: n = 5 Output: [0,1,1,2,1,2] Explanation: 0 –> 0 1 –> 1 2…

Read more...

Print Digit of Number In Words

Given a number N, Print digits of that number in words. eg, 100 should be written as One Zero Zero Solution [Using Recursion]

Read more...