Enter your question -

Write a program to sort half of the array in ascending and second half in descending or vice versa depending on users choice.
AD - Ascending then descending
DA - Descending then ascending

Sample test case -
Input -
Enter sorting style: AD
Enter number of elements in the array: 5
Numbers: 1 4 2 4 2

Output -
Semi-sorted: 1 2 4 4 2

Explaination -
Array -> 1 4 2 4 2
Part-one -> 1 4 2 -> (Sorting part-one in ascending order since user enter AD) -> 1 2 4
Part-two -> 4 2 -> (Sorting part-two in descending order since user enter AD) -> 4 2
Therefore, output -> 1 2 4 4 2

Enter link to the question(if question belongs to any online platform) -

No Link

Tags for the question(eg - Array, Basic, Stack, etc.) -

Array, sorting

Enter your question -

Delete a Node in Linked List
Write a function to delete a node in a singly-linked list. You will not be given access to the head of the list, instead you will be given access to the node to be deleted directly.

Enter link to the question(if question belongs to any online platform) -

https://leetcode.com/problems/delete-node-in-a-linked-list/

Tags for the question(eg - Array, Basic, Stack, etc.) -

linked list

@SarthakKeshari Please assign this to me under hacktoberfest tag!

Enter your question -

Find the roots of the quadratic Equation

Enter link to the question(if question belongs to any online platform) -

NO link

Tags for the question(eg - Array, Basic, Stack, etc.) -

Maths, Datatypes

Enter your question -

Write a program to input a number and check whether it is a Keprekar Number or not.

Enter link to the question(if question belongs to any online platform) -

No Link

Tags for the question(eg - Array, Basic, Stack, etc.) -

Mathematical operations and if else statement

Enter your question -

Given three number 'a' , 'b' and 'm' calculate a^b under modulo 'm'

Tags for the question(eg - Array, Basic, Stack, etc.) -

Number Theory

Enter your question -

Given a 2D matrix, print all elements of the given matrix in diagonal order.
For example, consider the following 5 X 4 input matrix.
Example:

1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
17 18 19 20

Diagonal printing of the above matrix is

1
5 2
9 6 3
13 10 7 4
17 14 11 8
18 15 12
19 16
20

Enter link to the question(if question belongs to any online platform) -

https://www.geeksforgeeks.org/zigzag-or-diagonal-traversal-of-matrix/

Tags for the question(eg - Array, Basic, Stack, etc.) -

Array, 2D Array

Discussed in #56

Enter your question -

Check if number is odd or Even using Bit Manipulation

Tags for the question(eg - Array, Basic, Stack, etc.) -

Bit Manipulation

Enter your question -

Counting number of lines, words, characters and paragraphs in a text file using Java

Enter link to the question(if question belongs to any online platform) -

https://www.geeksforgeeks.org/counting-number-lines-words-characters-paragraphs-text-file-using-java/

Tags for the question(eg - Array, Basic, Stack, etc.) -

Array, Basic, Stack

Enter your question -

Write a program that read an array of integers and an integer k and outputs the length of maximum length of sub array with sum equals to k. If there is no sub array length > 1 and the element k is present in the array then the output = 1.

Enter link to the question(if question belongs to any online platform) -

N/A

Tags for the question(eg - Array, Basic, Stack, etc.) -

Array, Basic

Example:

As a part of Hacktoberfest, @SarthakKeshari please assign this issue to me

Enter your question -

Given a string str, we need to find maximum occurring character in the string.

Enter link to the question(if question belongs to any online platform) -

N/A

Tags for the question(eg - Array, Basic, Stack, etc.) -

Strings

Example:

As a part of Hacktoberfest, @SarthakKeshari please assign this issue to me

Enter Issue id being referred to - #12

Your answer

Approach/Algorithm/Pseudo Code for the selected question - I will use if else to solve the issue

Your answer

Tags for the solution(eg - Array, Basic, Stack, etc.) - Basic, if else

Your answer

Enter your question -

You are given an sorted array, you have to search for element in the array by applying binary search.

Enter link to the question(if question belongs to any online platform) -

https://www.geeksforgeeks.org/find-position-element-sorted-array-infinite-numbers/

Tags for the question(eg - Array, Basic, Stack, etc.) -

