Update Readme.md

Readme.md

@@ -6,7 +6,7 @@ to convert the negative number into binary.
 Sample Input:  if a given number is <b>35</b>, the method should return <b>100011</b> 
 
 
-write your code under <b> src/main/java/exam/ConvertToBinary#toBinary() - (3) Marks.</b> method
+write your code under <b> src/main/java/exam/ConvertToBinary#toBinary() method - (3) Marks.</b>
 
 ----------------
 
@@ -18,7 +18,7 @@ e.g. if the array input is <b>1,2,3,4,5</b>
 then the implementation of shift method should shift the element and also the last element (5) should come to the first place 
 and hence the final output should be <b>5,1,2,3,4</b> 
 
-write your code under <b> src/main/java/exam/ShiftElementsInArray#shift() - (3) Marks.</b> method
+write your code under <b> src/main/java/exam/ShiftElementsInArray#shift() method - (3) Marks.</b>
 
 ----------------
 
@@ -43,7 +43,7 @@ all the weights range from 1 to w.
 
 `2,3`
 
-write your code under <b> src/main/java/exam/CountCombinations#getNumberOfWays() - (4) Marks.</b> method
+write your code under <b> src/main/java/exam/CountCombinations#getNumberOfWays() method - (4) Marks.</b>