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.

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

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

Star This Repo ⭐⭐⭐
Please make sure to star this repository before contributing.
YOUR CONTRIBUTIONS TOWARDS OPEN SOURCE DSA ARE VALUABLE⭐
HAPPY CODING!!

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

Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -
Input Format

Input two integers a and b
Constraints

Use of "+" and "-" operators are not allowed
Output Format

Print the sum of a and b
Sample Input

2
-1

Sample Output

1

Explanation

Sum of 2 and -1 is 1

add in array folder.
Rotate an array to the right by 3 position.
n<=10

Add code in DailyCode repo of Python.

add in maths folder

Given an array A of n integers , find number of triplets (i,j,k) where i<j<k such that there is atleast one prime digit which is common to each number.
Input Format

The first line contains N integers followed by the number of elements
Constraints

N<=10^5
Ai<=10^18.
Output Format

Output the number of triplets
Sample Input

5
21
22
23
24
25

Sample Output

10

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

Add in sorting_searching folder of pytrhon.

Add in sorting folder of python

Beginner Friendly issues.

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.

I would like to take and work on this issue. Please assign it to me. I'll raise a pull request for it after that.

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 the code in daily code with all operations.

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.

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.

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.

• you can create issue on codes if you find any mistakes in them.

Happy Coding!!!

Make a calculator for geometric figures like cube cuboid

RAISE ANY ISSUE OF YOUR CHOICE.
Members who will be willing to contribute can raise Pull Requests and they will be merged.
Happy Coding!

Star this repo
Add in string folder.
Beginner friendly issue.

Create a code for sorting in linear time.

ADD IN SEARCHING_SORTING FOLDER

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!!!

add in array folder

Add in maths folder

Add in DataStructures repo of Python

i will leave a code

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

You have to choose some of the N items. Your knapsack has a capacity of W which means that the sum of the weights of items taken must be at most W. Item i has a weight of Wi and a value of Vi. Find the maximum possible sum of the values of items that you can home.
The twist here being that the constraints for W is 1<=W<=1e9. 1<=Vi<=1e3.

Found this to be a very interesting variation of the popular knapsack problem and would love to contribute under hacktoberfest. Can this be assigned to me?

P.S : Code in Python.

Add in sorting folder of python repo.

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 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

I want to add FizzBuzz.py under Interview_questions.

Can you please add me as the Contributor to this issue.

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.

1. STAR THIS REPO before any PR.

2. 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.

3. It is difficult to assign the issue to a seprate person so pr's will be merged if the issues are solved in fcfs.

4. 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!

Mr X has a huge transport business, where his company provides trucks to transfer goods. Mr Y has a manufacturing facility where it has N number of loading areas. Mr Y orders N trucks from Mr X for transportation of each of its manufactured products. One day the trucks were misaligned corresponding to their loading areas. Mr Y wants to swap trucks one by one to place them at their true positions in such a way that there is a minimum number of swaps between trucks. Note that all trucks are already at the misplaced loading area, swap occurs between two trucks at a time and truck is numbered based on its loading area number that is both loading area and truck have the same number and loading area are denoted by 1 to N.

Input:
1 <= N <= 50
1st Line: integer N which denotes the number of loading areas
2nd Line: N space-separated integers denoting truck numbers parked on 1 to N loading area.

Output:
Number denoting a minimum number of swaps.

Sample input
10
1 3 2 4 9 6 7 5 8 10

Sample output
3

add in array folder.
Rotate an array to the left by 3 position.
n<=10

add in repo sorting_searching of python

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

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!!!!

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

Check whether two strings are anagram of each other
Add in strings folder