Update README

1 files changed, 6 insertions, 6 deletions

diff --git a/challenge-018/jaime/README b/challenge-018/jaime/README
index 9acbfee5ea..6dd7a66fdb 100644
--- a/challenge-018/jaime/README
+++ b/challenge-018/jaime/README
@@ -1,15 +1,15 @@
-Solution by Jaime Corchado, (@tortsnare)[https://twitter.com/tortsnare].
+(@tortsnare)[https://twitter.com/tortsnare]
 
 # Challenge #1
 
-Write a script to generate Van Eck’s sequence.
+Write a script that takes 2 or more strings as command line parameters and print the longest common substring. For example, the longest common substring of the strings “ABABC”, “BABCA” and “ABCBA” is string “ABC” of length 3. Other common substrings are “A”, “AB”, “B”, “BA”, “BC” and “C”. 
 
 # Challenge #2
 
-Using only the official postal (2-letter) abbreviations for the 50 U.S. states,
-write a script to find the longest English word you can spell.
+Write a script to implement Priority Queue. It is like regular queue except each element has a priority associated with it. In a priority queue, an element with high priority is served before an element with low priority. Please check this wiki page for more informations. It should serve the following operations:
 
-# Challenge #3
+1. is_empty: check whether the queue has no elements.
 
-Find the given city current time using the Geo DB Cities API.
+2. insert_with_priority: add an element to the queue with an associated priority.
 
+3. pull_highest_priority_element: remove the element from the queue that has the highest priority, and return it. If two elements have the same priority, then return element added first.