Array ,JAVA

Enter your question -

Write a program to swap two numbers (with the help of third variable).

Enter link to the question(if question belongs to any online platform) -

No Link

Tags for the question(eg - Array, Basic, Stack, etc.) -

Basic

Enter your question -

Given an array, rotate the array to the right by k steps, where k is non-negative.

Enter link to the question(if question belongs to any online platform) -

https://leetcode.com/problems/rotate-array/

Tags for the question(eg - Array, Basic, Stack, etc.) -

ARRAY, JAVA

please assign me this issue for hacktoberfest @SarthakKeshari sir #

Enter your question -

Find Minimum and Maximum of an array using recursion.

Tags for the question(eg - Array, Basic, Stack, etc.) -

Recursion, Array
Eg :

Please assign me this issue, as a part of Hacktoberfest.

Enter your question -

Write a java program to reverse the string without using the inbuilt function.

Enter link to the question(if question belongs to any online platform) -

No link

Tags for the question(eg - Array, Basic, Stack, etc.) -

String, Basic, Looping

Enter Issue id being referred to - #9

Your answer

Approach/Algorithm/Pseudo Code for the selected question -

i will use if else

Tags for the solution(eg - Array, Basic, Stack, etc.) -

Basic if else

@SarthakKeshari , Please assign this issue to me
I will do this in just 2 hours, I will feel very motivated if u give this issue to me

Enter your question -

Write a program to swap two numbers (WITHOUT the help of third variable).

Enter link to the question(if question belongs to any online platform) -

No Link

Tags for the question(eg - Array, Basic, Stack, etc.) -

Basic

Enter your question -

Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive. There is only one repeated number in nums, return this repeated number.

Enter link to the question(if question belongs to any online platform) -

https://leetcode.com/problems/find-the-duplicate-number/

Tags for the question(eg - Array, Basic, Stack, etc.) -

Array,cyclic sort

@SarthakKeshari Pls assign me this issue under hacktoberfest.

Enter your question -

Write a program to find factorial of a number entered by the user. (Using recursion)

Enter link to the question(if question belongs to any online platform) -

No link

Tags for the question(eg - Array, Basic, Stack, etc.) -

recursion, if

Enter your question -

Check number greater than 100 or not

Enter link to the question(if question belongs to any online platform) -

No link

Tags for the question(eg - Array, Basic, Stack, etc.) -

Basic, if else

Enter your question -

Find the Factorial of a number using recursion.

Enter link to the question(if question belongs to any online platform) -

No link

Tags for the question(eg - Array, Basic, Stack, etc.) -

Basic

Enter your question -

Write a program to input a number a check whether it is an Emirp Number or not.

Enter link to the question(if question belongs to any online platform) -

No link

Tags for the question(eg - Array, Basic, Stack, etc.) -

Looping statements and if else statements

@SarthakKeshari
Kindly assign me the issue,
as a part of Hacktoberfest.

Enter your question -

Write a program to check a number for palindrome prime.

Palindrome - A palindromic number is a number (such as 16461) that remains the same when its digits are reversed.
Prime - a whole number greater than 1 that cannot be exactly divided by any whole number other than itself and 1

Enter link to the question(if question belongs to any online platform) -

No link

Tags for the question(eg - Array, Basic, Stack, etc.) -

Loops. Number Theory

Enter your question -

Performing Linear search of any number entered by user in an Array

Enter link to the question(if question belongs to any online platform) -

No link

Tags for the question(eg - Array, Basic, Stack, etc.) -

Array

Enter your question -

Given a string str, we need to check whether the given string is palindrome or not
A Palindrome string is a such string that reversing it gives the same string.

Enter link to the question(if question belongs to any online platform) -

Not Any

Tags for the question(eg - Array, Basic, Stack, etc.) -

String

Enter your question -

Take 10 numbers as input from the user and sort it

Enter link to the question(if question belongs to any online platform) -

NO link

Tags for the question(eg - Array, Basic, Stack, etc.) -

sorting, array

Question belongs to which section/subsection(eg - Arrays/1D Arrays) -

Arrays/1D Arrays

Enter your question -

Chef and Divyam are playing a game with the following rules:

