@yetanothertroll
Nothing here yet.
Nothing here yet.
No blogs yet.
Austin Hey, you still alive? Is this an actual leetcode problem? If so, I can't find it. I'm mainly tackling the hard problems in C (the closest thing to BASIC they have lol) but I figured I'd convert the BASIC solutions I posted back in 2023 to C and actually submit them EDIT: Is it 387. First Unique Character in a String? Looks like it
Wow, you haven't posted in quite a while. They're not making you construct JavaScript snippets dynamically and quoting them through three or four layers of increasingly bloated and buggy "frameworks" until they're finally executed in the browser or more likely, not, with nary even an error code, are they? Did you end up running screaming to the hills with nothing but an 8-bit Atari emulator with BASIC, Action!, and Logo and a container with Concurrent Fortran?
Alessandro I'm more of a KISS Academy and School of Hard Knocks sort of guy. Free threading? Oh hell no. Give me a good DO CONCURRENT and I'm a happy camper lol "Pure" OO/OOP? Yeah, I think you know where I'm going with that. Functional programming is interesting, and it seems 1983 8-bit Atari Logo has a way of focusing the mind. There's little room for all the usual kitchen sink full of syntactic sugar in a 16KB ROM cartridge! Dijkstra probably would not have liked it, but needs must. Oh yes, the EWDs are a must read https://www.cs.utexas.edu/users/EWD/
Austin I'm running into some not-fun parts now. Constructing the NFA isn't hard, but after that I'm between a rock and a hard spot. Running the equivalent DFA on the (potentially very large) input string is fast, but if the NFA has n states, the DFA could have up to 2ⁿ. Oof. Or you could run the NFA directly, but it could be in all n states for each character in the input string. n*m vs 2ⁿ, eek!
Austin I'm running into some not-fun parts now. Constructing the NFA isn't hard, but after that I'm between a rock and a hard spot. Running the equivalent DFA on the (potentially very large) input string is fast, but if the NFA has n states, the DFA could have up to 2ⁿ. Oof. Or you could run the NFA directly, but it could be in all n states for each character in the input string. n*m vs 2ⁿ, ouch
You do proper maintenance on your rigs don't you? Then shouldn't you do proper maintenance on your self as well? About note taking, there's something about writing notes with dumb ink pen and dead-tree paper that makes things stick better. Even an active stylus and a paperwhite tablet just isn't quite the same. But then, I suppose we are still analog creatures after all. That doesn't mean you shouldn't scan your notes though!
Alessandro About that Grokking Algorithms book, big O doesn't tell you everything even when n gets fairly large. Take a look at the recent work on multiplication of large integers, for example. Sure, that spiffy new O(n log n) algo looks better than the old O(n¹.⁵⁸⁵) until you get to the "we are hopeful that with further refinements, the algorithm might become practical for numbers with merely billions or trillions of digits." 🤯
Austin C++ has too much abstraction to give you a good handle on the fundamentals. C gets you close enough to the bare silicon, and when the pointer bugs, memory leaks, and weird interactions between the "Safer C" library, the new "standard" string functions with "interesting" behavior, the new and equally exciting safeclib, and every library that expects the old clib behavior send you to the funny farm, to the happy home with trees and flowers and chirping birds and basket weavers who sit and smile and twiddle their thumbs and toes and they´re coming to take me away haha!, you're ready to appreciate Rust. Or BASIC.