Two Sum

Problem Link : https://leetcode.com/problems/two-sum/

Statement

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

You can return the answer in any order.

Example 1:

Input: nums = [2,7,11,15], 
target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].

Example 2:

Input: nums = [3,2,4], 
target = 6
Output: [1,2]

Example 3:

Input: nums = [3,3], 
target = 6
Output: [0,1]

Constraints:

2 <= nums.length <= 
-109 <= nums[i] <= 109
-109 <= target <= 109
Only one valid answer exists.

Follow-up: Can you come up with an algorithm that is less than O(n2) time complexity?

RULES :

• Star this repository.
• Fork this repository
• No need to wait for getting assigned, you can go ahead attempt the issues and raise a PR.
• We will review any comments or PRs at 5 PM & 10 PM on 1st Oct, will give feedback if needed.

How to name your file?

1. Go to folder : "/LeetCode/TwoSum/"
2. Take today's date, i.e. 1stOct
3. Take your GitHUB username id like "hrithik339", "hacker-boy", etc or anything which you have.
4. File extension = say ".py" .

• Combine all 3 to get your file name : Date + "_" + Username + File Extension, ex. "1stOct_hrithik339.py". Create this file in above mentioned folder only,

This will ensure no file will be conflict and any number of contributors can work on the same issue.
If you have any query ask in comments below, kindly follow this pattern strictly.

Reverse Bits

Problem link : https://leetcode.com/problems/reverse-bits/

Statement

Reverse bits of a given 32 bits unsigned integer.

Note:

• Note that in some languages, such as Java, there is no unsigned integer type. In this case, both input and output will be given as a signed integer type. They should not affect your implementation, as the integer's internal binary representation is the same, whether it is signed or unsigned.
• In Java, the compiler represents the signed integers using 2's complement notation. Therefore, in Example 2 above, the input represents the signed integer -3 and the output represents the signed integer -1073741825.

Example 1:

Input: n = 00000010100101000001111010011100
Output:    964176192 (00111001011110000010100101000000)

Explanation: The input binary string 00000010100101000001111010011100 represents the unsigned integer 43261596, so return 964176192 which its binary representation is 00111001011110000010100101000000.

Example 2:

Input: n = 11111111111111111111111111111101
Output:   3221225471 (10111111111111111111111111111111)

Explanation: The input binary string 11111111111111111111111111111101 represents the unsigned integer 4294967293, so return 3221225471 which its binary representation is 10111111111111111111111111111111.

Constraints:

The input must be a binary string of length 32

Follow up: If this function is called many times, how would you optimize it?

RULES :

• Star this repository.
• Fork this repository
• No need to wait for getting assigned, you can go ahead attempt the issues and raise a PR.
• We will review any comments or PRs at 5 PM & 10 PM on 1st Oct, will give feedback if needed.

How to name your file?

1. Go to folder : "/LeetCode/TwoSum/"
2. Take today's date, i.e. 1stOct
3. Take your GitHUB username id like "hrithik339", "hacker-boy", etc or anything which you have.
4. File extension = say ".py" .

• Combine all 3 to get your file name : Date + "_" + Username + File Extension, ex. "1stOct_hrithik339.py". Create this file in above mentioned folder only,

This will ensure no file will be conflict and any number of contributors can work on the same issue.
If you have any query ask in comments below, kindly follow this pattern strictly.

Magic Permutations

Problem Code: MAGPER

Problem link : https://www.codechef.com/problems/MAGPER

Statement

Saeed bought two magic permutations of integers 1
through N

and gave them to his grandsons Rami and Ghoda to encourage them to train in problem solving.

Rami found out that he can only cyclically shift his permutation, i.e. choose any number of elements from the beginning and move them to the end without changing their order. On the other hand, Ghoda found out that he can only swap elements of his permutation.

The distance between two permutations P1,P2,…,PN
and R1,R2,…,RN is the sum of |i−j| over all pairs of valid indices i,j such that Pi=Rj

