prog-harsh/hacktoberfest2022

This is for Hacktoberfest 2022

hacktoberfest2022's Issues

121. Best Time to Buy and Sell Stock

You are given an array prices where prices[i] is the price of a given stock on the ith day.

You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.

Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.

Example 1:

Input: prices = [7,1,5,3,6,4]
Output: 5
Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5.
Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell.

I want to contribute the hackerrank problem set of C++.Please accept it and give hacktoberfest label.

I want to add Euclidean Algorithm to find the greatest common divisor of two numbers. Please assign me this

add license

Merge Sort

Write a program of merge sort in any language.

Hiii, I want to add a codechef problem reverse the number in your cpp file.Please accept this and give the proper label of hacktober fest

Number guessing game using JavaScript

Build a number guessing game. There would be limited amount of chance for guessing the number. Try to make front-end also using HTML and CSS.
Make a separate folder named as "Number Guess"

283. Move Zeroes

Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.

Note that you must do this in-place without making a copy of the array.

Example 1:

Input: nums = [0,1,0,3,12]
Output: [1,3,12,0,0]

Container With Most Water [LeetCode]

Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.

Notice that you may not slant the container.

Example:

Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

Check if a subarray with 0 sum exists or not

Given an integer array, check if it contains a subarray having zero-sum.

For example:

Input: { 3, 4, -7, 3, 1, 3, 1, -4, -2, -2 }

Output: Subarray with zero-sum exists

The subarrays with a sum of 0 are:

{ 3, 4, -7 }
{ 4, -7, 3 }
{ -7, 3, 1, 3 }
{ 3, 1, -4 }
{ 3, 1, 3, 1, -4, -2, -2 }
{ 3, 4, -7, 3, 1, 3, 1, -4, -2, -2 }

Roman to Integer

Platform : LeetCode
Problem : 13. Roman to Integer ( https://leetcode.com/problems/roman-to-integer/ )

Problem Description:-
Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.

Symbol Value
I 1
V 5
X 10
L 50
C 100
D 500
M 1000
For example, 2 is written as II in Roman numeral, just two one's added together. 12 is written as XII, which is simply X + II. The number 27 is written as XXVII, which is XX + V + II.

Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:

I can be placed before V (5) and X (10) to make 4 and 9.
X can be placed before L (50) and C (100) to make 40 and 90.
C can be placed before D (500) and M (1000) to make 400 and 900.
Given a roman numeral, convert it to an integer.

Example 1:

Input: s = "III"
Output: 3

Binary Search

Write a program to implement Binary Search.

Quick Sort

Write a program to implement quick sort.

Add Two Numbers

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example :

Input: l1 = [2,4,3], l2 = [5,6,4]
Output: [7,0,8]
Explanation: 342 + 465 = 807.

Designing Priority Queue Using Custom Comparator In C++

Hey @prog-harsh

Want to design priority queue using custom comparator and add to your repo.
Please help to assign me the same.

Thanks.

Code for Print All Paths in a Graph in Java

Given a graph, a source vertex and a destination vertex. Find and print all paths between source and destination.

Please assign this issue to me @prog-harsh

Want to add code how to find prime no. in a range .Please assign this to me and give me the proper label of Hacktoberfest

Hang man game using python

I would like to add hang man game using python under HacktoberFest 2022. Can you please assign it to me. @prog-harsh

Find Pivot Index

Given an array of integers nums, calculate the pivot index of this array.

The pivot index is the index where the sum of all the numbers strictly to the left of the index is equal to the sum of all the numbers strictly to the index's right.

If the index is on the left edge of the array, then the left sum is 0 because there are no elements to the left. This also applies to the right edge of the array.

Return the leftmost pivot index. If no such index exists, return -1.

Example:

Input: nums = [1,7,3,6,5,6]
Output: 3
Explanation:
The pivot index is 3.
Left sum = nums[0] + nums[1] + nums[2] = 1 + 7 + 3 = 11
Right sum = nums[4] + nums[5] = 5 + 6 = 11

Added Selection Sort using JAVA

1480. Running Sum of 1d Array [LeetCode]

Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]).

Return the running sum of nums.

Example 1:

Input: nums = [1,2,3,4]
Output: [1,3,6,10]
Explanation: Running sum is obtained as follows: [1, 1+2, 1+2+3, 1+2+3+4].

Adding problems

I would like to solve problems in this platform

I want to work on this issue @kirantodupunoori @atrievel @DavidMaged171 @alifsiregar @RgnDunes

I am currently preparing for my intern preparations and it would help me a lot , please do the needful and assign me this repo to do

ADDED code for checking that no entered by user is an armstrong or not

using c++ made a program to check no enter by user is armstrong or not

Find the Highest Altitude

There is a biker going on a road trip. The road trip consists of n + 1 points at different altitudes. The biker starts his trip on point 0 with altitude equal 0.

You are given an integer array gain of length n where gain[i] is the net gain in altitude between points i​​​​​​ and i + 1 for all (0 <= i < n). Return the highest altitude of a point.

Example:

Input: gain = [-5,1,5,0,-7]
Output: 1
Explanation: The altitudes are [0,-5,-4,1,1,-6]. The highest is 1.

I want to add a code to count set bits in a number. Please assign this to me and give the proper label of Hacktoberfest 2021.

Hiii, I want to request pull request in c for sorting algorithm. Please assign this issue to me and give proper label of hacktoberfest.

Updating README File

Can I update something in README file ?

Majority Element

Given an array nums of size n, return the majority element.

The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.

Example 1:

Input: nums = [3,2,3]
Output: 3

Add a code_of_conduct.md

assign me this issue and I will fix this this thing in your repo😊.

Flappy Bird In Python

Please Assign Me This Issue It Will Help Me Alot In My Hacktoberfest PR

Print all subarrays with 0 sum

Given an integer array, print all subarrays with zero-sum.

For example,

Input: { 4, 2, -3, -1, 0, 4 }

Subarrays with zero-sum are

{ -3, -1, 0, 4 }
{ 0 }

Input: { 3, 4, -7, 3, 1, 3, 1, -4, -2, -2 }

Subarrays with zero-sum are

{ 3, 4, -7 }
{ 4, -7, 3 }
{ -7, 3, 1, 3 }
{ 3, 1, -4 }
{ 3, 1, 3, 1, -4, -2, -2 }
{ 3, 4, -7, 3, 1, 3, 1, -4, -2, -2 }

Add a contributing.md

add a contributing file which will help new members to contribute😊

509. Fibonacci Number

The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is,

F(0) = 0, F(1) = 1
F(n) = F(n - 1) + F(n - 2), for n > 1.
Given n, calculate F(n).

Example 1:

Input: n = 2
Output: 1
Explanation: F(2) = F(1) + F(0) = 1 + 0 = 1.

Queue data structure has to be there in C folder

Queue data structure is need

Merge sort in python with less complexity is there

Sir ,i want to work on this issue @prog-harsh . Please assign this to me