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

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

|2138|[Divide a String Into Groups of Size k](https://leetcode.com/problems/divide-a-string-into-groups-of-size-k/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2138.java)||Easy||

|2134|[Minimum Swaps to Group All 1's Together II](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2134.java)||Medium||

|2133|[Check if Every Row and Column Contains All Numbers](https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2133.java)||Easy||

|2130|[Maximum Twin Sum of a Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2130.java)||Medium||

packagecom.fishercoder.solutions;

publicclass_2138 {

publicstaticclassSolution1 {

publicString[]divideString(Strings,intk,charfill) {

intlen =s.length() /k;

if (s.length() %k !=0) {

len++;

}

String[]ans =newString[len];

for (inti =0,j =0;i <s.length();i +=k,j++) {

if (j ==len -1) {

StringBuildersb =newStringBuilder(s.substring(i));

if (sb.length() !=k) {

while (sb.length() <k) {

sb.append(fill);

}

}

ans[j] =sb.toString();

}else {

ans[j] =s.substring(i,i +k);

}

}

returnans;

}

}

}