sr-sunny-raj / hacktoberfest2021-dsa Goto Github PK

I have a codechef problem that I would like to contribute.

This is a program of Binary Search. Can I contribute a solution to this problem?

➕ Adding code sample with proper explanation in detail for better understanding of the problem statement.

▶️ Workflow of the code and the approach used.
▶️ With proper indentation and clean code.
▶️ Added comments, as comments enhance the readability of the program.

I would like to contribute to this issue under hacktoberfest2021.
Pls add suitable hacktoberfest labels.
.
.
Pls assign this issue to me.
Thankyou!!

@SR-Sunny-Raj is there anything we can do about it? This was a wonderful project, I was thinking of contributing more to it

A complex number can be represented as a string on the form "real+imaginaryi" where:

real is the real part and is an integer in the range [-100, 100].
imaginary is the imaginary part and is an integer in the range [-100, 100].
i2 == -1.
Given two complex numbers num1 and num2 as strings, return a string of the complex number that represents their multiplications.

remote: Permission to SR-Sunny-Raj/Hacktoberfest2021-DSA.git denied
fatal: unable to access 'https://github.com/SR-Sunny-Raj/Hacktoberfest2021-DSA.git/': The requested URL returned error: 403

Should I push the added code in master ? As I've made a separate branch "cses" for the added code.
Please look into this matter

I just created a PR in this project but on the hacktoberfest dashboard it is showing project excluded.

Is your feature request related to a problem? Please describe.
Detect Cycle in Linked List and return start of Cycle if present otherwise return NULL without using extra space.

Language = C++

Please assign this to me
Thank You

I would like to add the following question
Link: https://practice.geeksforgeeks.org/problems/count-total-set-bits-1587115620/1

Is your feature request related to a problem? Please describe.
Problem Link:- https://practice.geeksforgeeks.org/problems/friends-pairing-problem5425/1#

Describe the solution you'd like
I have used top-down dynamic programming approach to solve the question

Describe alternatives you've considered
It can also be solved using bottom up approach , recursion

Additional context
NA

Story: You have to find a path through which the rat move from the starting position (0,0) to the final position where cheese is (n,n). List the total no of possible paths which the rat can take to reach the cheese.

Input
A file whose first line contains the size of the square maze The next n lines contain n binary values separated by space. 0 denotes an open cell while 1 denotes a blocked cell. You have to find paths which contain only cells which are open, and finally print the total no of such unique paths. Retracing the 1 or more cells back and forth is not considered a new path. The set of all cells covered in a single path should be unique from other paths

Output
The output should be the total no of paths possible on the first line

Question link:- https://www.codechef.com/problems/BPHC03

like if we have a array like
arr={2,7,4,8}
we need to find the nearest smaller no for each element in a array.
output:
{-1,2,2,4}

Is your feature request related to a problem? Please describe.
Graph section of the course is missing djistras algorithm for finding shortest path in undirected graph

Describe the solution you'd like
It is among the most essential graph algorithms

@SR-Sunny-Raj I would like to be assigned for this issue. Thankyou

Given an array of integers where each element represents the max number of steps that can be made forward from that element. Write a function to return the minimum number of jumps to reach the end of the array (starting from the first element). If an element is 0, they cannot move through that element. If the end isn’t reachable, return -1.

Examples:

Input: arr[] = {1, 3, 5, 8, 9, 2, 6, 7, 6, 8, 9}
Output: 3 (1-> 3 -> 8 -> 9)
Explanation: Jump from 1st element
to 2nd element as there is only 1 step,
now there are three options 5, 8 or 9.
If 8 or 9 is chosen then the end node 9
can be reached. So 3 jumps are made.

Input: arr[] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}
Output: 10
Explanation: In every step a jump
is needed so the count of jumps is 10.
The first element is 1, so can only go to 3. The second element is 3, so can make at most 3 steps eg to 5 or 8 or 9.

I WILL ADD THIS PROBLEM IN DP SECTION

PLEASE ASSIGN THIS PROBLEM TO ME
THANK YOU

I would like to add a C++ code that optimally merges 2 BSTs in LogN Space and Linear time.

I want to contribute to this problem using the Binary search technique.

I want to add codechef airline restrictions problem
link:
https://www.codechef.com/SEPT21C/problems/AIRLINE

