Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,845 questions

51,766 answers

573 users

How to search insert position of K in a sorted list with Kotlin

2 Answers

0 votes
// Given a sorted array/vector/list of distinct integers and a target value K, 
// return the index if the target is found. 
// If not, return the index where it would be if it were inserted in order.

fun searchInsertPositionOfK(lst: List<Int>, k: Int): Int {
    for (i in lst.indices) {
        // If k is found or needs to be inserted before lst[i]
        if (lst[i] >= k) {
            return i
        }
    }
    // If k is greater than all elements, it should be inserted at the end
    return lst.size
}

fun main() {
    val list1 = listOf(1, 3, 5, 6, 7, 8)
    val k1 = 5
    println(searchInsertPositionOfK(list1, k1))

    val list2 = listOf(1, 3, 5, 6, 7, 8)
    val k2 = 2
    println(searchInsertPositionOfK(list2, k2))

    val list3 = listOf(1, 3, 5, 6, 7, 8)
    val k3 = 9
    println(searchInsertPositionOfK(list3, k3))
}

   
      
/*
run:

2
1
6
  
*/

 



answered May 10, 2025 by avibootz
0 votes
// Given a sorted array/vector/list of distinct integers and a target value K, 
// return the index if the target is found. 
// If not, return the index where it would be if it were inserted in order.

// Function to find the index of k or the position where it should be inserted - Using Binary Search
fun searchInsertPositionOfK(lst: List<Int>, k: Int): Int {
    var left = 0
    var right = lst.size - 1

    while (left <= right) {
        val mid = left + (right - left) / 2

        when {
            lst[mid] == k -> return mid
            lst[mid] > k -> right = mid - 1
            else -> left = mid + 1
        }
    }

    return left
}

fun main() {
    val list1 = listOf(1, 3, 5, 6, 7, 8)
    val k1 = 5
    println(searchInsertPositionOfK(list1, k1))

    val list2 = listOf(1, 3, 5, 6, 7, 8)
    val k2 = 2
    println(searchInsertPositionOfK(list2, k2))

    val list3 = listOf(1, 3, 5, 6, 7, 8)
    val k3 = 9
    println(searchInsertPositionOfK(list3, k3))
}

   
      
/*
run:

2
1
6
  
*/

 



answered May 10, 2025 by avibootz
...