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

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

|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||

|2161|[Partition Array According to Given Pivot](https://leetcode.com/problems/partition-array-according-to-given-pivot/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2161.java)||Medium||

|2160|[Minimum Sum of Four Digit Number After Splitting Digits](https://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2160.java)||Easy||

packagecom.fishercoder.solutions;

importjava.util.*;

publicclass_2165 {

publicstaticclassSolution1 {

publiclongsmallestNumber(longnum) {

if (num ==0) {

returnnum;

}

booleannegative =num <0;

TreeMap<Integer,Integer>treeMap =newTreeMap<>();

while (num !=0) {

intdigit = (int)Math.abs(num %10);

treeMap.put(digit,treeMap.getOrDefault(digit,0) +1);

num /=10;

}

if (!negative) {

if (treeMap.firstKey() ==0) {

intzeroCount =treeMap.get(0);

treeMap.remove(0);

StringBuildersb =newStringBuilder();

inttime =0;

for (intkey :treeMap.keySet()) {

intcount =treeMap.get(key);

time++;

if (time ==1) {

sb.append(key);

while (zeroCount >0) {

sb.append(0);

zeroCount--;

}

count--;

}

while (count >0) {

sb.append(key);

count--;

}

}

returnLong.parseLong(sb.toString());

}else {

StringBuildersb =newStringBuilder();

for (intkey :treeMap.keySet()) {

intcount =treeMap.get(key);

while (count >0) {

sb.append(key);

count--;

}

}

returnLong.parseLong(sb.toString());

}

}else {

Set<Integer>keys =treeMap.keySet();

List<Integer>sorted =newArrayList<>(keys);

Collections.sort(sorted,Collections.reverseOrder());

StringBuildersb =newStringBuilder();

for (inti =0;i <sorted.size();i++) {

intcount =treeMap.get(sorted.get(i));

while (count >0) {

sb.append(sorted.get(i));

count--;

}

}

return -Long.parseLong(sb.toString());

}

}

}

}