Hello! Another day, another challenge. LET'S GO!
⏰ Come on over and catch up!
We're in the home stretch for this week, join us!
This week so far:
⭐ Array Week
This week our challenges all deal with Arrays! Their purpose is to store a collection of things under a single reference name, but the way they are set up and used in JavaScript is a little different from other programming languages. If you're coming from a different language, be sure to check out what's different! While working on our challenges, feel free to use JavaScript's built-in Array methods.
🏆 The Challenge - Day 5
This week we'll be working with arrays toward a final puzzling result on Friday when we combine our daily functions. Your solutions should be built to work within any given daily constraints.
Have you ever seen something at the store and thought to yourself, "I could make that myself"? If you have, then you may have noticed that sometimes just because we can do a thing ourselves, it might not be the best idea.
Sure, sometimes your Do It Yourself version is perfection and everything you could've dreamed of, but not always. Sometimes the item you could've bought cost less than the supplies you ended up buying to make it yourself, sometimes the store item had features you couldn't DIY or the quality was much better than what you ended up with. It's not uncommon.
If you've not had an opportunity to learn this life lesson yet, or if you haven't transferred that lesson over to your code yet, don't despair! You're about to learn.
Today your challenge is 2-parts: first, the DIY, and then the 'store-bought'.
- Please create a function that will take in an array like we've been working with all week (X-inner arrays of X-primitive values each) and shuffle it up in place. The inner primitive values can move to any of the inner arrays, but the length of those inner arrays must always remain X. Other than that, shuffle away! Do your best to have a thorough, random shuffle in a single call of your function.
For example:
myArray = [[1,2,3],[4,5,6],[7,8,9]]
// shuffle shuffle
=> [[8,3,5],[2,4,9],[6,7,1]]
Don't move on to part 2 until you've done part 1!
- You're probably feeling pretty good about your shuffle function and I'm betting it's amazing. How long did it take? Your second task today is to google how to shuffle a 2D array and read about why some approaches are better than others. Find a shuffle method that you like. How does it compare in speed, randomness, and thoroughness to yours?
My goal with this challenge is to hopefully show you that often finding a method or other code online is not only OK, but a time-saver and sometimes better than what you could've done yourself! If you walk away with that knowledge, I'm a happy camper.
See you tomorrow!
Wait, What's Huntober?
Leon Noel's 100Devs are spending October preparing for the job hunt. Anyone who has already broken into a tech career knows that the application and interview process can be grueling! The current cohort has progressed this year all the way from basic HTML files to hosted full-stack applications with authentication and databases.
This month they'll continue to build, but will also work on data structures & algorithms, networking and interview skills, and solving code challenges.