« first day (3709 days earlier)      last day (1431 days later) » 

21:25
(: antifreeze :)
21:45
What in the actual heck did I just read.
And why do y'all have all the fun when I'm sleeping?!?
Why did you sleep when you could have had fun? :P
21:58
yeah easy solution just don't sleep :D
I've repcapped 4 of the 6 days this week (going by SE's definition of a week) :P
Hmm I'm sorry maybe I'm not good at awaking for extended times.
In the past 7 days, I've gotten 1326 total rep :P
@ChartZBelatedly Okay Dennis no need to flex on us peasants. :p
@Lyxal This is like the one and only time I've "regularly" repcapped, rather than on the odd day or so, sorry :P
22:03
how do you edit and chat at once?
Because my topbar looks like this:
I'm all-seeing :P
damn, i am gonna lookup what those extesions are...
The only one I really use is Tampermonkey :P
3 of them are bad dark theme scripts I've never gotten rid of, one of them changes "Donald Trump" to "Donald Drumpf" and one is a regex based searcher
XD, i was expecting must haves
22:23
yay it's a questionmation mark (‽)
critique plz
I mean aside from the obvious "what even is that take it away" and "too small" and "why are you putting this in TNB?"
Oh OK -- but this was pulled directly on a competitive programming site? Do you mean that people only pose problems to each other here, as opposed to discussing solutions? And thanks! EDIT: I read the welcome page, and I see now what is site is for. Sorry, and thanks! — Tanishq Kumar 4 mins ago
Are questions discussing solutions on-topic here? Should they be?
We allow questions that ask how to improve specific answers (typically code-golf, but I don't see why other OWC shouldn't be allowed to do the same), so clearly not all our questions are posing challenges
@ChartZBelatedly Questionmation mark is the politically correct way to say it
0
Q: Traversing a binary tree to get from one number to another using only two operations

Tanishq KumarI'm doing a competitive programming problem that says that we have to get from one number, $n$, to another, $m$, in as few steps as possible, where each "step" can be 1) doubling, or 2) subtracting one. The natural approach is two construct a binary tree and run BFS since we are given that $n, m$...

22:39
"Edit to improve the post’s appearance, clarity, or accuracy" If I've only changed the appearance does it really make sense to select submit for first posts review queue?
22:57
We did it! The example question in the tour has been closed!
(It happened three days ago but I wasn't paying attention)
Unfortunately it doesn't show up as closed in the tour, although that would be absolutely hilarious
3
23:15
@Wezl I dislike smooth because it's sticky
tfw you write three solutions, but they all have the same byte count
23:58
would the { in `hello ${variable}`, be consider a seperator?
By what definition of separator?
idk this is the explenation: Take out all separators in your code (()[]{}. ; to name some common ones),

« first day (3709 days earlier)      last day (1431 days later) »