Done the requested changes

Karnika06 · Karnika06 · commit 9b6d82ab7d24 · 2021-08-06T19:14:02.000+05:30
diff --git a/Codechef Problems/MaximumArrayXOR.java b/Codechef Problems/MaximumArrayXOR.java
@@ -5,7 +5,7 @@
  * Problem code: MAXARXOR
  * Problem link: https://www.codechef.com/START7C/problems/MAXARXOR
  * 
- * Approach:
+ * Solution:
  * 
  * Value of an array A  is defined as the sum of (A(i)⊕i) for all 0≤i<L, where ⊕ denotes bitwise xor operation.
  * You are given an integer N and an array A consisting of 2^N integers where A(i)=i for all 0≤i<2^N.

Original file line number	Diff line number	Diff line change
`@@ -5,7 +5,7 @@`
`5`	`5`	`* Problem code: MAXARXOR`
`6`	`6`	`* Problem link: https://www.codechef.com/START7C/problems/MAXARXOR`
`7`	`7`	`*`
`8`		`- * Approach:`
	`8`	`+ * Solution:`
`9`	`9`	`*`
`10`	`10`	`* Value of an array A is defined as the sum of (A(i)⊕i) for all 0≤i<L, where ⊕ denotes bitwise xor operation.`
`11`	`11`	`* You are given an integer N and an array A consisting of 2^N integers where A(i)=i for all 0≤i<2^N.`