programming_hactoberfest23's Issues
Find Largest element in an array
Find Smallest Element in an Array
Finding Repeating elements in an Array
Finding the Longest Palindrome in an Array
maximum-product-of-two-elements-in-an-array
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).
Rotate an array
Reverse an Array
Counting the number of even and odd elements in an array
Calculate the sum of elements in an array
Sort the elements of an array
Palindrome Checker
I would like to add a code to check Palindrome strings in Java.
Please assign me this issue @Nikhil-2002 .
HACTOBERFEST2023
I would like add binary search algorithm
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.
Pattern Programs
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.
Finding Arrays are disjoint or not
Implement novel Data Structures like Trie and Disjoint Set Union(DSU) in C++
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.
Add a README.md file
Maximum Number in array
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 Kadane's Algorithm in C++
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.
Check if a number is an Armstrong Number
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
Take input in String form and convert to array format for operation
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.
Removing Duplicate elements from an array
Add CONTRIBUTING.md file
Add Contributing Guidelines
count-the-number-of-complete-components
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.
Exclude from Hacktoberfest23
minimum-sum-of-four-digit-number-after-splitting-digits
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
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. ๐๐๐
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google โค๏ธ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.