First, an integer X! is written on a board.
Chef and Divyam alternate turns; Chef plays first.
In each move, the current player should choose a positive integer D which is divisible by up to Y distinct primes and does not exceed the integer currently written on the board. Note that 1 is not a prime.
D is then subtracted from the integer on the board, i.e. if the integer written on the board before this move was A, it is erased and replaced by A−D.
When one player writes 0 on the board, the game ends and this player wins.
Given X and Y, determine the winner of the game.

Enter link to the question(if question belongs to any online platform) -

https://www.codechef.com/problems/PRIGAME

Tags for the question(eg - Array, Basic, Stack, etc.) -

functions

Question belongs to which section/subsection(eg - Arrays/1D Arrays) -

CodeChef

Enter your question -

Write a program to check if a number is Special or not

Explaination -
A number is said to be special if the sum of the factorial of its digits is equal to the original number.(Make program modular by creating user-defined functions. eg- factorial(), sum())

Enter link to the question(if question belongs to any online platform) -

No link

Tags for the question(eg - Array, Basic, Stack, etc.) -

Number theory, functions, maths

Enter your question -

Chef wants to cross a hallway of N doors. These N doors are represented as a string. Each door is initially either open or close, represented by 1 or 0 respectively. Chef is required to go through all the doors one by one in the order that they appear, starting from the leftmost door and moving only rightwards at each step.

To make the journey easier, Chef has a magic wand, using which Chef can flip the status of all the doors at once. Determine the minimum number of times Chef has to use this wand to cross the hallway of doors.

For example, the doors are 10011. Chef will start from the left and enter the first door. After passing through that door, the magic wand is waved. This flips the string to 01100. Now Chef passes through the next two doors in one go. Again, just before reaching the 4th door, the magic wand is waved. Now that the string is in its original state, Chef passes through the last two doors as well. The minimum number of times the magic wand needed to be used here was 2.
Input Format
First line will contain T, number of testcases. Then the testcases follow.
Each testcase contains of a single string S, representing the doors as given in the problem.
Output Format
For each test case, print a single line containing one integer denoting the minimum number of times the magic wand needs to be used.

Enter link to the question(if question belongs to any online platform) -

https://www.codechef.com/START13C/problems/MAGDOORS

Tags for the question(eg - Array, Basic, Stack, etc.) -

Basic Math

Enter your question -

Write a program to find factorial of a number entered by the user. (Using loop)

Enter link to the question(if question belongs to any online platform) -

No link

Tags for the question(eg - Array, Basic, Stack, etc.) -

Basic, loops

Enter your question -

Implement pow(x, n), which calculates x raised to the power n (i.e., xn).

Enter link to the question(if question belongs to any online platform) -

https://leetcode.com/problems/powx-n/

Tags for the question(eg - Array, Basic, Stack, etc.) -

Recursion, Medium

Pull request - #44

Enter your question -

If array is given from 1 to n where n is length of the array, sort it in O(n) time complexity.

Enter link to the question(if question belongs to any online platform) -

No link

Tags for the question(eg - Array, Basic, Stack, etc.) -

1D array

Enter your question -

Write a program that displays the primes number between the given ranges
Input constraint
Stating , ending number >=1 and Stating , ending number < Integer.MAX_VALUE
output constraint
Display all the numbers between that range

Sample Input
1,10
Sample Output
2,3,5,7

Enter link to the question(if question belongs to any online platform) -

no link

Tags for the question(eg - Array, Basic, Stack, etc.) -

basic mathematics

Enter your question -

Print Binary of a number using Bit Manipulation taking input from user.

Tags for the question(eg - Array, Basic, Stack, etc.) -

Bit Manipulation, Math

Enter your question -

There are N players with IDs from 1 to N, who are participating in the Javelin throw competition which has two rounds. The first is the qualification round, followed by the final round. The qualification round has gotten over, and you are given the longest distance that each of the N players has thrown as A1,A2,…,AN. Now, the selection process for the final round happens in the following two steps:

1. If the longest throw of a player in the qualification round is greater than or equal to the qualification mark of M cm, they qualify for the final round.

2. If after step 1, less than X players have qualified for the finals, the remaining spots are filled by players who have thrown the maximum distance among the players who have not qualified yet.

