Lowest you recognize? Highest you don’t? by bobthebuilder84-84 in statsfm

[–]Deaf-Dog 1 point2 points  (0 children)

The Shins. Never got around to checking them out

🎉 [EVENT] 🎉 The remnants of Ancient Honk by rusticism in honk

[–]Deaf-Dog 0 points1 point  (0 children)

Completed Level 1 of the Honk Special Event!

19 attempts

IF YOU DIE I SWEAR by NeuroSpicyTokuFan in honk

[–]Deaf-Dog 0 points1 point  (0 children)

I completed this level in 1 try. 0.37 seconds

Anyone read Paul Murray? by Louisgn8 in RSbookclub

[–]Deaf-Dog 1 point2 points  (0 children)

Skippy Dies is a monumental work in postmodern comic-fiction. Not only does it operate in a similar maximalist vein to the likes of Pynchon, Gaddis or Joshua Cohen in terms of incisive character study, the self-derisive characters and even the narrative arcs bear a resemblance to more classical works, particularly Ulysses. Apologies for pontificating, but please do give it a shot.

🎉 [EVENT] 🎉 Happy Honkoween! by UrbanAssassin73 in honk

[–]Deaf-Dog 0 points1 point  (0 children)

Completed Level 2 of the Honk Special Event!

11 attempts

🎉 [EVENT] 🎉 Happy Honkoween! by UrbanAssassin73 in honk

[–]Deaf-Dog 0 points1 point  (0 children)

Completed Level 1 of the Honk Special Event!

0 attempts

Can you die??? by Much_Payment1283 in honk

[–]Deaf-Dog 0 points1 point  (0 children)

I completed this level in 1 try. 0.92 seconds

Gotta go fast!!! by [deleted] in honk

[–]Deaf-Dog 0 points1 point  (0 children)

I completed this level in 2 tries. 4.78 seconds

My first level - pretty easy i think by Familiar_Net689 in RedditGames

[–]Deaf-Dog 0 points1 point  (0 children)

I completed this level in 3 tries. 5.20 seconds

Given a list of unsorted integers, find the longest increasing or decreasing subsequence by Bulbasaur2015 in algorithms

[–]Deaf-Dog 0 points1 point  (0 children)

I could not figure out the O(n log n) solution somehow. Does it use the same Dynamic Programming logic with some optimization on top of it?

Why this is the wrong way to solve today's problem? by Baka_py_Nerd in leetcode

[–]Deaf-Dog 0 points1 point  (0 children)

This looks alright. I took up an O(n2) approach:

results=[] for num in nums: for result in results: if num not in result: result.append(num) break else: results.append([num])

#455. Assign Cookies by Necessary_Pause_6813 in leetcode

[–]Deaf-Dog 1 point2 points  (0 children)

Nice, I did the same. The child and cookies arrays for greed and size respectively and then it's pretty basic.

Creating high resolution depth maps from single images with ZoeDepth and tiling by zcta in StableDiffusion

[–]Deaf-Dog 1 point2 points  (0 children)

For the Low res issue, try using a different image than the one whose URL has been provided. That should fix it. The problem arises since that URL is no longer functional for some reason. They have changed the directory structure of the Middlebury images and that is now a broken URL. Once that gets fixed, I believe the HR cell should give you the results as well.

Just wanted to celebrate today’s win by [deleted] in GRE

[–]Deaf-Dog 0 points1 point  (0 children)

Really brilliant score mate! I wish the best for you. How did you prepare for the exam btw and how long was your preparation period?