The program checks whether two strings are anagram of each other.
Example: s1="aadk" ,s2="daka"
Output: Yes
Time complexity will be O(n)

Is your feature request related to a problem? Please describe.
This problem is to decode a given encoded string. Eg, for s = "3[a]2[bc]", output- "aaabcbc".
Problem Link: https://leetcode.com/problems/decode-string/

Describe the solution you'd like
I would use Stack Data Structure to implement this.

Describe alternatives you've considered
It can also be implemented using DFS.

Additional context
NA

A python program to find shortest path in weighted graph using Dijkstra Algorithm.

I would like to add union of two arrays.cpp solution of Leetcode problem statement.
Please assign me this task.

#602 is my pull request ID.

Please assign me this issue

On the hacktoberfest's website, the project is shown as excluded project.
Please look into the matter....

I want to add solution of this problem present on leetcode in C++.
Problem Link - https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/
Please assign me this.

Given two strings s and t , return the minimum window substring of s such that every character in t (including duplicates) is included in the window.

Example: s="adobecodebanc"
t="abc"
Output: "banc"
The minimum length of the the substring of s that includes all the characters of t is "banc"

I want to add solutions of Maximum Width of a binary tree and vertical order traversal of a binary tree

https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree
https://leetcode.com/problems/maximum-width-of-binary-tree/

Do assign it to me...

In this question we will be given points and we need to find the closest point from origin.
Input:-
points = [[3,3],[5,-1],[-2,4]], k = 2

Output:-
[[3,3],[-2,4]]

Problem Statement:-

Given a Linked List of size N, where every node represents a sub-linked-list and contains two pointers:
(i) a next pointer to the next node,
(ii) a bottom pointer to a linked list where this node is head.
Each of the sub-linked-list is in sorted order.
Flatten the Link List such that all the nodes appear in a single level while maintaining the sorted order. 
**Note**: The flattened list will be printed using the bottom pointer instead of the next pointer.

Possible Solution:-

The idea is to use the Merge() process of merge sort for linked lists. We use merge() to merge lists one by one. We recursively merge() the current list with the already flattened list. The down pointer is used to link nodes of the flattened list.

I want to contribute to the problem.

This is a program of Binary Search. Can I contribute a solution to this problem?

How Can I upload a new question alongside C++ code. Should I have to write the question separately in a readme file or I can comment it out in the code itself ?

Through this algorithm, prime numbers upto a given target can be found in O(nlog(log(n)))
Example: n=16
Output: 2 3 5 7 11 13

Hi, Please assign me this issue.

I want to add solution of Path Sum II problem present on leetcode in C++.
Problem Link - https://leetcode.com/problems/path-sum-ii/
Please assign me this.

Given a binary tree, the algorithm will print the values in level order fashion.

Theodore implements a new strategy game “Defense of a Kingdom”. On each level a player defends the Kingdom that is represented by a rectangular grid of cells. The player builds crossbow towers in some cells of the grid. The tower defends all the cells in the same row and the same column. No two towers share a row or a column.

The penalty of the position is the number of cells in the largest undefended rectangle. Help Theodore write a program that calculates the penalty of the given position.

Example
Input:
1
15 8 3
3 8
11 2
8 6

Output:
12

I want to contribute to the problem.

I want to add solution of this problem present on Leetcode in C++.
Problem Link - https://leetcode.com/problems/delete-node-in-a-bst/
Please assign me this.

I want to add a solution for the Maximum Path Sum Question of Leetcode, under the folder Tree

Here is the link to the question - https://leetcode.com/problems/binary-tree-maximum-path-sum/submissions/

Please @SR-Sunny-Raj Sir Assign this task to me

I want to add solution of this question present on gfg in c++.
Pls assign me this.

This comes under String questions. It is a question from pepcoding. I wanted to code it in java.
Basically, we toggle the case of every letter of a string
Example:
input:
pepCODinG
output:
PEPcodINg

Is your feature request related to a problem? Please describe.
I want to add insertion and search using trie in trie section

please assign this problem to me.
Thank you

i want to add new linked list. kindly give me the permission to push.

I would like to add this as a part of hacktoberfest2021.
Link: https://practice.geeksforgeeks.org/problems/finding-middle-element-in-a-linked-list/1

A python program to find sum and product of n terns of GP series.

I want to contribute to this problem using a stack technique.