a binary tree with 10 nodes labelled a, b, c, d, e, f, g, h, i, j, with preorder traversal gbhecidajf and inorder traversal ehbicgjafd.
What is the left child of the root node?
how to construct binary tree from given preorder and inorder traversal
Source code GO !
Let's use augmented reality to hunt small creatures hidden in source-code.
Write a quine program that should output its own code source, except for 5 consecutive characters that will be modified and that will display a PCG-mon :
(^_^)
The 5 consecutive characters can be positio...
Validate the traversals
Given inorder and preorder traversals of a binary tree, return a truthy or falsy value depending on whether they could be from the same tree.
Input can be strings of characters or arrays of characters or numbers, whatever is the most convenient. You can assume both input...
I'm guessing the problem is that :global operates linewise, so the \zs and \ze in your regex don't do anything; They still apply to the line that matched the entire pattern, not the line that the selection starts and ends on. For example, if you have the following text:
foo
bar
and you do
:g/...
(inspired by this challenge over on Puzzling)
If a letter in a word occurs alphabetically later than the previous letter in the word, we call that a rise between the two letters. Otherwise, including if it's the same letter, it's called a fall.
For example, the word ACE has two rises (A to C an...
Decode the chmod
code-golf parsing
Challenge
Given a three digit octal permissions number, output the permissions that it grants.
chmod
On UNIX OSes file permissions are changed using the chmod command. There are few different ways of using chmod, but the one we will focus on today is using ...
0
Random numbers are very essential everywhere even in arts. which is exactly what this challenge is about. The rules are simple with the help of any programming language you have to create a completely randomized different image each colored according to a random pattern. The pattern must be rando...
