Skip to main content
We’ve updated our Terms of Service. A new AI Addendum clarifies how Stack Overflow utilizes AI interactions.
Code Golf

Return to Answer

Commonmark migration
Source Link

ESMin, 16 chars / 20 bytes

[МƲ(ï⇔(f)≔=+$⸩,МƵï

#ESMin, 16 chars / 20 bytes [МƲ(ï⇔(f)≔=+$⸩,МƵï [Try it here (Firefox only).][1]Try it here (Firefox only).

Not bad, not bad... #Explanation This

Explanation

This outputs an array containing both the maximum and minimum. (ï⇔(f)≔=+$⸩, basically filters out all strings in the input, МƲ gets the maximum in the input, and МƵ gets the minimum.

Just a note: this is the first challenge where I get to use , which basically turns ï⇔ into ï=ï. [1]: http://molarmanful.github.io/ESMin/interpreter3.html?eval=true&input=[7%2C%208%2C%2010%2C%20%22Hello%22%2C%205%2C%205]&code=[%D0%9C%C6%B2%28%C3%AF%E2%87%94%E2%92%A1%E2%89%94%3D%2B%24%E2%B8%A9%2C%D0%9C%C6%B5%C3%AF

#ESMin, 16 chars / 20 bytes [МƲ(ï⇔(f)≔=+$⸩,МƵï [Try it here (Firefox only).][1]

Not bad, not bad... #Explanation This outputs an array containing both the maximum and minimum. (ï⇔(f)≔=+$⸩, basically filters out all strings in the input, МƲ gets the maximum in the input, and МƵ gets the minimum.

Just a note: this is the first challenge where I get to use , which basically turns ï⇔ into ï=ï. [1]: http://molarmanful.github.io/ESMin/interpreter3.html?eval=true&input=[7%2C%208%2C%2010%2C%20%22Hello%22%2C%205%2C%205]&code=[%D0%9C%C6%B2%28%C3%AF%E2%87%94%E2%92%A1%E2%89%94%3D%2B%24%E2%B8%A9%2C%D0%9C%C6%B5%C3%AF

ESMin, 16 chars / 20 bytes

[МƲ(ï⇔(f)≔=+$⸩,МƵï

Try it here (Firefox only).

Not bad, not bad...

Explanation

This outputs an array containing both the maximum and minimum. (ï⇔(f)≔=+$⸩, basically filters out all strings in the input, МƲ gets the maximum in the input, and МƵ gets the minimum.

Just a note: this is the first challenge where I get to use , which basically turns ï⇔ into ï=ï.

added 110 characters in body
Source Link
Mama Fun Roll
  • 10k
  • 1
  • 38
  • 47

#ESMin, 16 chars / 20 bytes [МƲ(ï⇔f!$ĝ¤⸩ï⇔(f)≔=+$⸩,МƵï [Try it here (Firefox only).][1]

Not bad, not bad... #Explanation This outputs an array containing both the maximum and minimum. ï⇔f!$ĝ¤⸩(ï⇔(f)≔=+$⸩, basically filters out all strings in the input, МƲ gets the maximum in the input, and МƵ gets the minimum.

Just a note: this is the first challenge where I get to use , which basically turns ï⇔ into ï=ï. [1]: http://molarmanful.github.io/ESMin/interpreter3.html?eval=true&input=[7%2C%208%2C%2010%2C%20%22Hello%22%2C%205%2C%205]&code=[%D0%9C%C6%B2%28%C3%AF%E2%87%94%E2%93%95!%24%C4%9D%C2%A4%E2%B8%A9%2C%D0%9C%C6%B5%C3%AF http://molarmanful.github.io/ESMin/interpreter3.html?eval=true&input=[7%2C%208%2C%2010%2C%20%22Hello%22%2C%205%2C%205]&code=[%D0%9C%C6%B2%28%C3%AF%E2%87%94%E2%92%A1%E2%89%94%3D%2B%24%E2%B8%A9%2C%D0%9C%C6%B5%C3%AF

#ESMin, 16 chars / 20 bytes [МƲ(ï⇔f!$ĝ¤⸩,МƵï [Try it here (Firefox only).][1]

Not bad, not bad... #Explanation This outputs an array containing both the maximum and minimum. ï⇔f!$ĝ¤⸩ basically filters out all strings in the input, МƲ gets the maximum in the input, and МƵ gets the minimum. [1]: http://molarmanful.github.io/ESMin/interpreter3.html?eval=true&input=[7%2C%208%2C%2010%2C%20%22Hello%22%2C%205%2C%205]&code=[%D0%9C%C6%B2%28%C3%AF%E2%87%94%E2%93%95!%24%C4%9D%C2%A4%E2%B8%A9%2C%D0%9C%C6%B5%C3%AF

#ESMin, 16 chars / 20 bytes [МƲ(ï⇔(f)≔=+$⸩,МƵï [Try it here (Firefox only).][1]

Not bad, not bad... #Explanation This outputs an array containing both the maximum and minimum. (ï⇔(f)≔=+$⸩, basically filters out all strings in the input, МƲ gets the maximum in the input, and МƵ gets the minimum.

Just a note: this is the first challenge where I get to use , which basically turns ï⇔ into ï=ï. [1]: http://molarmanful.github.io/ESMin/interpreter3.html?eval=true&input=[7%2C%208%2C%2010%2C%20%22Hello%22%2C%205%2C%205]&code=[%D0%9C%C6%B2%28%C3%AF%E2%87%94%E2%92%A1%E2%89%94%3D%2B%24%E2%B8%A9%2C%D0%9C%C6%B5%C3%AF

Source Link
Mama Fun Roll
  • 10k
  • 1
  • 38
  • 47

#ESMin, 16 chars / 20 bytes [МƲ(ï⇔f!$ĝ¤⸩,МƵï [Try it here (Firefox only).][1]

Not bad, not bad... #Explanation This outputs an array containing both the maximum and minimum. ï⇔f!$ĝ¤⸩ basically filters out all strings in the input, МƲ gets the maximum in the input, and МƵ gets the minimum. [1]: http://molarmanful.github.io/ESMin/interpreter3.html?eval=true&input=[7%2C%208%2C%2010%2C%20%22Hello%22%2C%205%2C%205]&code=[%D0%9C%C6%B2%28%C3%AF%E2%87%94%E2%93%95!%24%C4%9D%C2%A4%E2%B8%A9%2C%D0%9C%C6%B5%C3%AF

AltStyle によって変換されたページ (->オリジナル) /