Programming Problems for Beginners

• 1. Write a program to reverse a number

  Category: Number Manipulation

  Easy

  Create a function that takes a positive integer and returns the number with its digits reversed. For example, if the input is 123, the output should be 321.

  Examples:

  Example 1:

  Input:

  reverseNumber(123)

  Output:

  321

  The digits 1, 2, 3 are reversed to become 3, 2, 1

  Example 2:

  Input:

  reverseNumber(456789)

  Output:

  987654

  The digits 4, 5, 6, 7, 8, 9 are reversed to become 9, 8, 7, 6, 5, 4

  Example 3:

  Input:

  reverseNumber(1000)

  Output:

  1

  Leading zeros are ignored, so 1000 reversed becomes 1

  Hint:

  Show Hint

  Write CodeOpens JavaScript compiler in a new tab

  Solution:

  Show Solution

• 2. Write a program to print all elements of the Fibonacci series

  Category: Mathematical Series

  Easy

  Create a function that generates and prints the Fibonacci series up to n terms. The Fibonacci series starts with 0, 1 and each subsequent number is the sum of the previous two numbers.

  Examples:

  Example 1:

  Input:

  printFibonacciSeries(5)

  Output:

  0, 1, 1, 2, 3

  First 5 terms: 0, 1, 1, 2, 3 (each number is sum of previous two)

  Example 2:

  Input:

  printFibonacciSeries(8)

  Output:

  0, 1, 1, 2, 3, 5, 8, 13

  First 8 terms: 0, 1, 1, 2, 3, 5, 8, 13

  Example 3:

  Input:

  printFibonacciSeries(3)

  Output:

  0, 1, 1

  First 3 terms: 0, 1, 1

  Hint:

  Show Hint

  Write CodeOpens JavaScript compiler in a new tab

  Solution:

  Show Solution

• 3. Write a program to check whether a number is prime or not

  Category: Number Theory

  Easy

  Create a function that determines if a given number is prime. A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself.

  Examples:

  Example 1:

  Input:

  isPrime(7)

  Output:

  true

  7 is prime because it has no divisors other than 1 and 7

  Example 2:

  Input:

  isPrime(24)

  Output:

  false

  24 is not prime because it has divisors: 2, 3, 4, 6, 8, 12

  Example 3:

  Input:

  isPrime(1)

  Output:

  false

  1 is not considered prime by definition

  Hint:

  Show Hint

  Write CodeOpens JavaScript compiler in a new tab

  Solution:

  Show Solution

• 4. Write a program to swap two numbers without using a third variable

  Category: Variable Manipulation

  Easy

  Create a function that swaps the values of two variables without using a temporary variable. This is a common programming puzzle that tests your understanding of arithmetic operations.

  Examples:

  Example 1:

  Input:

  swapNumbers(3, 6)

  Output:

  [6, 3]

  3 and 6 are swapped to become 6 and 3

  Example 2:

  Input:

  swapNumbers(10, 20)

  Output:

  [20, 10]

  10 and 20 are swapped to become 20 and 10

  Example 3:

  Input:

  swapNumbers(0, 5)

  Output:

  [5, 0]

  0 and 5 are swapped to become 5 and 0

  Hint:

  Show Hint

  Write CodeOpens JavaScript compiler in a new tab

  Solution:

  Show Solution

• 5. Write a program to find the factorial of a number

  Category: Mathematical Functions

  Easy

  Create a function that calculates the factorial of a given number. The factorial of a number n (denoted as n!) is the product of all positive integers less than or equal to n.

  Examples:

  Example 1:

  Input:

  factorial(5)

  Output:

  120

  5! = 5 × 4 × 3 × 2 × 1 = 120

  Example 2:

  Input:

  factorial(3)

  Output:

  6

  3! = 3 × 2 × 1 = 6

  Example 3:

  Input:

  factorial(0)

  Output:

  1

  0! is defined as 1 by convention

  Hint:

  Show Hint

  Write CodeOpens JavaScript compiler in a new tab

  Solution:

  Show Solution