Freestyle Sparring

{-# Language ViewPatterns #-}

module ClosestPoint (closestPoint) where

import Debug.Trace

import Preloaded (Point,dist)
import Data.List (minimumBy)

-- extracts from a list of points the closest to a given point
closestPoint :: Point -> [Point] -> Point
closestPoint _ [] = undefined
closestPoint point (traceShowId . trace "<hr>" -> ps) = minimumBy (\x y -> compare (dist point x) (dist point y)) ps

module Closest (closestPoint) where

type Point = (Float, Float)

-- calculates the ditance between two points
dist :: Point -> Point -> Float
dist (x1, x2) (y1, y2)
  = sqrt (dx * dx + dy * dy)
  where (dx, dy) = (y1 - x1, y2 - x2)

closestPoint :: Point -> [Point] -> Point
closestPoint point [] = point
closestPoint point (p : ps) = closest point (dist point p) p ps
  where
      closest :: Point ->  Float -> Point -> [Point] -> Point
      closest p0 initialDist p1 [] = p1
      closest p0 initialDist p1 (p2 : ps)
        | initialDist < dis = closest p0 initialDist p1 ps
        | otherwise         = closest p0 dis p2 ps
        where 
            dis = dist p0 p2

using System.Linq;

public static class Palindrome
{
  public static bool IsPalindrome(this string word)
  {
    // Normalize the input
    var upper = word.ToUpperInvariant();
    
    // For every chatacter in the first half..
    for (var i = 0; i < upper.Length / 2; ++i)
      // if the char doesn't match the one in the second half..
      if (upper[i] != upper[upper.Length - i - 1])
        // the word is not a palindrome
        return false;

    // The word is not a palindrome
    return true;
  }
}

import string
def remove(string):
    arr = list(string)
    test = ""
    for i in range (len(arr)):
        if arr[i].isupper() == True or arr[i] in ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9'] or arr[i] == " ":
            arr[i] = "`"
        else:
            continue
    for i in arr:
        test += i

    return(test.replace("`", ""))

    

var add1 = 0;
var add2 = 0;

var minus1 = 0;
var minus2 = 0;

var times1 = 0;
var times2 = 0;

var exponet1 = 0;
var exponet2 = 0;

var divide1 = 0;  //Division with decimal
var divide2 = 0;

var divide3 = 0; //Division with remainder
var divide4 = 0;

var y = 15;
console.log( add1  + add2 +" (Addition)");
var y = 35;
console.log( minus1 - minus2 +" (Subtraction)" ); 
var y = 55;
console.log( times1 * times2  +" (Multilplication)" ); 
var y = 75;
console.log( divide1 / divide2 +" (Division with decimal)" ); 
var y = 95;
console.log( Math.floor (divide3 / divide4) + " R" + divide3 % divide4 +" (Division with remainder)"); 
var y = 115;
console.log( Math.pow(exponet2, exponet1) + " (Exponent) ");

def prod(numbers):
    return numbers[0] * (prod(numbers[1:]) or 1) if len(numbers) else 0