_{[0024 - Swap Nodes In Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](go%2F0024-swap-nodes-in-pairs.go)</div>} | _{<divalign='center'>[✔️](java%2F0024-swap-nodes-in-pairs.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](python%2F0024-swap-nodes-in-pairs.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0148 - Sort List](https://leetcode.com/problems/sort-list/)} | _{<divalign='center'>[✔️](c%2F0148-sort-list.c)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0148-sort-list.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](python%2F0148-sort-list.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0086 - Partition List](https://leetcode.com/problems/partition-list/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0086-partition-list.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](python%2F0086-partition-list.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0061 - Rotate List](https://leetcode.com/problems/rotate-list/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0061-rotate-list.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](python%2F0061-rotate-list.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0061 - Rotate List](https://leetcode.com/problems/rotate-list/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F0061-rotate-list.cpp)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0061-rotate-list.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](python%2F0061-rotate-list.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0092 - Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](javascript%2F0092-reverse-linked-list-ii.js)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](python%2F0092-reverse-linked-list-ii.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0622 - Design Circular Queue](https://leetcode.com/problems/design-circular-queue/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](go%2F0622-design-circular-queue.go)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0622-design-circular-queue.kt)</div>} | _{<divalign='center'>[✔️](python%2F0622-design-circular-queue.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0147 - Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](python%2F0147-insertion-sort-list.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[5782 - Maximum Alternating Subsequence Sum](https://leetcode.com/problems/maximum-alternating-subsequence-sum/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0115 - Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F0115-distinct-subsequences.cpp)</div>} | _{<divalign='center'>[✔️](csharp%2F0115-distinct-subsequences.cs)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0115-distinct-subsequences.java)</div>} | _{<divalign='center'>[✔️](javascript%2F0115-distinct-subsequences.js)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](python%2F0115-distinct-subsequences.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](typescript%2F0115-distinct-subsequences.ts)</div>}

_{[0072 - Edit Distance](https://leetcode.com/problems/edit-distance/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F0072-edit-distance.cpp)</div>} | _{<divalign='center'>[✔️](csharp%2F0072-edit-distance.cs)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0072-edit-distance.java)</div>} | _{<divalign='center'>[✔️](javascript%2F0072-edit-distance.js)</div>} | _{<divalign='center'>[✔️](kotlin%2F0072-edit-distance.kt)</div>} | _{<divalign='center'>[✔️](python%2F0072-edit-distance.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](scala%2F0072-edit-distance.scala)</div>} | _{<divalign='center'>[✔️](swift%2F0072-edit-distance.swift)</div>} | _{<divalign='center'>❌</div>}

_{[1220 - Count Vowels Permutation](https://leetcode.com/problems/count-vowels-permutation/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](go%2F1220-count-vowels-permutation.go)</div>} | _{<divalign='center'>[✔️](java%2F1220-Count-Vowels-Permutation.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](python%2F1220-count-vowels-permutation.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[1220 - Count Vowels Permutation](https://leetcode.com/problems/count-vowels-permutation/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F1220-count-vowels-permutation.cpp)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](go%2F1220-count-vowels-permutation.go)</div>} | _{<divalign='center'>[✔️](java%2F1220-Count-Vowels-Permutation.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](python%2F1220-count-vowels-permutation.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0312 - Burst Balloons](https://leetcode.com/problems/burst-balloons/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F0312-burst-balloons.cpp)</div>} | _{<divalign='center'>[✔️](csharp%2F0312-burst-balloons.cs)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0312-burst-balloons.java)</div>} | _{<divalign='center'>[✔️](javascript%2F0312-burst-balloons.js)</div>} | _{<divalign='center'>[✔️](kotlin%2F0312-burst-balloons.kt)</div>} | _{<divalign='center'>[✔️](python%2F0312-burst-balloons.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](typescript%2F0312-burst-balloons.ts)</div>}

_{[1866 - Number of Ways to Rearrange Sticks With K Sticks Visible](https://leetcode.com/problems/number-of-ways-to-rearrange-sticks-with-k-sticks-visible/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0010 - Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/)} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](cpp%2F0010-regular-expression-matching.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F0010-regular-expression-matching.cs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](go%2F0010-regular-expression-matching.go)</div>} | _{<div align='center'>[✔️](java%2F0010-regular-expression-matching.java)</div>} | _{<div align='center'>[✔️](javascript%2F0010-regular-expression-matching.js)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](python%2F0010-regular-expression-matching.py)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](typescript%2F0010-regular-expression-matching.ts)</div>}

classSolution {

constunsignedint mod =1e9+7;

intcountVowelPermutation(int n) {

vector<int>prev(5,1),curr(5,0);

for(int i=1; i<n; i++) {

curr[0] = prev[1] % mod;

curr[1] = (prev[0] + prev[2]) % mod;

curr[2] = ((prev[0] % mod) + (prev[1] % mod) + (prev[3] % mod) + (prev[4] % mod)) % mod;

curr[3] = (prev[4] + prev[2]) % mod;

curr[4] = prev[0] % mod;

prev = curr;

}

int ans =0;

for(auto &a:prev) ans = (ans + a) % mod;

return ans;

}

};

classSolution {

funsortArray(nums:IntArray):IntArray {

mergeSort(nums,0, nums.lastIndex)

return nums

}

privatefunmergeSort(nums:IntArray,left:Int,right:Int) {

if(left== right)return

val mid= (left+ right)/2

mergeSort(nums, left, mid)

mergeSort(nums, mid+1, right)

merge(nums, left, mid, right)

}

privatefunmerge(nums:IntArray,left:Int,mid:Int,right:Int) {

val leftPart= nums.copyOfRange(left, mid+1)

val rightPart= nums.copyOfRange(mid+1, right+1)

var i= left

var j=0

var k=0

while(j< leftPart.size&& k< rightPart.size) {

if(leftPart[j]<= rightPart[k]) {

nums[i]= leftPart[j]

j++

}else{

nums[i]= rightPart[k]

k++

}

i++

}

while(j< leftPart.size) {

nums[i]= leftPart[j]

j++

i++

}

while(k< rightPart.size) {

nums[i]= rightPart[k]

k++

i++

}

}

}

classSolution {

funsortArray(nums:IntArray):IntArray {

quickSort(nums,0, nums.lastIndex)

return nums

}

privatefunquickSort(nums:IntArray,low:Int,high:Int) {

if (low< high) {

val pivotIndex= partition(nums, low, high)

quickSort(nums, low, pivotIndex-1)

quickSort(nums, pivotIndex+1, high)

}

}

privatefunpartition(nums:IntArray,low:Int,high:Int):Int {

val pivot= nums[high]

var i= low

for(jin low until high) {

if (nums[j]<= pivot) {

nums.swap(i, j)

i++

}

}

nums.swap(i, high)

return i

}

fun IntArray.swap(i:Int,j:Int) {

this[i]=this[j].also{this[j]=this[i] }

}

}

classSolution {

funsortArray(nums:IntArray):IntArray {

heapSort(nums)

return nums

}

privatefunheapSort(nums:IntArray) {

val n= nums.size

for(iin (n/2-1) downTo0)

heapify(nums, n, i)

for(iin n-1 downTo0) {

nums.swap(0, i)

heapify(nums, i,0)

}

}

privatefunheapify(nums:IntArray,n:Int,i:Int) {

var largest= i

val left=2* i+1

val right=2* i+2

if(left< n&& nums[left]> nums[largest])

largest= left

if(right< n&& nums[right]> nums[largest])

largest= right

if(largest!= i) {

nums.swap(i, largest)

heapify(nums, n, largest)

}

}

fun IntArray.swap(i:Int,j:Int) {

this[i]=this[j].also{this[j]=this[i] }

}

}