Update Subarray-sum-equals-k.md (CodingWallah#6)

* Update Subarray-sum-equals-k.md * Solution of missing number * Adding Solution of Rotate Array * Solution of Find All Duplicates in an Array * Solution of Reverse an Array * Updated hyper link of my profile * Removing profile and adding contrited by --------- Co-authored-by: rath23 <muneer@amityonline.com> Co-authored-by: Coding Wallah <121433611+CodingWallah@users.noreply.github.com>

Author: 3 people

ArraysSolutions/Find All Duplicates in an Array.md

@@ -0,0 +1,45 @@
+## Solution of Find All Duplicates in an Array
+
+#### Time Complexity - O (n)
+
+#### Space Complexity - O(1)
+
+```java
+
+class Solution {
+
+public List<Integer> findDuplicates(int[] nums) {
+
+List <Integer> list = new ArrayList <Integer>();
+
+int start=0;
+
+int ref;
+
+Arrays.sort(nums);
+
+for (int i = 0 ; i < nums.length-1 ; i++){
+
+ref = nums[i] ^ nums[i+1];
+
+if(ref == 0 ){
+
+list.add(start,nums[i]);
+
+start++;
+
+}
+
+}
+
+return list;
+
+}
+
+}
+
+```
+
+<div align="right"> 
+ Contributed By <a href="https://github.com/rath23"> Muneer Ahmad</a>
+</div>

ArraysSolutions/Missing Number.md

@@ -0,0 +1,21 @@
+
+## Solution of Missing-Number
+#### Time Complexity - O (n)
+#### Space Complexity - O(1)
+
+```java 
+class Solution {
+ public int missingNumber(int[] nums) {
+ int num = nums.length;
+ int sunOfNaturalNumbers = num*(num+1)/2;
+ int sumOfArrayNum = 0;
+ for(int i = 0; i<num ; i++){
+ sumOfArrayNum += nums[i];
+ }
+ return sunOfNaturalNumbers-sumOfArrayNum;
+ }
+}
+```
+<div align="right"> 
+ Contributed By <a href="https://github.com/rath23"> Muneer Ahmad</a>
+</div>

ArraysSolutions/Reverse an Array.md

@@ -0,0 +1,22 @@
+## Solution of Reverse an Array
+#### Time Complexity - O (n)
+#### Space Complexity - O(1)
+
+```java 
+class Solution {
+ public void reverseString(char[] s) {
+ int start = 0;
+ int end = s.length-1; 
+ while ( start < end){
+ char temp = s[start];
+ s[start] = s[end];
+ s[end]= temp;
+ start++;
+ end--;
+ }
+ }
+}
+```
+<div align="right"> 
+ Contributed By <a href="https://github.com/rath23"> Muneer Ahmad</a>
+</div>

ArraysSolutions/Rotate-Array.md

@@ -0,0 +1,28 @@
+## Solution of Rotate-Array
+#### Time Complexity - O (n)
+#### Space Complexity - O(1)
+
+```java 
+class Solution {
+ public static void reverse(int [] a , int start , int end ){
+ while (start <end){
+ int temp = a[start];
+ a[start]=a[end];
+ a[end] = temp;
+ start++;
+ end--;
+ }
+ } 
+ 
+ public void rotate(int[] nums, int k) {
+ int n = nums.length;
+ k = k%n;
+ reverse(nums,(n-k),(n-1));
+ reverse(nums,0,(n-k-1));
+ reverse(nums,0,(n-1));
+ }
+}
+```
+<div align="right"> 
+ Contributed By <a href="https://github.com/rath23"> Muneer Ahmad</a>
+</div>

ArraysSolutions/Subarray-sum-equals-k.md

@@ -1,7 +1,3 @@
- [ Profile ](https://github.com/rath23)
- ========
-
-### Solution Subarray sum equals to k
 #### Time Complexity - O (n^2)
 #### Space Complexity - O(1)
 
@@ -22,3 +18,6 @@ class Solution {
  }
 }
 ```
+<div align="right"> 
+ Contributed By <a href="https://github.com/rath23"> Muneer Ahmad</a>
+</div>

ArraysSolutions/Wave Array Solution.md

@@ -1,7 +1,4 @@
- [ Profile ](https://github.com/rath23)
- ========
-
-### Solution of Wave Array
+## Solution of Wave Array
 #### Time Complexity - O (n)
 #### Space Complexity - O(1)
 
@@ -19,3 +16,6 @@ class Solution {
  }
 }
 ```
+<div align="right"> 
+ Contributed By <a href="https://github.com/rath23"> Muneer Ahmad</a>
+</div>