| # | Title | Solutions | Video | Difficulty | Tag

|-----|----------------|---------------|--------|-------------|-------------

|2169|[Count Operations to Obtain Zero](https://leetcode.com/problems/count-operations-to-obtain-zero/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2169.java)||Easy||

|2166|[Design Bitset](https://leetcode.com/problems/design-bitset/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2166.java)||Medium||

|2165|[Smallest Value of the Rearranged Number](https://leetcode.com/problems/smallest-value-of-the-rearranged-number/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2165.java)||Medium||

|2164|[Sort Even and Odd Indices Independently](https://leetcode.com/problems/sort-even-and-odd-indices-independently/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2164.java)||Easy||

packagecom.fishercoder.solutions;

publicclass_2169 {

publicstaticclassSolution1 {

publicintcountOperations(intnum1,intnum2) {

intops =0;

while (true) {

if (num1 ==0 ||num2 ==0) {

returnops;

}

if (num1 >=num2) {

num1 -=num2;

}else {

num2 -=num1;

}

ops++;

}

}

}

}