martian17

Get all cars out!

This problem is based on a famous mobile game called parking jam. Here is a video footage from the game play.
https://www.youtube.com/watch?v=cDv_-LezHPw
In order to define the rules better, I decided to change it up a bit. Cars, walls, and empty spaces are now represented by characters on a grid of string. Each car consists of an arrow spanning two adjacent squares with the charset <>v^|-. Walls are marked by *, and the exit is marked by =. Here is an example input:

********
*<-|->^*
*  v<-|*
*<-  | =
* |-&gt;v *

martian17

const range = function(n){
    const arr = [];
    for(let i = 0; i < n; i++){
        arr.push(i);
    }
    return arr;
};

const peek = function(arr){
    return arr[arr.length-1];

martian17

// source: https://stackoverflow.com/questions/72669756/property-selected-of-type-boolean-is-not-assignable-to-string-index-type

interface Field {
  selected:  boolean;
  value: any;
}

type ConflictingVersionModel = {
  [key: string]: Field;
} & { selected: boolean };

martian17

//util functions
const isNode = typeof window === "undefined";

const U8FromView = function(view: ArrayBufferView): Uint8Array{
    if(view instanceof Uint8Array){
        return view;
    }
    return new Uint8Array(view.buffer,view.byteOffset,view.byteLength);
};