You should process Q

queries. In each query, one of Saeed's grandsons plays with his permutation (performs an operation described above), and afterwards, you should tell Saeed the distance between his grandsons' current permutations. Note that the queries are cumulative — the changes made in one query remain in subsequent queries.

Input

The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
The first line of each test case contains two space-separated integers N and Q.
The second line contains N space-separated integers A1,A2,…,AN denoting Rami's initial permutation.
The third line contains N space-separated integers B1,B2,…,BN denoting Ghoda's initial permutation.
Each of the next Q lines describes a query in one of the following formats:
1 z: Rami moves z
elements from the beginning of his permutation to the end.
2 x y: Ghoda swaps the x -th and y -th element of his permutation.

Output

For each query, print a single line containing one integer — the current distance between the permutations.

Constraints

1≤T≤100

2≤N,Q≤105

1≤x,y≤N

x≠y

1≤z≤N−1

1≤Ai,Bi≤N

for each valid i A and B are permutations the sum of N over all test cases does not exceed 105 the sum of Q over all test cases does not exceed 105

Sample Input 1

1
4 3
1 3 2 4
4 3 2 1
1 1
2 3 1
1 2

Sample Output 1

4
2
8

Explanation

Example case 1:

Rami's permutation is (1,3,2,4)→(3,2,4,1)→(3,2,4,1)→(4,1,3,2)

Ghoda's permutation is (4,3,2,1)→(4,3,2,1)→(2,3,4,1)→(2,3,4,1)

Rules

• Star this repository.
• Fork this repository
• No need to wait for getting assigned, you can go ahead attempt the issues and raise a PR.
• We will review any comments or PRs at 5 PM & 10 PM on 1st Oct, will give feedback if needed.

How to name your file?

1. Go to folder : "/CodeChef/Magic Permutation/"
2. Take today's date, i.e. 1stOct
3. Take your GitHUB username id like "hrithik339", "hacker-boy", etc or anything which you have.
4. File extension = say ".py" .

• Combine all 3 to get your file name : Date + "_" + Username + File Extension, ex. "1stOct_hrithik339.py". Create this file in above mentioned folder only,

This will ensure no file will be conflict and any number of contributors can work on the same issue.
If you have any query ask in comments below, kindly follow this pattern strictly.

Simple Array Sum

Problem link : https://www.hackerrank.com/challenges/simple-array-sum/problem

Statement

Given an array of integers, find the sum of its elements.

For example, if the array
arr = [1,2,3] so return 6

Function Description

Complete the simpleArraySum function in the editor below. It must return the sum of the array elements as an integer.
simpleArraySum has the following parameter(s):
ar: an array of integers

Input Format

The first line contains an integer n, denoting the size of the array.
The second line contains space-separated integers representing the array's elements.

Constraints

0 <= n,arr[i] <= 1000

Output Format

Print the sum of the array's elements as a single integer.

Sample Input

6
1 2 3 4 10 11

Sample Output

31

Explanation

We print the sum of the array's elements: 1+2+3+4+10+11 = 31

Rules

• Star this repository.
• Fork this repository
• No need to wait for getting assigned, you can go ahead attempt the issues and raise a PR.
• We will review any comments or PRs at 5 PM & 10 PM on 1st Oct, will give feedback if needed.

How to name your file?

1. Go to folder : "/HackerRank/Simple Array Sum/"
2. Take today's date, i.e. 1stOct
3. Take your GitHUB username id like "hrithik339", "hacker-boy", etc or anything which you have.
4. File extension = say ".py" .

• Combine all 3 to get your file name : Date + "_" + Username + File Extension, ex. "1stOct_hrithik339.py". Create this file in above mentioned folder only,

This will ensure no file will be conflict and any number of contributors can work on the same issue.
If you have any query ask in comments below, kindly follow this pattern strictly.

In this Repo, problems are very less, so it will be a good idea to consider, 'creating the problem' as a contribution.
let me know what are your thoughts regarding this.