Remove package & rename function name

Author: marttp

kotlin/Two Pointers/IsPalindromeValid.kt

@@ -1,8 +1,6 @@
-package common.twopointers.ispalindrome
-
 class IsPalindromeValid {
 
-    fun solution(s: String): Boolean {
+    fun isPalindromeValid(s: String): Boolean {
         var left = 0
         var right = s.length - 1
         while (left < right) {

kotlin/Two Pointers/LargestContainer.kt

@@ -1,11 +1,6 @@
-package common.twopointers.largestcontainer
-
-import kotlin.math.max
-import kotlin.math.min
-
 class LargestContainer {
 
-    fun solution(heights: List<Int>): Int {
+    fun largestContainer(heights: List<Int>): Int {
         var maxWater = 0
         var left = 0
         var right = heights.size - 1

kotlin/Two Pointers/LargestContainerBruteForce.kt

@@ -1,11 +1,6 @@
-package common.twopointers.largestcontainer
-
-import kotlin.math.max
-import kotlin.math.min
-
 class LargestContainerBruteForce {
 
-    fun solution(heights: List<Int>): Int {
+    fun largestContainerBruteForce(heights: List<Int>): Int {
         val n = heights.size
         var maxWater = 0
         // Find the maximum amount of water stored between all pairs of lines.

kotlin/Two Pointers/NextLexicographicalSequence.kt

@@ -1,8 +1,6 @@
-package common.twopointers.nextlexicographicalsequence
-
 class NextLexicographicalSequence {
 
-    fun solution(s: String): String {
+    fun nextLexicographicalSequence(s: String): String {
         val letters = s.toCharArray()
 
         // Locate the pivot, which is the first character from the right that breaks

kotlin/Two Pointers/PairSumSorted.kt

@@ -1,8 +1,6 @@
-package common.twopointers.pairsumsorted
-
 class PairSumSorted {
 
-    fun solution(nums: IntArray, target: Int): List<Int> {
+    fun pairSumSorted(nums: IntArray, target: Int): List<Int> {
         var left = 0
         var right = nums.size - 1
         while (left < right) {

kotlin/Two Pointers/PairSumSortedBruteForce.kt

@@ -1,8 +1,6 @@
-package common.twopointers.pairsumsorted
-
 class PairSumSortedBruteForce {
 
-    fun solution(nums: IntArray, target: Int): List<Int> {
+    fun pairSumSortedBruteForce(nums: IntArray, target: Int): List<Int> {
         val n = nums.size
         for (i in 0 until n) {
             for (j in i + 1 until nums.size) {

kotlin/Two Pointers/ShiftZeroToTheEnd.kt

@@ -1,8 +1,6 @@
-package common.twopointers.shiftzero
-
 class ShiftZeroToTheEnd {
 
-    fun solution(nums: IntArray) {
+    fun shiftZerosToTheEnd(nums: IntArray) {
         // The 'left' pointer is used to position non-zero elements.
         var left = 0
         // Iterate through the array using a 'right' pointer to locate non-zero

kotlin/Two Pointers/ShiftZeroToTheEndNaive.kt

@@ -1,8 +1,6 @@
-package common.twopointers.shiftzero
-
 class ShiftZeroToTheEndNaive {
 
-    fun solution(nums: IntArray) {
+    fun shiftZerosToTheEndNaive(nums: IntArray) {
         val temp = IntArray(nums.size)
         var i = 0
 

kotlin/Two Pointers/TripletSum.kt

@@ -1,8 +1,6 @@
-package common.twopointers.tripletsum
-
 class TripletSum() {
 
-    fun solution(nums: List<Int>): List<List<Int>> {
+    fun tripletSum(nums: List<Int>): List<List<Int>> {
         val triplets = mutableListOf<List<Int>>()
         val sortedNums = nums.sorted()
         for (i in sortedNums.indices) {

kotlin/Two Pointers/TripletSumBruteForce.kt

@@ -1,8 +1,6 @@
-package common.twopointers.tripletsum
-
 class TripletSumBruteForce {
 
-    fun solution(nums: List<Int>): List<List<Int>> {
+    fun tripletSumBruteForce(nums: List<Int>): List<List<Int>> {
         // Use a hash set to ensure we don't add duplicate triplets.
         val triplets = hashSetOf<List<Int>>()
         // Iterate through the indexes of all triplets. O(n^3)