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

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

|2110|[Number of Smooth Descent Periods of a Stock](https://leetcode.com/problems/number-of-smooth-descent-periods-of-a-stock/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2110.java)||Medium||

|2109|[Adding Spaces to a String](https://leetcode.com/problems/adding-spaces-to-a-string/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2109.java)||Medium||

|2108|[Find First Palindromic String in the Array](https://leetcode.com/problems/find-first-palindromic-string-in-the-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2108.java)||Easy||

|2103|[Rings and Rods](https://leetcode.com/problems/rings-and-rods/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2103.java)||Easy||

packagecom.fishercoder.solutions;

publicclass_2110 {

publicstaticclassSolution1 {

publiclonggetDescentPeriods(int[]prices) {

longans =prices.length;

for (inti =0;i <prices.length;i++) {

longstartI =i;

while (i +1 <prices.length &&prices[i] -1 ==prices[i +1]) {

i++;

}

longtotalNum =i -startI +1;

if (totalNum >1) {

ans += ((totalNum -1) *totalNum) /2;

}

}

returnans;

}

}

}