tomasmcm / evolved-seeker-1.3b

Source: TokenBender/evolvedSeeker_1_3 ✦ Quant: TheBloke/evolvedSeeker_1_3-AWQ ✦ A fine-tuned version of deepseek-ai/deepseek-coder-1.3b-base on 50k instructions for 3 epochs

  • Public
  • 29 runs
  • T4
  • Paper
  • License
  • Prediction

    tomasmcm/evolved-seeker-1.3b:04492f3607a921344a8173a727224dc1ea22518ea9d40b8231296afe29fb972a
    ID
    rsmp4xrb26d4qtrzj2qkysxx3q
    Status
    Succeeded
    Source
    Web
    Hardware
    T4
    Total duration
    Created

    Input

    stop
    <|im_end|>
    top_k
    40
    top_p
    0.95
    prompt
    <|im_start|>system You are a helpful coding assistant.<|im_end|> <|im_start|>user write a javascript program to reverse letters in each word in a sentence without reversing order of words in the sentence.<|im_end|> <|im_start|>assistant
    max_tokens
    512
    temperature
    0.7
    presence_penalty
    0
    frequency_penalty
    0

    Output

    Here is a simple JavaScript program that achieves this: ```javascript function reverseWordsInSentence(sentence) { return sentence.split(' ').map(word => word.split('').reverse().join('')).join(' '); } console.log(reverseWordsInSentence("Hello world")); // Outputs: "olleH dlrow" ``` This function works by first splitting the sentence into an array of words. Then, for each word, it splits the word into an array of characters, reverses that array, then joins it back together into a word. Finally, it joins all the words back together into a sentence.
    Generated in

Want to make some of these yourself?

Run this model