4clojure

#70

Write a function that splits a sentence up into a sorted list of words. Capitalization should not affect sort order and punctuation should be ignored.

(= (__ "Have a nice day.") ["a" "day" "Have" "nice"])
(= (__ "Clojure is a fun language!") ["a" "Clojure" "fun" "is" "language"])
(= (__ "Fools fall for foolish follies.") ["fall" "follies" "foolish" "Fools" "for"])


Congratulations, you've solved the problem! See the solutions that the users you follow have submitted, or share this solution on github and twitter! Now you can move on to Analyze a Tic-Tac-Toe Board, or go back and try Greatest Common Divisor again!


Code which fills in the blank:

(fn[sl] (map #(clojure.string/replace % #"\.|!" "") (sort-by clojure.string/upper-case (#(clojure.string/split % #" ") sl))))

#22

Write a function which returns the total number of elements in a sequence.
test not run

(= (__ '(1 2 3 3 1)) 5)

test not run

(= (__ "Hello World") 11)

test not run

(= (__ [[1 2] [3 4] [5 6]]) 3)

test not run

(= (__ '(13)) 1)

test not run

(= (__ '(:a :b :c)) 3)

Special Restrictions
count
Congratulations, you've solved the problem! See the solutions that the users you follow have submitted, or share this solution on github and twitter! Now try Find the odd numbers!


Code which fills in the blank:

#(alength (to-array (seq %)))

#25

Write a function which returns only the odd numbers from a sequence.
test not run

(= (__ #{1 2 3 4 5}) '(1 3 5))

test not run

(= (__ [4 2 1 6]) '(1))

test not run

(= (__ [2 2 4 6]) '())

test not run

(= (__ [1 1 1 3]) '(1 1 1 3))



Code which fills in the blank:


#(filter odd? (seq %))