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

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

|1688|[Count of Matches in Tournament](https://leetcode.com/problems/count-of-matches-in-tournament/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1688.java) ||Easy|Backtracking|

|1685|[Sum of Absolute Differences in a Sorted Array](https://leetcode.com/problems/sum-of-absolute-differences-in-a-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1685.java) ||Medium|Math, Greedy|

|1684|[Count the Number of Consistent Strings](https://leetcode.com/problems/count-the-number-of-consistent-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1684.java) ||Easy|String|

|1679|[Max Number of K-Sum Pairs](https://leetcode.com/problems/max-number-of-k-sum-pairs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1679.java) ||Medium|HashTable|

package com.fishercoder.solutions;

public class _1688 {

public static class Solution1 {

public int numberOfMatches(int n) {

int matches = 0;

while (n > 1) {

if (n % 2 == 0) {

matches += n / 2;

n /= 2;

} else {

matches += (n - 1) / 2;

n = (n + 1) / 2;

}

}

return matches;

}

}

}

package com.fishercoder;

import com.fishercoder.solutions._1688;

import org.junit.BeforeClass;

import org.junit.Test;

import static org.junit.Assert.assertEquals;

public class _1688Test {

private static _1688.Solution1 solution1;

@BeforeClass

public static void setup() {

solution1 = new _1688.Solution1();

}

@Test

public void test1() {

assertEquals(6, solution1.numberOfMatches(7));

}

}