s= 'legos_rock'

def recursive(s, b, v):
    if len(s) > 0:
        recursive(s[1:], b + s[0], v)
        recursive(s[1:], b, v)
        v.append(b + s[0])
    return v

print(recursive(s, '', ['']))
Here's this week's question!

Given dimensions of a rectangle n and m, return the number of identical squares that can fit inside the rectangle.



For example:

squaresInRect(6,9)

> 6 // each of size 3x3

 

Cool things from around the internet
#VoiceFirst with Cassidy Williams (shameless plug)

Synth Sounds of "Africa" by Toto

95-Key Keyboard Prototype

3-D Printing Is The Future Of Factories (For Real This Time)​

 

Joke
I have an imaginary friend, but she keeps making fun of me. She keeps saying, "at least I have a real friend!"

 
That's all for this week, friends! Hope you have a great week. Be safe, make good choices, and always check your blind spot.



Also, thank you for your replies. They're wonderful, and I read every single one of them. And thanks again for being a part of this!



cassidoo

Meanwhile, these lovely folks tweeted theirs!

This week’s problem:

Given an unsorted integer array arr and an integer n, return a pair of numbers (from arr) whose product is closest to n.

Example:
closestProduct([5,3,8,2,7], 42);
> [5, 8]
 

• I'm mad it's not the last movie
• It could have used more Shuri
• It was a lot of context switching
• Marvel is a marketing genius

Interview question of the week

> fibtri(4)
>
1 
1 2 
3 5 8 
13 21 34 55

Cool things from around the internet

Chimera split keyboard
This Affordable Prefab in Spain Only Took 5 Hours to Assemble
MIT’s New Ink Can Make 3D Printed Objects Change Color
Droughts, storms and global demand tests America’s love affair with avocado​
 

function isRectangle(a, b, c, d) {
  if (a === b && a === c && a === d && c === d && b === c && b === d) 
    return true;
  else if (a === b && c === d)
    return true;
  else if (a === d && c === b)
    return true;
  else if (a === c && d === b)
    return true;
  else
    return false;
}

This week’s question:
Let’s say that you have a bunch of ropes of various lengths, and you want all of them to be the same length. You have to find the shortest one, and cut all of the ropes to be that length.
Given an int array of rope lengths, return a new array of how much each rope should be cut.

Example:
> ropeCuts([2,2,5,1,6])
> [1,1,4,0,5]
 

divisibleIntegers(n = 3, arr= [40, 50, 90])
> true // 945000 is divisible by 3

Cool things from around the internet

8 Bold Bathrooms That Don’t Back Away From Color
Bubblegum topre - BKE redux + kbdfans silencing rings
Oprah’s Golden Globes speech
 

• Got married
• Bought a house
• Released todometer
• Started this newsletter
• Spoke at Twilio Signal
• Spoke at DevRelCon Tokyo (visited Asia for the first time!)
• Spoke at the Grace Hopper conference
• Released my JavaScript and React Udemy course
• Got to around ~10k ranking in Go
• Had my first tweet with over 10k likes
• Learned how to solder
• Built a bunch of mechanical keyboards
• Played through Last Of Us, Zelda: Breath of the Wild, and a bunch of Stardew Valley
• Went outside on occasion (but for real, I think I hiked more this year than I have in my whole life)
• Started rock climbing
• Started to learn Korean (I can say blanket and sauna, what more do you need?)

Phew. What a year. I’m really proud of how much I worked on, and I’m hoping I can do even more fun things in 2018. Also, of course I’m looking forward to seeing what YOU build too. Tweet me if ever you want me to share something you’ve made, I’d love to spread the word!