## Perform Division of two numbers without using division operator (/)

Write an program to perform division of two numbers without using division operator (‘/’).

## Magnet Puzzle

We are given set of bipolar magnets each domino-shaped. The objective is to place magnets on a M X N board which should meet a set of conditions where both N and M are not odd.

## Generate 0 and 1 with 75% and 25% Probability

Write an algorithm to generate 0 and 1 with 75% and 25% probability respectively using a specified function which produces either 0 or 1 each with 50% probability.

## Print all numbers between 1 to N without using semicolon

Write a program to print all numbers between 1 to N without using semicolon.

## Swap two numbers without using third variable | 5 methods

Given two integers, swap them without using any third variable.

## Determine the if condition to print specific output

What should be the if condition in below code snippet, so that output would be “Hello World”.

## Find maximum, minimum of three numbers without using conditional statements

Given three integers, find maximum and minimum number between them without using conditional statements or ternary operator.

## Find numbers represented as sum of two cubes for two different pairs

Given a large number N, find all positive numbers less than N that can be represented as sum of two cubes for at-least two different pairs.

## Print “Hello World” with empty main function | 3 methods

Write a program to print “Hello World” with empty main function i.e. without writing anything inside main() function.

## Tower of Hanoi Problem

The Tower of Hanoi is a mathematical puzzle consisting of three rods and n disks of different sizes which can slide onto any rod.

## Print all numbers between 1 to N without using any loop | 4 methods

Write a program to print all numbers between 1 to N without using loop.

## Print a semicolon without using semicolon anywhere in the program

Write a program to print a semicolon without using semicolon anywhere in the program.