feliperazeek

import org.apache.hadoop.conf.Configuration
import org.apache.iceberg.hadoop.HadoopFileIO
import org.apache.iceberg.spark.Spark3Util
import org.apache.iceberg.{DataFile, Snapshot, TableProperties, Table => IcebergTable}
import org.apache.spark.SparkConf
import org.apache.spark.sql.functions._
import org.apache.spark.sql.types.{StringType, StructField, StructType, TimestampType}
import org.apache.spark.sql.{DataFrame, Row, SparkSession}
import org.junit.runner.RunWith
import org.scalatest.BeforeAndAfterAll

feliperazeek

import org.apache.hadoop.conf.Configuration
import org.apache.iceberg.hadoop.HadoopFileIO
import org.apache.iceberg.spark.Spark3Util
import org.apache.iceberg.{DataFile, PartitionSpec, Schema, Snapshot, TableMetadata, TableMetadataParser, Table => IcebergTable}
import org.apache.spark.SparkConf
import org.apache.spark.sql.functions._
import org.apache.spark.sql.types.{StringType, StructField, StructType, TimestampType}
import org.apache.spark.sql.{DataFrame, Row, SparkSession}
import org.junit.runner.RunWith
import org.scalatest.BeforeAndAfterAll

feliperazeek

import turtle
import random
t = turtle.Turtle()
scorey = turtle.Turtle()
score = 0
t.goto(0,0)
scorey.penup()
scorey.goto(200,200)
t.setheading(90)
c = turtle.Turtle()

feliperazeek

{
  "type" : "record",
  "name" : "twitter_schema",
  "namespace" : "foo.bar",
  "fields" : [ {
    "name" : "username",
    "type" : "string",
    "doc" : "Name of the user account on Twitter.com"
  }, {
    "name" : "tweet",

feliperazeek

import java.util.BitSet

object Solution {
    def solution(A: Array[Int]): Int = {
        val bitz = new BitSet(A.size + 1)
        
        val good = A.foldLeft(true)((current, i) => 
            if (current) {
                (i, bitz.get(i)) match {
                    case (x, _) if x > A.size => 

feliperazeek

object Solution {
    def solution(A: Array[Int]): Int = {
        val positive = new java.util.BitSet()
        val negative = new java.util.BitSet()
        
        A.foldLeft(0) { (current, i) =>
            val duplicate = if (i < 0) (negative get i * -1)
            else (positive get i)
        
            duplicate match {

feliperazeek

object Solution {
    def solution(A: Array[Int]): Int = {
        val (results, _) = A.sorted.foldLeft((0, 0)) { (t, item) =>
            val (current, last) = t

            val next = last + 1
            item match {
                case x if x < 0 => (current, last)
                case `last` => (item, item)

feliperazeek

object Solution {
    def solution(A: Array[Int]): Int = {

        (A.foldLeft[(Int, Option[Double], Int)]((0, None, -1)) { (t, item) =>
          val (index, min, results) = t

          val checkPair = index <= A.size - 2
          val checkTrio = index <= A.size - 3

feliperazeek

import scala.math.{min, abs}

object Solution {
    def solution(A: Array[Int]): Int = {
      if (A.size < 2 || A.size > 100000) sys.error(s"Invalid input - array size: ${A.size}")

      val total = A.map(_.toLong).sum

      (A.foldLeft[(Int, Long, Long)](-1, -1, 0l) { (t, i) =>
        if (i < -1000 || i > 1000) sys.error(s"Invalid array element: $i")

feliperazeek

object Solution {

  def solution(A: Array[Int]): Int = {
    val bitz = new java.util.BitSet(A.size)

    val n = A.foldLeft(0) { (total, i) =>
      if (i > 0 && i <= A.size && !bitz.get(i)) {
        bitz.set(i)
        total + 1
      } else total