Skip to content

Instantly share code, notes, and snippets.

Javis Sullivan trendsetter37

Block or report user

Report or block trendsetter37

Hide content and notifications from this user.

Learn more about blocking users

Contact Support about this user’s behavior.

Learn more about reporting abuse

Report abuse
View GitHub Profile
trendsetter37 / series-expansion.lisp
Created Oct 28, 2014
Evaluate e^x HackerRank Common Lisp implementation
View series-expansion.lisp
(read) ;; Throwing this away. Not needed
(defun read-list ()
"reading in list of number"
(let ((n (read *standard-input* nil)))
(if (null n)
(cons n (read-list)))))
(defun factorial! (number)
trendsetter37 / factor.lisp
Last active Aug 29, 2015
Computes the factorial of an integer
View factor.lisp
(defun factorial! (number)
"returns the factorial of the number given"
(loop for x from 1 upto number
for y = 1 then (* x y)
finally (return y)))
trendsetter37 / permute.lisp
Created Oct 28, 2014
Gives the permutations
View permute.lisp
;; Work in progress
(defun all-permutations (list &optional (a (length list)))
"Will give you all the permutations of the list specified"
;;(format t "The optional param is: ~d~%" a)
(cond ((null list) nil)
((null (cdr list)) (list list))
(t (loop for element in list
append (mapcar (lambda (x) (cons element x))
(all-permutations (remove element list) a))))))
trendsetter37 / GoT.lisp
Last active Aug 29, 2015
Game of Thrones Warmup I on hackerRanck
View GoT.lisp
(defparameter *letter-hash* (make-hash-table :size 100000))
(defvar even-length)
(defvar number-of-odds 0)
(defun string-to-list (&key word)
"Will set the even/odd param as well"
(setq even-length (evenp (length word)))
(loop for letter across word collect letter))
trendsetter37 /
Last active Aug 29, 2015
String permutations Hard challenge on CodeEval
import itertools
import sys
def sort_perm(perm_list):
''' This will sort the list of permutations in
your into a list of tuples/list'''
teh_list = sorted(perm_list)
for item in teh_list:
if (item == teh_list[len(teh_list) - 1]):
trendsetter37 / cut-the-sticks.lisp
Last active Aug 29, 2015
HackerRank challenge Cut The Sticks in Common Lisp
View cut-the-sticks.lisp
(defun space-split (string)
"works for integers only at this point"
(loop for start = 0 then (1+ finish) ;; increments start by the value of finish
for finish = (position #\Space string :start start) ;; gives position of the next space begins at start
collecting (parse-integer (subseq string start finish)) ;; gathers integers from string list
until (null finish))) ;; continue until finish is nil (runs off the end of the string)
(defun cut-sticks (sticks)
(do ((rest (sort sticks #'<)
(remove (car rest) rest)))
trendsetter37 / txtfile-input.clj
Created Oct 19, 2014
Read text files into Clojure REPL
View txtfile-input.clj
; This is to read files into repl for dev work
; You would replace println with your function
; That you would like to test on each line of
; the text file.
(defn do-stuff [file] ; file should be a string surrounded by double quotes
(with-open [rdr ( file)]
(doseq [line (remove empty? (line-seq rdr))]
(println line))))
trendsetter37 / delta_time.c
Created Oct 19, 2014
Codeeval Challenge Delta Time
View delta_time.c
/* */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX 1024
int time_difference(char* time1, char* time2);
void seconds_to_time(int seconds);
int main(int argc, char** argv)
trendsetter37 / cut-the-sticks.lisp
Last active Dec 13, 2016
Solution to HackerRank challenge Cut the sticks in Common Lisp
View cut-the-sticks.lisp
;; Enter your code here. Read input from STDIN. Print output to STDOUT
(defun space-split (string)
(loop for start = 0 then (1+ finish)
for finish = (position #\Space string :start start)
collecting (parse-integer (subseq string start finish))
until (null finish)))
(defun min-from-list (list &optional (default 1000))
(reduce #'min list :initial-value default))
trendsetter37 / halloween_party.clj
Created Oct 6, 2014
Halloween Party Solution in clojure
View halloween_party.clj
(defn determine_pieces [number]
(if (= (mod number 2) 0)
(* (/ number 2) (/ number 2))
(* (quot number 2) (+ (quot number 2) 1)))) ;quot is clojure's version of non-float division
(dotimes [i (Integer/parseInt (read-line))]
(let [input (Integer/parseInt (read-line))]
(println (determine_pieces input))))
You can’t perform that action at this time.