sachindrck / hactoberfest_contribution_2022 Goto Github PK

The factorial of a number is the product of all the integers from 1 to that number.

For example, the factorial of 6 is 1x2x3x4x5x6 = 720. Factorial is not defined for negative numbers, and the factorial of zero is one, 0! = 1.

We are given a stack data structure with push and pop operations, the task is to implement a queue using instances of stack data structure and operations on them.

The standard form of a quadratic equation is:

ax2 + bx + c = 0, where
a, b and c are real numbers and
a ≠ 0

The solutions to this quadratic equation are given by:

(-b ± (b ** 2 - 4 * a * c) ** 0.5) / (2 * a)

Transpose of a matrix is the process of swapping the rows to columns. For the 2x3 matrix,

Matrix
a11 a12 a13
a21 a22 a23

Transposed Matrix
a11 a21
a12 a22
a13 a23

Here we will be making a simple calculator in which we can perform basic arithmetic operations like addition, subtraction, multiplication, or division.

The highest common factor (H.C.F) or greatest common divisor (G.C.D) of two numbers is the largest positive integer that perfectly divides the two given numbers. For example, the H.C.F of 12 and 14 is 2.

Given a Queue data structure that supports standard operations like enqueue() and dequeue(). The task is to implement a Stack data structure using only instances of Queue and Queue operations allowed on the instances.

@Sachindrck can you please assign it to me?

A recursion folder may be added to C++ section that will contain all the programs that are solved using recursion.

Tic-tac-toe, noughts, and crosses, or Xs and Os is a paper-and-pencil game for two players who take turns marking the spaces in a three-by-three grid with X or O. The player who succeeds in placing three of their marks in a horizontal, vertical, or diagonal row is the winner.

I want to contribute 0-1 knapsack problem in C++ . Please assign it to me @Sachindrck

A positive integer which is only divisible by 1 and itself is known as prime number.

For example: 13 is a prime number because it is only divisible by 1 and 13 but, 15 is not prime number because it is divisible by 1, 3, 5 and 15.

Note: 0 and 1 are not prime numbers.

In this program, you'll learn to find the largest element in an array using a for loop in Java.

To learn Standard Deviation - https://www.mathsisfun.com/data/standard-deviation.html

In the program below, we take a temperature in degree Celsius and convert it into degree Fahrenheit. They are related by the formula:

fahrenheit = celsius * 1.8 + 32

Tower of Hanoi is a mathematical puzzle where we have three rods (A, B, and C) and N disks. Initially, all the disks are stacked in decreasing value of diameter i.e., the smallest disk is placed on the top and they are on rod A. The objective of the puzzle is to move the entire stack to another rod (here considered C), obeying the following simple rules:

Only one disk can be moved at a time.
Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack.
No disk may be placed on top of a smaller disk.

A number is even if it is perfectly divisible by 2. When the number is divided by 2, we use the remainder operator % to compute the remainder. If the remainder is not zero, the number is odd.

I want to add merge sort algorithm in c++. Please assign it to me @Sachindrck

This is a simple to demonstrate rock, paper, scissors game. In this game, players have to choose one of the three options to beat the opponent.

A positive integer is called an Armstrong number of order n if

abcd... = a^n + b^n + c^n + d^n + ...
In the case of an Armstrong number of 3 digits, the sum of cubes of each digit is equal to the number itself. For example:

153 = 111 + 555 + 333 // 153 is an Armstrong number.

Please assign this issue to me.

Given a string, write a program to count the occurrence of Lowercase characters, Uppercase characters, Special characters, and Numeric values.

Given a string, find the minimum and the maximum length words in it.

Examples:

Input: "This is a test string"
Output: Minimum length word: a
Maximum length word: string

->Technical issue
->I want to add a project in c++ using friend function (OOP) for converting decimal number to binary number . Here you can enter any decimal number and can get a binary number of the respective decimal number. I will a provide cpp file with the code and output of the code in it.
->I have intermediate level skills in c++ (OOP).
->It will take me one day to finish and upload this project.

Two strings are said to be anagrams if we can form one string by arranging the characters of another string. For example, Race and Care. Here, we can form Race by arranging the characters of Care.

In this program, you'll learn to make a simple calculator using switch..case in Java. This calculator would be able to add, subtract, multiply and divide two numbers.