Bernard Wong
  • Software Engineer
  • Problems
    • Lowest Common Ancestor of a Binary Tree
    • Longest Substring Without Repeating Characters
    • Longest Palindromic Substring
    • Longest Common Prefix
    • Isomorphic Strings
    • Integer to Roman
    • Frog Jump
    • Find the Difference
    • Find k closest elements to a given value
    • Longest Common Subsequence
    • Binary Search Tree from Sorted Array
    • Balanced Binary Tree
    • Sort Using Two Stacks
    • O(1) Stack
    • k-th element to last of a LinkedList
    • Dedup LinkedList
    • Check Rotated String
    • Compress String by Character Count
    • Escape HTML whitespace
    • Check String Permutation
    • Unique String
    • Container With Most Water
    • 4 Sum
    • 3 Sum Closest
    • 3 Sum
    • 2 Sum
    • Maximum Subarray
    • Nested List Weight Sum
    • Palindrome Number
    • Pow(x, n)
    • Regular Expression Matching
    • Remove Nth Node From End of List
    • Reverse Integer
    • Roman to Integer
    • Rotate Array
    • Search a 2D Matrix
    • Shortest Word Distance
    • Two Sum III - Data structure design
    • Valid Parentheses
    • ZigZag Conversion
    • Quicksort
    • Add Two Numbers
    • Best Time to Buy and Sell Stock
    • Letter Combinations of a Phone Number
  • Data Structures
    • Heap
Powered by GitBook
On this page
  1. Problems

k-th element to last of a LinkedList

Implement an algorithm to find the kth to last element of a singly linked list

trait Node {
  def value: Int

  def next: Node
}

object Empty extends Node {
  def value: Int = throw new Error("access empty variable")

  def next: Node = throw new Error("access empty variable")
}

case class NonEmpty(val value: Int, val next: Node = Empty) extends Node

def toLinkedList(lst: List[Int]): Node = {
  if (lst.isEmpty) Empty
  else new NonEmpty(lst.head, toLinkedList(lst.tail))
}

def printLinkedList(head: Node): Unit = head match {
  case Empty =>
  case node: NonEmpty => {
    println(node.value)
    printLinkedList(node.next)
  }
}

/**
  * 2.2
  *
  * @param head
  * @param k
  * @return
  */
def kthElement(head: Node, k: Int): Node = head match {
  case Empty => head
  case node: NonEmpty =>
    if (node.next == Empty) Empty
    else {
      var slow = head
      var fast = head.next
      for (i <- 0 until k - 1 if fast != Empty) {
        fast = fast.next
      }
      while (fast != Empty) {
        slow = slow.next
        fast = fast.next
      }
      slow
    }
}

var node = kthElement(toLinkedList(List(1, 2, 3)), 3)
node.value

PreviousO(1) StackNextDedup LinkedList

Last updated 6 years ago