You are given the best throws of the N players in the qualification round A1,A2,…,AN and the integers M and X. Print the list of the players who will qualify for the finals in increasing order of their IDs.

Enter link to the question(if question belongs to any online platform) -

https://www.codechef.com/START8C/problems/JAVELIN

Tags for the question(eg - Array, Basic, Stack, etc.) -

Arrays, HashMaps

As a part of Hacktoberfest, @SarthakKeshari please assign this issue to me

Enter Issue id being referred to -

#7

Approach/Algorithm/Pseudo Code for the selected question -

i will use if for this question

Tags for the solution(eg - Array, Basic, Stack, etc.) -

Basic

Enter your question -

Reorder List
You are given the head of a singly linked-list. The list can be represented as:

L0 → L1 → … → Ln - 1 → Ln
Reorder the list to be on the following form:

L0 → Ln → L1 → Ln - 1 → L2 → Ln - 2 → …
You may not modify the values in the list's nodes. Only nodes themselves may be changed

Enter link to the question(if question belongs to any online platform) -

https://leetcode.com/problems/reorder-list/

Tags for the question(eg - Array, Basic, Stack, etc.) -

Recursion ,linked list

Enter your question -

There are N people in the vaccination queue, Chef is standing on the Pth position from the front of the queue. It takes X minutes to vaccinate a child and Y minutes to vaccinate an elderly person. Assume Chef is an elderly person.

You are given a binary array A1,A2,…,AN of length N, where Ai=1 denotes there is an elderly person standing on the ith position of the queue, Ai=0 denotes there is a child standing on the ith position of the queue. You are also given the three integers P,X,Y. Find the number of minutes after which Chef's vaccination will be completed.

Enter link to the question(if question belongs to any online platform) -

https://www.codechef.com/START13C/problems/VACCINQ

Tags for the question(eg - Array, Basic, Stack, etc.) -

Array , Basic, Java

Enter your question - Write a program to enter a number and check whether it is positive or negative

Your answer

Enter link to the question(if question belongs to any online platform) - No link

Your answer

Tags for the question(eg - Array, Basic, Stack, etc.) - Basic, if else

Your answer

Enter your question -

write a program to check if number is greater than or less than 10

Enter link to the question(if question belongs to any online platform) -

no link

Tags for the question(eg - Array, Basic, Stack, etc.) -

Basic , if

Write a program that reads an array of ints and outputs the length of the longest sequence in strictly ascending order. Elements of the sequence must go one after another. A single number is assumed to be an ordered sequence with the length = 1.

Enter link to the question(if question belongs to any online platform) -

N/A

Tags for the question(eg - Array, Basic, Stack, etc.) -

Array, Basic

Example :

As a part of Hacktoberfest, @SarthakKeshari please assign this issue to me

Discussed in #29

Enter your question -

You are in charge of the cake for a child's birthday. You have decided the cake will have one candle for each year of their total age. They will only be able to blow out the tallest of the candles. Count how many candles are tallest.

Enter link to the question(if question belongs to any online platform) -

https://www.hackerrank.com/challenges/birthday-cake-candles/problem

Tags for the question(eg - Array, Basic, Stack, etc.) -

Basic, array

Question belongs to which section/subsection(eg - Arrays/1D Arrays) -

Hackerrank

Enter your question -

Display the Fibonacci series to the limit
provided by the user as input by recursion

Enter link to the question(if question belongs to any online platform) -

No link

Tags for the question(eg - Array, Basic, Stack, etc.) -

Recursion

Discussed in #24

Kindly go through contribution guidelines for better and accurate pull requests

Enter your question - write a program to check if the number is multiple of two

Enter link to the question(if question belongs to any online platform) -

No link

Tags for the question(eg - Array, Basic, Stack, etc.) -

Basic If else

Write a Java program to identify the kth smallest element in the binary search tree.

Since the tree is Binary search tree, so we need to go to the leftmost node and start counting to right if count is equal to k print node

Enter link to the question(if question belongs to any online platform) -

N/A

Tags for the question(eg - Array, Basic, Stack, etc.) -

trees, LinkedList , Binary Tree

for example :

As a part of Hacktoberfest, @SarthakKeshari please assign this issue to me