ASRagab

def last[T](ls: List[T]): T = {
  ls match {
    case Nil => throw new Exception("No last element of empty list")
    case h :: Nil => h
    case _ :: tail => last(tail)
  }
}

val test = List(2, 4, 7, 3, 100)
last(test)

ASRagab

object queuesBankers {
  import BankersQueue._

  case class BankersQueue[+A](sizeFront: Int, front: Stream[A], sizeRear: Int, rear: Stream[A]) {
    def enqueue[B >: A](b: B) =
      check(BankersQueue(sizeFront,front, sizeRear + 1, b #:: rear))

    def dequeue = front match {
      case h #:: t => {
        val remaining = BankersQueue(sizeFront - 1, t, sizeRear, rear)

ASRagab

ASRagab

ASRagab

object nQueens extends App {
  type Solution = IndexedSeq[Int]

  def createSolutions(n: Int): Seq[Solution] = {
    (0 until n).permutations.toSeq
  } 

  def verifySolution(s: Solution): Boolean = {
    s.indices.combinations(2).forall(x => Math.abs(x(0) - x(1)) != Math.abs(s(x(0)) - s(x(1))))
  }

ASRagab

package Other

import scalaz.Functor

import scala.language.higherKinds

object exampleList {
  
  sealed trait mList
  case object mNil extends mList

ASRagab

import cats._
import cats.implicits._

case class StreamZipper[A](left: Stream[A], focus: A, right: Stream[A]) {
  def moveLeft: StreamZipper[A] =
    if (left.isEmpty) this
    else new StreamZipper[A](left.tail, left.head, focus #:: right)
  
  def moveRight: StreamZipper[A] =
    if (right.isEmpty) this

ASRagab

Topics

Algos

1. Baby Gin Problem
2. Lexicographic–Order
3. Johonson-Trotter
4. Minimum-exchange Requirement
5. Knapsack Problem and Fractional Knapsack Method
6. Huffman coding

ASRagab

Instructions

pip install boto3 moto 'moto[server]'

Usage

To start moto server for sqs (ONLY FOR NON BOTO TESTING):

ASRagab

#! /bin/bash
#
# Run parallel commands and fail if any of them fails.
#

set -eu

pids=()

for x in 1 2 3; do