GithubHelp home page GithubHelp logo

js-stream's Introduction

Application - Serverless Camp ⚡

This repository will guide you through how to apply to the Bit Project Serverless Camp!

❓ Huh?

Here's a general overview of application into our serverless bootcamp.

  1. Complete this information form, so we can contact you if you get accepted :)
  2. Use this repository to complete the required coding portion!

🌟 General Tips

  • Each problem is formatted as an issue in GitHub.
  • Read each issue COMPLETELY
  • Create a new branch to write your code
  • Create a pull request to merge the branch you're working on onto main
  • Only merge the pull request when the bot approves your changes
  • If the bot says something went wrong, you can edit your code and commit again!

😀 How to use this repository

  1. Click the green button in the upper-right corner with the text Use this template
  2. Name your repository something interesting, such as bitprj-is-the-best
  3. Wait for about 20 seconds for the repository to be created
  4. Click into the Issues tab
  5. Click New issue
  6. Choose the 🚀 Start Course issue, and click Get started
  7. Click Submit new issue
  8. Click on the Issues tab again to refresh the page
  9. Click into the first issue, and get started :)

📖 Helpful Resources

js-stream's People

Contributors

colehorvat avatar counselorbot[bot] avatar

Watchers

 avatar

js-stream's Issues

Part 1: Sentence Analyzer - Letter Counter

Part 1: Sentence Analyzer - Letter Counter

  1. Create a new branch from main named letter.
  2. Create a function named letter_counter that takes in a sentence string as a parameter and returns how many letters there are in that entire sentence.
  3. Once the function is created, export it at the bottom of your file: exports.letter_counter = letter_counter (so we can test your code!)
  4. Commit your code to the letter branch.
  5. Create a pull request to merge the letter branch onto main, and only merge the pull request when the bot approves your changes.
    In the follow 3 steps, you will create a program that analyzes a sentence (how cool is that 😎)

❗ for this step, edit the letter_counter.js file

🔨 Function Specs:

Function name: letter_counter()

Create a function that takes in sentence as a parameter and returns how many letters there are in that entire sentence.

Punctuation (.,!#$%..etc) don't count as letters. Only alphanumeric characters count!

📝 Test your work:

⭐ if the sentence parameter is "Bit Project is the best!", the function should return 19

⭐ if the sentence parameter is "Good luck on your application", the function should return 25

Max Nums

Max Numbers 📈

  1. Create a new branch from main named max.
  2. Create a function find_max() that takes in an array as a parameter and returns the element with the maximum value in the array.
  3. Once the function is created, export it at the bottom of your file: exports.find_max = find_max (so we can test your code!)
  4. Commit your code to the max branch.
  5. Create a pull request to merge the max branch onto main, and only merge the pull request when the bot approves your changes.

❗ for this step, edit the max_nums.js file

🔨 Function Specs:

Function name: find_max()

Arguments:

  • arr - the array that is passed into the find_max function

Return:

  • the maximum element in the arr array

🧠 Resources:

📝 Test your work:

⭐ if the array passed in is [1, 78, 12, 2, 5, 10], the function should return 78
⭐ if the array passed in is [1, 2, 3, 3, -1], the function should return 3

💡 Make sure to put the line module.exports = find_max at the end of your file so we can test your code!

Part 3: Sentence Analyzer - Specific Letter Counter

Part 3: Sentence Analyzer - Specific Letter Counter

Oooh, this step is a little bit harder! Don't worry if you can't finish this step entirely, do the best you can :)

  1. Create a new branch from main named specific.
  2. Create a function named spec_letter_counter that takes in a sentence string as a parameter and returns a JSON object with the count of each letter.
  3. Once the function is created, export it at the bottom of your file: exports.spec_letter_counter = spec_letter_counter (so we can test your code!)
  4. Commit your code to the specific branch.
  5. Create a pull request to merge the specific branch onto main, and only merge the pull request when the bot approves your changes.

❗ for this step, edit the spec_letter_counter.js file

