Scala algorithm: Count passing cars

Published

Algorithm goal

An Array represents a sequence of cars in a sequence, either going East or West.

Count the pairs of cars that pass each other eventually.

For example, if we represent the cars as a string EEWEW, then the number of passes would be 5: First 2 EEs pass both WWs, so 4 passes, and then the last E passes the last W, so in total 5 passes.

Test cases in Scala

This algorithm comes with test cases.
To see the free test cases for all our algos, as well as run them in our TDD IDE, Register (free).

Algorithm in Scala

27 lines of Scala (compatible versions 2.13 & 3.0), showing how concise Scala can be!

Get the full algorithm Scala algorithms logo, maze part, which looks quirky!

or

'Unlimited Scala Algorithms' gives you access to all the 77 published & 15 upcoming Scala Algorithms (92 total)! Plenty to master your Scala algos skills!

Upon purchase, you will be able to Register an account to access all the algorithms on multiple devices.

Stripe logo

Explanation

For every car going West, we need to know how many cars going East it will cross, and then combine that count to get the total number of passes.

Let's say if we have EEWEW representing 5 cars in total, then we can represent them as prefix sums: Number of cars going East from position 0 is 1, from position 1 is 2, from position 2 is 2, and so forth; so 12233. (this is © from www.scala-algorithms.com)

Full explanation is available for subscribers Scala algorithms logo, maze part, which looks quirky

Scala concepts & Hints

  1. Collect

    'collect' allows you to use Pattern Matching, to filter and map items.

    assert("Hello World".collect {
      case character if Character.isUpperCase(character) => character.toLower
    } == "hw")
    
  2. Drop, Take, dropRight, takeRight

    Scala's `drop` and `take` methods typically remove or select `n` items from a collection.

    assert(List(1, 2, 3).drop(2) == List(3))
    
    assert(List(1, 2, 3).take(2) == List(1, 2))
    
    assert(List(1, 2, 3).dropRight(2) == List(1))
    
    assert(List(1, 2, 3).takeRight(2) == List(2, 3))
    
    assert((1 to 5).take(2) == (1 to 2))
    
  3. Pattern Matching

    Pattern matching in Scala lets you quickly identify what you are looking for in a data, and also extract it.

    assert("Hello World".collect {
      case character if Character.isUpperCase(character) => character.toLower
    } == "hw")
    
  4. scanLeft and scanRight

    Scala's `scan` functions enable you to do folds like foldLeft and foldRight, while collecting the intermediate results

    assert(List(1, 2, 3, 4, 5).scanLeft(0)(_ + _) == List(0, 1, 3, 6, 10, 15))
    
  5. Stack Safety

    Stack safety is present where a function cannot crash due to overflowing the limit of number of recursive calls.

    This function will work for n = 5, but will not work for n = 2000 (crash with java.lang.StackOverflowError) - however there is a way to fix it :-)

    In Scala Algorithms, we try to write the algorithms in a stack-safe way, where possible, so that when you use the algorithms, they will not crash on large inputs. However, stack-safe implementations are often more complex, and in some cases, overly complex, for the task at hand.

    def sum(from: Int, until: Int): Int =
      if (from == until) until else from + sum(from + 1, until)
    
    def thisWillSucceed: Int = sum(1, 5)
    
    def thisWillFail: Int = sum(1, 300)
    
  6. State machine

    A state machine is the use of `sealed trait` to represent all the possible states (and transitions) of a 'machine' in a hierarchical form.

  7. View

    The .view syntax creates a structure that mirrors another structure, until "forced" by an eager operation like .toList, .foreach, .forall, .count.

  8. Zip

    'zip' allows you to combine two lists pair-wise (meaning turn a pair of lists, into a list of pairs)

    It can be used over Arrays, Lists, Views, Iterators and other collections.

    assert(List(1, 2, 3).zip(List(5, 6, 7)) == List(1 -> 5, 2 -> 6, 3 -> 7))
    
    assert(List(1, 2).zip(List(5, 6, 7)) == List(1 -> 5, 2 -> 6))
    
    assert(List(5, 6).zipWithIndex == List(5 -> 0, 6 -> 1))
    
    assert(List(5, 6).zipAll(List('A'), 9, 'Z') == List(5 -> 'A', 6 -> 'Z'))
    
    assert(List(5).zipAll(List('A', 'B'), 1, 'Z') == List(5 -> 'A', 1 -> 'B'))
    

Scala Algorithms: The most comprehensive library of algorithms in standard pure-functional Scala

Think in Scala & master the highest paid programming language in the US

Scala is used at many places, such as AirBnB, Apple, Bank of America, BBC, Barclays, Capital One, Citibank, Coursera, eBay, JP Morgan, LinkedIn, Morgan Stanley, Netflix, Singapore Exchange, Twitter.

