nikhil-2002 / programming_hactoberfest23 Goto Github PK

Hi @Nikhil-2002 , I would like to add the pattern programs in this and want to be a part of your repository. Kindly please assign this issue under the hacktoberfest label.

I would like to add a code to check Palindrome strings in Java.

Please assign me this issue @Nikhil-2002 .
HACTOBERFEST2023

I would like to add a code to find maximum number from an array of numbers in Java.

Please assign me this issue @Nikhil-2002
HACTOBERFEST2023

Add Contributing Guidelines

You are given a positive integer num consisting of exactly four digits. Split num into two new integers new1 and new2 by using the digits found in num. Leading zeros are allowed in new1 and new2, and all the digits found in num must be used.

For example, given num = 2932, you have the following digits: two 2's, one 9 and one 3. Some of the possible pairs [new1, new2] are [22, 93], [23, 92], [223, 9] and [2, 329].
Return the minimum possible sum of new1 and new2.

Example 1:

Input: num = 2932
Output: 52
Explanation: Some possible pairs [new1, new2] are [29, 23], [223, 9], etc.
The minimum sum can be obtained by the pair [29, 23]: 29 + 23 = 52.
Example 2:

Input: num = 4009
Output: 13
Explanation: Some possible pairs [new1, new2] are [0, 49], [490, 0], etc.
The minimum sum can be obtained by the pair [4, 9]: 4 + 9 = 13.

Constraints:

1000 <= num <= 9999

You have to take input of an array of integers, but you will not be provided the number of input(n) you can put. But directly the input array. This issue can be faced in many coding contests and candidates can panic about how to take input. So, the solution to this problem can help many people.

You are given an integer n. There is an undirected graph with n vertices, numbered from 0 to n - 1. You are given a 2D integer array of edges where edges[i] = [ai, bi] denotes that there exists an undirected edge connecting vertices ai and bi.

Return the number of complete connected components of the graph.

A connected component is a subgraph of a graph in which there exists a path between any two vertices, and no vertex of the subgraph shares an edge with a vertex outside of the subgraph.

A connected component is said to be complete if there exists an edge between every pair of its vertices.

A number is an Armstrong number if the sum of its own digits raised to the power number of digits gives the number itself.
For example,371 is a three digit Armstrong number => 371 = 3^3 + 7^3 + 1^3
For example, 1634 is a four digit Armstrong number => 1634 = 1^4 + 6^4 + 3^4 + 4^4

Kadane's algorithm is a dynamic programming approach used to solve the maximum subarray problem, which involves finding the contiguous subarray with the maximum sum in an array of numbers.

Please assign this issue to me under Hacktoberfest.

Given the array of integers nums, you will choose two different indices i and j of that array.
Return the maximum value of (nums[i]-1)*(nums[j]-1).

Here I want to add a real-life application of computational algorithm like binary search ,which is commonly used for searching for a target element in a sorted array.

The repo does not contain the implementation of novel data structures like Trie and Disjoint Set Union, which are used to solve problems related to prefix strings, connectivity and many more in an optimized way.

I would like to get assigned for this issue.

As I opened my PR regarding one of the issues on this repo, it showed on the Hacktoberfest Official website that the PR won't be included in the Hacktoberfest.

Screenshot 1 :

Screenshot 2 :