Will add a gradient background with squares spawning periodically, quite similar to the ones used in PlayStation main menu.

I would like to add a typing text animation using HTML CSS and javascript.
Thank you

Hlo @rjkalash
Sir I want to contribute in this repository by making an advice generator made using the Advise API in ReactJs.
Pls assign me this issue.

I want to contribute in cpu Scheduling algorithms in c language.
Please assign it to me.

I want to add source code of this problem statement taken from leetcode.

Here is the link of it:- https://leetcode.com/problems/largest-number-at-least-twice-of-others/

This is my pull request ID #481

If you find it useful and purely plagiarism free. Then please merge it on your code base repository.

I want to create a well managed stone, paper scissor game using c++. Please Assign this issue to me.
Thankyou.

You are given four integers a, b, c and d. Determine if there's a rectangle such that the lengths of its sides are a, b, c and d (in any order).
First line contain number of test cases
Sample Input 1
3
1 1 2 2
3 2 2 3
1 2 2 2
Sample Output 1
YES
YES
NO

I want to add solution of this question in C++ Section please assign to me

I would like to contribute the clean and proper code for Longest Increasing Subsequence Problem in C++
Given an integer array nums, return the length of the longest strictly increasing subsequence.

A subsequence is a sequence that can be derived from an array by deleting some or no elements without changing the order of the remaining elements. For example, [3,6,2,7] is a subsequence of the array [0,3,1,6,2,2,7].
Input: nums = [10,9,2,5,3,7,101,18]
Output: 4
Explanation: The longest increasing subsequence is [2,3,7,101], therefore the length is 4.

Things I will take care of:-

• Proper commented code
• Explanation for every step and logic
• Samples test cases explained

Please assign this to me. Thanks

Hi @rjkalash
I want to work on this issue. Please assign me the task.
Problem Link: https://codeforces.com/problemset/problem/1579/E1

1828. Queries on Number of Points Inside a Circle

You are given an array points where points[i] = [xi, yi] is the coordinates of the ith point on a 2D plane. Multiple points can have the same coordinates.

You are also given an array queries where queries[j] = [xj, yj, rj] describes a circle centered at (xj, yj) with a radius of rj.

For each query queries[j], compute the number of points inside the jth circle. Points on the border of the circle are considered inside.

Return an array answer, where answer[j] is the answer to the jth query.

Given an m x n binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area.
Input: matrix = [["1","0","1","0","0"],
["1","0","1","1","1"],
["1","1","1","1","1"],
["1","0","0","1","0"]]
Output: 4

Input: matrix = [["0","1"],
["1","0"]]
Output: 1

Please Assign this issue to me for adding Maximal Square Dynamic Programming Problem Code in C++.

Points I will take care of:-

• Proper indentation
• Clean and Comment Code
• Time Complexity explanation
• Explained Sample Example

I would like to add the C++ code for The Tower of Hanoi problem.
Contributed under hacktoberfest 2021.

I would like to contribute my HTML CSS design of a Tv show website as an example and my contribution to Hacktoberfest.
If you would like to add it to your repository, please assign me this issue and label it as Hacktoberfest.

hey, @rjkalash, I would like to contribute a text to speech program.
Please assign it to me.

There are n stairs, a person standing at the bottom wants to reach the top. The person can climb either 1 stair or 2 stairs at a time. Count the number of ways, the person can reach the top.

Examples:

Input: n = 1
Output: 1
There is only one way to climb 1 stair

Input: n = 2
Output: 2
There are two ways: (1, 1) and (2)

Input: n = 4
Output: 5
(1, 1, 1, 1), (1, 1, 2), (2, 1, 1), (1, 2, 1), (2, 2)

Consider the example shown below in the diagram. The value of n is 3. There are 3 ways to reach the top.

I WANT TO ADD THIS PROBLEM TO DP SECTION

PLEASE ASSIGN THIS PROBLEM TO ME
THANK YOU

I am from Hacktoberfest2021 please assign me this.

CodeChef Problem from Starters 07

Refer the official page problem here

I will implement:

1. Detailed problem statement
2. Input and output format
3. Test case with explanations
4. and lastly the solution code.

I want to work on this.

I would like to contribute the clean and proper code for Longest Common Subsequence Problem in C++
Given two strings, return the length of the longest common subsequence.
Please Assign this to me .

Adding a CPP file to its respective folder for Binary Exponentiation Algorithm

when i pulled your repo some files were not committed initially.

This is a beginner-friendly practice repository!! The merged PR is not counted towards Hacktoberfest 2021. This repo. is excluded from hacktoberfest2021 @rjkalash

Sumbit your android projects here.

Problem Statement-
Given two integer arrays nums1 and nums2, return the maximum length of a subarray that appears in both arrays.

Example 1:
Input: nums1 = [1,2,3,2,1], nums2 = [3,2,1,4,7]
Output: 3
Explanation: The repeated subarray with maximum length is [3,2,1].

Please assign it to me.

I have already created a PR for question K closest point to the origin (under leetcode question). If you assign me to leetcode questions then everyday I will upload min 2 of medium level.

Please assign this issue to me

Here sumbit your codes,🥳

I want to implement https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/ this Dynamic Programming question in C++, under Hacktoberfest. Please assign me this issue @rjkalash.

Your Project is Excluded. Help me out of this. My two PR in your repo are excluded.

Using this code, anyone (literally, technical background not necessary) can get the design parameters of a cylindrical pressure vessel after giving some input parameters like desirable storage capacity, factor of safety.

It'd be great if this was assigned to me under the hacktoberfest tag.

Hello, @rjkalash. I would like to contribute a number guessing game.
Please assign it to me.

Submit the html code for illustration of Link.

You are given an array A1,A2,…,AN consisting of N integers. Your goal is to make the GCD of all the elements in the array an odd integer. To achieve this goal, you can do the following operation any number of times:

Choose an index i(1≤i≤N) such that Ai>1 and set Ai=⌊Ai2 ⌋
You can choose an index multiple times during the operations. Find the minimum number of operations after which GCD of all the elements in the array becomes an odd integer.

Note: ⌊x⌋ : Returns the largest integer that is less than or equal to x (i.e rounds down to the nearest integer). For example, ⌊1.5⌋=1,⌊2⌋=2, ⌊72 ⌋ =⌊3.5⌋ =3.

Input Format
The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
The first line of each test case contains a single integer N.
The second line contains N space-separated integers A1,A2,…,AN.
Output Format
For each test case, print a single line containing one integer - the minimum number of operations after which GCD of all the elements in the array becomes an odd integer.

problem link
https://www.codechef.com/START14C/problems/BININVER

The classic flappy bird game with increasing difficulty level, score counter, high score, and an interesting end.

can u help me and teach me how to add repository through command lines

Hi @rjkalash ,
I want to contribute in this repository by making a cryptocurrency price tracker made using ReactJs.
Please assign me this issue.

This is a web app which recognizes voice of the user and save it to notes section and later user can hear this saved notes.