akshitagit / java Goto Github PK
View Code? Open in Web Editor NEWRepository for Java codes and algos.Star the repo too.
Home Page: https://github.com/akshitagupta15june
License: MIT License
Repository for Java codes and algos.Star the repo too.
Home Page: https://github.com/akshitagupta15june
License: MIT License
add in array folder.
Rotate an array to the right by 3 position.
n<=10
Add the algorithms if you find they are not already added in the repositories and create a pull request.
Example :
In sorting/searching repo many algos are not added so add them and raise the pull request.
Happy Coding!!!
Professor wanted to teach his students few new concepts regarding programming. He came up with an idea to define his own new function : SUM(P, Q) which implies, operation sum applied P times: the first time to Q, and each subsequent time to the result of the previous operation.
For example: if P = 2 and Q = 3, SUM(2,3) equals to sum(sum(3)) = sum(1+2+3) = sum(6) = 1+2+3+4+5+6 = 21
INPUT:
The first line contains a single integer T, the number of test cases. Each test case is described by a single line containing two integers P and Q.
OUTPUT:
For each test case, output one integer on a separate line.
constrains:
1 ≤ T ≤ 25
1 ≤ D, N ≤ 25
Sample input:
2
2 4
1 5
Sample Output:
55
15
Explanation:
First test case: SUM(2, 4) = sum(sum(4)) = sum(10) = 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 10 = 55.
Second test case: SUM(1, 5) = sum(5) = 1 + 2 + 3 + 4 + 5 = 15.
Add in RecursionBacktracking repo of java
PULL REQUESTS WILL BE MERGED
Thankyou so much everyone for contributing in the repository.
As i am the only one to manage the repo so after some simple checks I will surely merge your pull request.
Happy Coding! and contributing to open source.
These contributions are really valuable.
You are given a string of brackets i.e. '{', '}' , '(' , ')', '[' , ']' . You have to check whether the sequence of parenthesis is balanced or not.
For example, "(())", "(())()" are balanced and "())(", "(()))" are not.
Input Format
A string of '(' , ')' , '{' , '}' and '[' , ']' .
Constraints
1<=|S|<=10^5
Output Format
Print "Yes" if the brackets are balanced and "No" if not balanced.
Sample Input
(())
Sample Output
Yes
THE PEOPLE WHO HAVE FACED ANY INTERVIEWS AND THEY KNOW THE QUESTIONS WHICH WERE ASKED AND IF THEY ARE COMFORTABLE IN SHARING THEN THEY CAN RAISE THE ISSUE WITH THE QUESTIONS AND SOME DESCRIPTIONS TOO , SO THAT OTHER CAN SOLVE THEM AND LEARN.
ALL THE CODES WILL BE ADDED IN INTERVIEW QUESTION FOLDER!
HAPPY CODING TO EVERYONE!!!
We all know Hacktoberfest will be starting from 1st October 2020.
Hacktoberfest is a celebration open to everyone in our global community.
Pull requests can be made in any GitHub-hosted repositories/projects.
Four valid pull requests (PRs) between October 1-31 (in any time zone) are required in this open source celebration.
If a maintainer reports your pull request as spam or behavior not in line with the project’s code of conduct, you will be ineligible to participate.
You can sign up anytime between October 1 and October 31- here https://hacktoberfest.digitalocean.com/
PR'S will be increased from 1st October onwards so I request everyone to solve issues , raise your issues but please maintain the code of conduct.
STAR THIS REPO before any PR.
Only those PR's will be merged if there is no conflict with the master branch, the code which is not available already in the repo and if the code is added to suitable folder.
It is difficult to assign the issue to a seprate person so pr's will be merged if the issues are solved in fcfs.
I will be adding some more issues(beginner friendly as well as moderate) but it will be great if you all look at repo's and find out what different codes can be added because DSA is very vast.
At last Enjoy this month of open source celebration.
All the best!
Happy Coding!
An issue request to submit problems related to BitManipulation.
Take as input S, a string. Write a function that does basic string compression. Print the value returned. E.g. for input “aaabbccds” print out a3b2c2d1s1.
Input Format
A single String S
Constraints
1 < = length of String < = 1000
Output Format
The compressed String.
Sample Input
aaabbccds
Sample Output
a3b2c2d1s1
Explanation
In the given sample test case 'a' is repeated 3 times consecutively, 'b' is repeated twice, 'c' is repeated twice and 'd and 's' occurred only once.
add in maths folder
solve the issue using java.
provide
codes/algos
Check whether two strings are anagram of each other
add in string folder
Add in maths folder
AKSHITA has created an elevated roof. She wants to know how much water can she save during rain.
Given n non negative integers representing the elevation map where width of every bar is 1, Find the maximum water that she can save.
Explanation for the Sample input Testcase:
Elevation Map
Input Format
First line contains an integer n. Second line contains n space separated integers representing the elevation map.
Constraints
1 <= N <= 10^6
Output Format
Print a single integer containing the maximum unit of waters she can save.
Sample Input
10
0 2 1 3 0 1 2 1 2 1
Sample Output
5
You are given an array of integers A.
You need to tell whether you can choose three numbers such that a+b>=c.
Input Format
First line consists of number of integers N. next line consists of N space separated integers.
Constraints
1 <= N <= 10^5
Output Format
YES or NO
Sample Input
5
1 2 3 4 9
Sample Output
YES
Explanation
you can choose 1+3 >= 4
Solve the question and raise the Pull Requests.
add in array folder.
Rotate an array to the left by 3 position.
n<=10
Problem Statement
Given an integer, find the number of divisors for it.
(Eg.) Given N = 10, output would be 4 since 10 has four divisors 1, 2, 5, 10.
add in dailycode repo of java.
add in array folder
I would like to contribute to your project .
Take N (number of rows), print the following pattern (for N = 4).
1
2 3 2
3 4 5 4 3
4 5 6 7 6 5 4
Input Format
Constraints
0 < N < 10
solve the issue using java.
provide
codes/algos
I want to work on this problem for hacktoberfest 2020. Will you label this issue with it?
Pull requests were not counted towards the completion of Hacktoberfest challenge.
I Want to Add Sudoku Solver in Java. Please Assign Me.
Star This Repo ⭐⭐⭐
Please make sure to star this repository before contributing.
YOUR CONTRIBUTIONS TOWARDS OPEN SOURCE DSA ARE VALUABLE⭐
HAPPY CODING!!
@akshitagupta15june
I want to work on this problem for hacktoberfest 2020?
Will you label this with hacktoberfest 2020?
Given N positive numbers, your task is to calculate their HCF.
Input Format
First line of input contains a single integer N, second line contains N space separated positive integers whose HCF is to be computed.
Constraints
N <= 10 and all the numbers lie between 1 and 100.
Output Format
Print HCF of N numbers.
Sample Input
3
2 4 6
Sample Output
2
Hi there,
Thank you for your interest in Hacktoberfest and in helping others make their first contributions to open source.
While we agree that it's important to help others, this repository does not do this in a way that is in line with the Hacktoberfest values. Please read the part that talks about high-quality contributions to understand why we are reaching out and taking action. Due to this, we've added this repository to the list of excluded repositories which means pull requests here will not count toward Hacktoberfest 2020.
This is not a DigitalOcean decision, it's one that is inspired by the community of maintainers and contributors who all agree that quality is more important than quantity when it comes to engagement in the Open Source community. The values remind us to shift the focus from contributions to repositories that encourage folks to quickly create and gain a pull request to contributions that will help people level-up their skills and contribute to open-source projects that are in need of help.
If you feel that this repository is an effective learning resource, we encourage you to keep running it since a core part of the aim for Hacktoberfest is to encourage new folks to get involved with open-source.
However, if you are interested in having contributions to this repo count toward Hacktoberfest we encourage you to take a look at this list of Hacktoberfest issues for inspiration and make the necessary changes to focus on enabling people to make meaningful contributions to open source projects.
If you have any questions about this or participating in Hacktoberfest, please contact our team via email [email protected] or join our community Discord server.
Happy Hacking,
The Hacktoberfest Team
Hacktoberfest is presented by DigitalOcean, Intel and DEV.
Create a code for sorting in linear time.
Take as input S, a string. Write a function that removes all consecutive duplicates. Print the value returned.
Input Format
String
Constraints
A string of length between 1 to 1000
Output Format
String
Sample Input
aabccba
Sample Output
abcba
Explanation
For the given example, "aabccba", Consecutive Occurrence of a is 2, b is 1, and c is 2.
After removing all of the consecutive occurences, the Final ans will be : - "abcba".
Take N (number in decimal format). Write a function that converts it to octal format. Print the value returned.
Input Format
Constraints
0 < N <= 1000000000
Output Format
Sample Input
63
Sample Output
77
Take N (number of rows), print the following pattern (for N = 5).
* * * * *
* * * *
* *
* * * *
* * * * *
Input Format
Constraints
0 < N < 10 (where N is an odd number)
add in linkedlist folder
**
STAR THIS REPO!
Given an n x m matrix, where every row and column is sorted in increasing order, and a number x . Find if element x is present in the matrix or not.
Input Format
First line consists of two space separated integers N and M, denoting the number of element in a row and column respectively. Second line of each test case consists of N*M space separated integers denoting the elements in the matrix in row major order. Third line of each test case contains a single integer x, the element to be searched.
Constraints
1 <= N,M <= 30 0 <= A[i] <= 100000
Output Format
Print 1 if the element is present in the matrix, else 0.
Sample Input
3 3
3 30 38
44 52 54
57 60 69
62
Sample Output
0
please assign me i am work on this. !
add in array folder
Take N as input. For a value of N=5, we wish to draw the following pattern :
5 4 3 2 1 0 1 2 3 4 5
4 3 2 1 0 1 2 3 4
3 2 1 0 1 2 3
2 1 0 1 2
1 0 1
0
1 0 1
2 1 0 1 2
3 2 1 0 1 2 3
4 3 2 1 0 1 2 3 4
5 4 3 2 1 0 1 2 3 4 5
Input Format
Take N as input.
Constraints
N <= 20
Output Format
Pattern should be printed with a space between every two values.
Sample Input
5
Given an integer N, print Pascal Triangle upto N rows.
Input Format
Single integer N.
Constraints
N <= 10
Output Format
Print pascal triangle.
Sample Input
4
Sample Output
1
1 1
1 2 1
1 3 3 1
add in linkedlist folder
I want to add Remove Duplicates from Sorted Array problem from leet code and updated version
ADD IN SORT FOLDER
PROCESS OF CONTRIBUTION IN THIS REPOSITORY
FORK THIS REPOSITORY
ADD YOUR CODE IN RESPECTIVE FOLDER
CREATE A PULL REQUEST
AFTER A SIMPLE CHECK I WILL MERGE THE PR
HAPPY CODING AND CONTRIBUTING!!!!
Find the length of the longest subsequence in a given array A of integers such that all elements of the subsequence are sorted in strictly ascending order.
Input Format
The first line contains a single integer n.
Next line contains n space separated numbers denoting the elements of the array.
Constraints
0 < n< 105
0 < Ai < 105
Output Format
Print a single line containing a single integer denoting the length of the longest increasing subsequence.
Sample Input
6
50 3 10 7 40 80
Sample Output
4
Explanation
The longest subsequence in test case is - 3,7,40,80
A declarative, efficient, and flexible JavaScript library for building user interfaces.
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google ❤️ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.