darecoder
diff --git a/‎.idea/workspace.xml
Lines changed: 14 additions & 14 deletions b/‎.idea/workspace.xml
Lines changed: 14 additions & 14 deletions
diff --git a/‎out/production/Crux/com/company/Lecture10/Dictionary.class
0 Bytes b/‎out/production/Crux/com/company/Lecture10/Dictionary.class
0 Bytes
diff --git a/‎out/production/Crux/com/company/Lecture11/SumDivideArray.class
1 Byte b/‎out/production/Crux/com/company/Lecture11/SumDivideArray.class
1 Byte
diff --git a/‎src/com/company/Lecture10/Dictionary.java
Lines changed: 1 addition & 1 deletion b/‎src/com/company/Lecture10/Dictionary.java
Lines changed: 1 addition & 1 deletion
diff --git a/‎src/com/company/Lecture11/SumDivideArray.java
Lines changed: 3 additions & 5 deletions b/‎src/com/company/Lecture11/SumDivideArray.java
Lines changed: 3 additions & 5 deletions
diff --git a/‎src/com/company/Lecture7/Bitwise_Examples.java
Lines changed: 4 additions & 3 deletions b/‎src/com/company/Lecture7/Bitwise_Examples.java
Lines changed: 4 additions & 3 deletions
@@ -12,7 +12,7 @@ public static void main(String[] args) {
 //        System.out.println(Arrays.toString(nums));
 
 //        lexo("",nums,line.length());
-        lexoNum(0,15);
+        lexoNum(0,11);
     }
 
     public static int[] freq(String chars){
 
@@ -8,11 +8,9 @@
 
 public class SumDivideArray {
     public static void main(String[] args) {
-        int[] nums ={1 ,2 ,3 ,3 ,4 ,5};
-        divide(nums, 0,0,0,new ArrayList<Integer>(),new ArrayList<Integer>());
-
-//        sumTarget(nums,0,10,0,new ArrayList<Integer>());
-
+        int[] nums ={-1,3,7,4,2,1};
+        divide(nums, 0,0,0,new ArrayList<>(),new ArrayList<>());
+//        sumTarget(nums,0,10,0,new ArrayList<>());
     }
 
     public static void divide(int[] nums,int index, int sum1, int sum2, ArrayList<Integer> list1,ArrayList<Integer> list2){
 
@@ -32,14 +32,15 @@ public static void main(String[] args) {
 
     public static int oddOcc(int[] nums){
         int res = 0;
-        for (int i = 0; i < nums.length ; i++) {
-            res = res ^ nums[i];
+        for (int num : nums) {
+            res = res ^ num;
         }
         return res;
     }
 
     public static boolean isOdd( int  n){
-        return (n & 1) == 0;    //If returns 1 : odd else even.
+        return (n & 1) == 0;
+        //If returns 1 : odd else even.
     }
 
     public static int countOne(int n){
Original file line number	Diff line number	Diff line change
`@@ -12,7 +12,7 @@ public static void main(String[] args) {`
`12`	`12`	`// System.out.println(Arrays.toString(nums));`
`13`	`13`
`14`	`14`	`// lexo("",nums,line.length());`
`15`		`- lexoNum(0,15);`
	`15`	`+ lexoNum(0,11);`
`16`	`16`	`}`
`17`	`17`
`18`	`18`	`public static int[] freq(String chars){`
Original file line number	Diff line number	Diff line change
`@@ -32,14 +32,15 @@ public static void main(String[] args) {`
`32`	`32`
`33`	`33`	`public static int oddOcc(int[] nums){`
`34`	`34`	`int res = 0;`
`35`		`- for (int i = 0; i < nums.length ; i++) {`
`36`		`- res = res ^ nums[i];`
	`35`	`+ for (int num : nums) {`
	`36`	`+ res = res ^ num;`
`37`	`37`	`}`
`38`	`38`	`return res;`
`39`	`39`	`}`
`40`	`40`
`41`	`41`	`public static boolean isOdd( int n){`
`42`		`- return (n & 1) == 0; //If returns 1 : odd else even.`
	`42`	`+ return (n & 1) == 0;`
	`43`	`+ //If returns 1 : odd else even.`
`43`	`44`	`}`
`44`	`45`
`45`	`46`	`public static int countOne(int n){`