Posts

Showing posts from February, 2022

The Summer 2022 internship search has concluded!

     I will be working for Adobe as a Research Scientist intern! They liked my combination of coding and art skills, and the project will involve a combination of both.       I can look forward to the summer now, knowing that I will be working for an amazing company and will be taken care of financially. Prayer works, promptings are real, all the good stuff. I've still got a lot of work to do. But I know I'll be fine money-wise, and Adobe is also one of my dream companies. I am exhausted, but I feel a calm sense of renewal as well, like it can be done. I hope to do incredibly well this summer and get a return offer. Even more, I hope to push my coding and animation skills to an even higher level, so I can get noticed by all sorts of top companies and have a greater spectrum of choice for what I do.      Here's the final spreadsheet. I might update with everything else as results from other companies. 73 applications, 18 rejections, 1 offer that I had to turn down (Universal

cool quote from film dailies today

 "The key to success and creativity is iteration."  - my professor  I iterate on Houdini, so why do I never iterate on my drawings or paintings? Hmm. I think iteration is a great thing. You kinda take an educated shot in the dark, get feedback, and keep writing; keep going. With writing too. 

Got an A- on my computational creativity midterm

...Which dropped me to an A- in the class. ENOUGH screwing around. I will NOT get another A- in the rest of my master's program. Or at least not in this class.  Honestly, all things considered, a 92% isn't bad. But I need to do better. I WILL do better. I will drag my entire group up with me lol. 

When the software bug gives you a heart attack

I was listening to ICP (from the Carnival of Carnage album) and for some reason, Musi randomly decided to switch tracks to "Sanctity Within Darkness" by Graveworm.  That song starts with a long, piercing shriek. Since I wasn't expecting it to start playing, I practically jumped out of my skin. :D

Friday song quote

And they act so proud when they ask out loud what we are proving Like they even know.  ~ I Hate This Place 

Fandoms that move too fast

Pokémon and Star Wars are the main ones. Keeping up alongside everything else seems almost impossible. This is why I'm struggling to restart my Pokémon fanfic. And don't get me started on the fact that I haven't even finished the Mandalorian yet. It's hard to set aside 45 minutes! But now there are even more shows to keep up with. 

3blue1brown pi creatures

Image
These things make me so happy lol I mean, just look at this one. It's so cute

Me.

Image

So OpenAI is being lame

Image
  Don't tell me how to live my life. >:-( >:-(

Song lyrics of the day

Follow me into the darkness Where the nightmares never fade Whisper dreams, my fallen angel From which you will never wake.  ~ Seraphim Shock 

Data structures I need to implement (I need to review 235 all the way through anyway)

Image
  I've forgotten almost all of these things. I took Data Structures in 2015, and I haven't really touched it since (haven't really needed to for classes). The exception is tries, which I know fairly well due to being a 240 TA, but even so I should still probably review.  I'm tired of losing out on opportunities for really great companies due to my lack of knowledge on these fairly trivial concepts. I got an A in Data Structures. I should know these things. It's just been so long.  First, I need to do one more pass of my 142 labs -- basically, just uploading them to private GitHub repos and writing a quick summary of each. I've already polished them a few winter breaks ago. Then, I'll dive into 235 and fixing those labs up. After that, I will implement every single one of these concepts and post them on GitHub. 236 will be its own beast, but I will not worry about that right now. Before I can even start comfortably Leetcoding, I need every single one of these

Daily Algorithm Practice: Cracking the Coding Interview, VI.12

Image
  Merge sort by itself is O(n log n) so O(b log b) in this case. How do I know? I looked it up. :P Specifically, there are log n levels of the tree, and for each level, the tree performs an O(n) operation.  more info That for loop is O(a * log(b)). Because it does the O(log(b)) binary search for every iteration, and it iterates O(a) times.  So O(b log b) + O(a log b). Neither of these terms can be dropped. Combined, we have O(b log b + a log b).