@ritikbanger I want to add a code for Union of two Arrays in CPP as Hacktoberfest2022 Contribution. Please assign me this issue.

Given an integer array data representing the data, return whether it is a valid UTF-8 encoding (i.e. it translates to a sequence of valid UTF-8 encoded characters).

A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules:

--> For a 1-byte character, the first bit is a 0, followed by its Unicode code.
--> For an n-bytes character, the first n bits are all one's, the n + 1 bit is 0, followed by n - 1 bytes with the most significant 2 bits being 10.

x denotes a bit in the binary form of a byte that may be either 0 or 1.

Note: The input is an array of integers. Only the least significant 8 bits of each integer is used to store the data. This means each integer represents only 1 byte of data.

Want to add code of stack implementation using Linked list in java and cpp. Pls assign this issue to me.

hi,
During interview, Interviewer asked me Vertical Order Traversal of a Binary Tree Question.
At that time, I little bit stuck and completed.
So, I requested you please add this solution which comes under Tree Topic

`Given the root of a binary tree, calculate the vertical order traversal of the binary tree.

For each node at position (row, col), its left and right children will be at positions (row + 1, col - 1) and (row + 1, col + 1) respectively. The root of the tree is at (0, 0).

The vertical order traversal of a binary tree is a list of top-to-bottom orderings for each column index starting from the leftmost column and ending on the rightmost column. There may be multiple nodes in the same row and same column. In such a case, sort these nodes by their values.

Return the vertical order traversal of the binary tree.`

this question should be in this list , please assign me this under Hacktoberfest. Thank you

I think this question should be in this list , please assign me this under Hacktoberfest. Thank you

I want to con

Presently the code for modulo multiplicative inverse is written in linear complexity on mod. But it can be calculated using extended eucledian algorithm in logarithmic complexity.

Please assign this task to me.

Hi, I can a solution to a famous problem HOLI from SPOJ. Can you assign this issue to me?

Hello @Ritik-Banger-Biz4group,
https://github.com/ritikbanger/Hacktoberfest2022-DSA/blob/main/Prime%20Number%20finder

This code is not optimised much, it's time complexity can be reduced from O(N/2) to O((√N)/2) which will be way more faster and also easy to read and understand like this one.
May u please assign me to optimise it.

I will run a loop from i=3 to sqrt(N) and doing I+=2 every time and check n%2 also at the end, resulting in lesser iterations and saving time.

Triangle Pyramid in C++

I want to add this problem under the graphs section.
This problem has a beautiful use of the Binary lifting concept on graphs.
CSES problem set has very less good solutions present on the web.

Can you please assign this issue to me @ritikbanger under hacktober fest 2022.

Morris Traversal on Binary Tree
Details:

Morris Traversal on Binary Trees. Allows tree traversals like inorder, preorder and postorder to run in constant space.
Time Complexity: O(N)
Space Complexity: O(1)

I think this question should be in the array list. Please assign me this under Hacktoberfest.
I have already sent a PR related to it, please merge it.
Thank you
@ritikbanger

I would like to add kadane's algorithm problem in JAVA

I would like to add Modular Exponentiation algortihm as a contribution for the Hacktober Fest 2022, as it is a very useful algo.
Could you assign it to me

I want to contribute to this issue. Please assign it to me @ritikbanger

This question should in the given list. Please assign me this issue

Can you please assign this issue to me with hacktober-accepted label. I am willing to solve the issue and contribute to the repository.

Want to add Sieve of Eratosthenes approach for finding prime numbers between 2 numbers in C++, pls assign me this issue

code for Josephus problem

I will be happy to work on this problem. Please assign this to me.

I'd like to add Tower of Hanoi mathematical puzzle problem, the code is written in C

Please assign this issue to me.

Triangle Pyramid in C++

I have some Questions description with my solution which are asked in leetcode contest

I want to add the gray code problem and solution(c++) in bit manipulation. Please assign it to me under hacktoberfest 2022. @ritikbanger

    Please move this file to leetcode folder.

Originally posted by @ritikbanger in #14 (review)

Sir completed your requested changes.
Please merge my request.

I want to submit a cpp code for the above problem

This is a recent leetcode weekly contest hard problem.
Usually, LIS is solved using DP ( O(n^2) Solution ).
In this problem, we could only take elements with differences not more than K and we have to find the longest increasing subsequence.
Constraints are such that we can not use O(n^2) DP approach and we can not as well use binary search optimization of LIS.
So, the Solution is based on Range Max Queries using segment Trees.
Time Complexity of solution: O(nlog(maximum element in the array))*
This solution is accepted on leetcode.

Can you please assign it to me @ritikbanger under hacktober fest tag.

would be great if you could assign me to add this issue was asked the same question in the microsoft intern interview..

i have written a program to organize the junk file using python.
allow me to contribute.