🔨 Function Specs:

Function name: spec_letter_counter()

Create a function that takes in sentence as a parameter and returns a JSON object with the count of each letter.

Punctuation does not count as letters.

Letters with no occurances in the sentence should NOT to be included in the JSON object.

Uppercase and lowercase are NOT the same character!

Example Output:

{
    "a": 12,
    "d": 1,
    "r": 2
}

📝 Test your work:

⭐ If the sentence paramter is "Ganning is cooll!!", the function should return { G: 1, a: 1, n: 3, i: 2, g: 1, s: 1, c: 1, o: 2, l: 2 }

⭐ If the sentence paramter is "I really like food", the function should return { I: 1, r: 1, e: 2, a: 1, l: 3, y: 1, i: 1, k: 1, f: 1, o: 2, d: 1 }

Start Course

Click the big green button that says Submit new issue, and you'll be good to go!

It is Late!

Running Late ⏰

  1. Create a new branch from main named late.
  2. Create a function running_late() in JavaScript that returns It is late! if the time is at or after 10:00 PM, and It is still early! if it is not.
  3. Once the function is created, export it at the bottom of your file: exports.running_late = running_late (so we can test your code!)
  4. Commit your code to the late branch.
  5. Create a pull request to merge the late branch onto main, and only merge the pull request when the bot approves your changes.

❗ for this step, edit the late.js file

🔨 Function Specs:

Function name: running_late()

Arguments:

  • date - a string that the new Date() is created from.

Do NOT use Date.now()

Return:

  • Either It is late! or It is still early!, depending on the time.

🧠 Resources:

📝 Test your work:

⭐ if the time is 8:00 AM, your function should return It is still early!
⭐ if the time is 11:30 PM, your function should return It is late!

💡 Make sure to put the line module.exports = running_late at the end of your file so we can test your code!

Application Completed :)

Congratulations!!

congrats gif

Next Steps:

  1. Paste the link to this repo into the application form (make sure this repo is public)
  2. You have finished the application to Bit Project's Serverless Camp. We will reach out to you if you are selected. Good luck!

Bubble Sort

Bubble Sort 💬

  1. Create a new branch from main named bubble.
  2. Create a function bubble_sort() that takes a paramter of arr, which is an array, and returns the sorted version of that array using bubble sort.
  3. Once the function is created, export it at the bottom of your file: exports.bubble_sort = bubble_sort (so we can test your code!)
  4. Commit your code to the bubble branch.
  5. Create a pull request to merge the bubble branch onto main, and only merge the pull request when the bot approves your changes.

❗ for this step, edit the bubble_sort.js file

🔨 Function Specs:

Arguments:

  • arr - the array that is passed into the bubble_sort function

Return:

  • an array that is sorted using bubble sort.

🧠 Resources:

📝 Test your work:

⭐ if the array passed in is [1, 78, 12, 2, 5, 10], the function should return [1, 2, 5, 10, 12, 78]
⭐ if the array passed in is [1, 2, 3, 3, -1], the function should return [-1, 1, 2, 3, 3]

💡 Make sure to put the line module.exports = bubble_sort at the end of your file so we can test your code!

Part 2: Sentence Analyzer - Word Counter

Part 2: Sentence Analyzer - Word Counter

  1. Create a new branch from main named word.
  2. Create a function named word_counter that takes in a sentence string as a parameter and returns how many words.
  3. Once the function is created, export it at the bottom of your file: exports.word_counter = word_counter (so we can test your code!)
  4. Commit your code to the word branch.
  5. Create a pull request to merge the word branch onto main, and only merge the pull request when the bot approves your changes.

❗ for this step, edit the word_counter.js file

🔨 Function Specs:

Function name: word_counter()

Create a function named word_counter that takes in sentence as a parameter and returns how many words.

Punctuation does not count as words.

📝 Test your work:

⭐ if the sentence parameter is "Bit Project is the best!", the function should return 5

⭐ if the sentence parameter is "Good luck on your application", the function should return 5

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.