Study our 92 Scala Algorithms: 6 fully free, 77 published & 15 upcoming

Fully unit-tested, with explanations and relevant concepts; new algorithms published about once a week.

  1. Compute the length of longest valid parentheses
  2. Check a binary tree is balanced
  3. Make a queue using stacks (Lists in Scala)
  4. Find height of binary tree
  5. Single-elimination tournament tree
  6. Quick Sort sorting algorithm in pure immutable Scala
  7. Find minimum missing positive number in a sequence
  8. Least-recently used cache (LRU)
  9. Count pairs of a given expected sum
  10. Compute a Roman numeral for an Integer, and vice-versa
  11. Compute keypad possibilities
  12. Matching parentheses algorithm with foldLeft and a state machine
  13. Traverse a tree Breadth-First, immutably
  14. Read a matrix as a spiral
  15. Remove duplicates from a sorted list (state machine)
  16. Merge Sort: stack-safe, tail-recursive, in pure immutable Scala, N-way
  17. Longest increasing sub-sequence length
  18. Reverse first n elements of a queue
  19. Binary search a generic Array
  20. Merge Sort: in pure immutable Scala
  21. Make a queue using Maps
  22. Is an Array a permutation?
  23. Count number of contiguous countries by colors
  24. Add numbers without using addition (plus sign)
  25. Tic Tac Toe MinMax solve
  26. Run-length encoding (RLE) Encoder
  27. Print Alphabet Diamond
  28. Balanced parentheses algorithm with tail-call recursion optimisation
  29. Reverse a String's words efficiently
  30. Count number of changes (manipulations) needed to make an anagram with foldLeft and a MultiSet
  31. Count passing cars
  32. Establish execution order from dependencies
  33. Counting inversions of a sequence (array) using a Merge Sort
  34. Longest common prefix of strings
  35. Check if an array is a palindrome
  36. Check a directed graph has a routing between two nodes (depth-first search)
  37. Compute nth row of Pascal's triangle
  38. Run-length encoding (RLE) Decoder
  39. Check if a number is a palindrome
  40. In a range of numbers, count the numbers divisible by a specific integer
  41. Find the index of a substring ('indexOf')
  42. Reshape a matrix
  43. Compute modulo of an exponent without exponentiation
  44. Closest pair of coordinates in a 2D plane
  45. Find the contiguous slice with the minimum average
  46. Compute maximum sum of subarray (Kadane's algorithm)
  47. Pure-functional double linked list
  48. Binary search in a rotated sorted array
  49. Check if a directed graph has cycles
  50. Rotate Array right in pure-functional Scala - using an unusual immutable efficient approach
  51. Check a binary tree is a search tree
  52. Length of the longest common substring
  53. Sliding Window Rate Limiter
  54. Tic Tac Toe board check
  55. Find an unpaired number in an array
  56. Check if a String is a palindrome
  57. Count binary gap size of a number using tail recursion
  58. Remove duplicates from a sorted list (Sliding)
  59. Monitor success rate of a process that may fail
  60. Find sub-array with the maximum sum
  61. Find the minimum absolute difference of two partitions
  62. Find maximum potential profit from an array of stock price
  63. Fibonacci in purely functional immutable Scala
  64. Fizz Buzz in purely functional immutable Scala
  65. Find combinations adding up to N (non-unique)
  66. Make a binary search tree (Red-Black tree)
  67. Remove duplicates from an unsorted List
  68. Mars Rover
  69. Find combinations adding up to N (unique)
  70. Find indices of tuples that sum to a target (Two Sum)
  71. Count factors/divisors of an integer
  72. Compute single-digit sum of digits
  73. Traverse a tree Depth-First
  74. Reverse bits of an integer
  75. Find k closest elements to a value in a sorted Array
  76. QuickSelect Selection Algorithm (kth smallest item/order statistic)
  77. Rotate a matrix by 90 degrees clockwise

Explore the 21 most useful Scala concepts

To save you going through various tutorials, we cherry-picked the most useful Scala concepts in a consistent form.

  1. Class Inside Class
  2. Class Inside Def
  3. Collect
  4. Def Inside Def
  5. Drop, Take, dropRight, takeRight
  6. foldLeft and foldRight
  7. For-comprehension
  8. Lazy List
  9. Option Type
  10. Ordering
  11. Partial Function
  12. Pattern Matching
  13. Range
  14. scanLeft and scanRight
  15. Sliding / Sliding Window
  16. Stack Safety
  17. State machine
  18. Tail Recursion
  19. Type Class
  20. View
  21. Zip

Register now (free)