Calm down, everyone. Brackets form a tree structure, and can be represented by a free magma, while strings with concatenation are equivalent to a free monoid. You’re essentially asking for the two respective common unipotent operations to be connected by this map, just because they’re unipotent, which put that way is a wild guess at best. In fact, reversing this string produces something outside the range of the map entirely, which is injective and so can’t be surjective for combinatoric reasons.
… Yeah I might be the only person that finds that useful.
It’s not complicated at all: en.m.wikipedia.org/wiki/Palindrome. Not really something that’s education-specific, in this instance (though I suppose it’s commonly used in entry-level programming classes since it’s a simple concept).
Yea but I’m just generally dumb in a pool of smart people. Not like I’m using palindromes in everyday conversation so when I see it I gotta look it up. Like when I saw a Fibonacci sequence and mentioned that it looks like something I’ve seen before but couldn’t remember where. This doesn’t even touch on why the syntax mentioned is a palindrome 😆
All it means is if you were to reverse the order of the characters, you’d get the same string you started with. So “dog” isn’t a palindrome because when you reverse it, you get “god”. “dog god” is a palindrome, though, because if you read it backwards, it’s also “dog god”.
They are only useful as nerd jokes, interesting math facts (with no real world application), and stupid leetcode algorithms (with no real world application).
Nearly everybody here knows about them because nearly everybody here is exposed to lots of instances of those 3 categories. You could be feeling out of the loop, but you shouldn’t at all get impostor syndrome from it.
Yes it does bother me a little that the letters in the latter half of my username can't be written backwards. (Well, some can, and the p can become a q, but then it's not a p any more.)