$begingroup$
Link: https://www.hackerrank.com/contests/hackerrank-all-womens-codesprint-2019/challenges/name-the-product/
Problem
You are contesting to name a new product in your company given the following conditions:
You are given an array of $n$ different names, $names$, where $names_i$ denotes the $i^{th}$ name and all the names are of length $5$. The distance between any two names is the number of positions in which the characters in these names differ. For example, "bubby" and "bunny" differ in two positions.
You have to choose a name such that the sum of differences of all names in $names$ with the chosen name is maximal. In order to win the contest, give the new product this chosen name.
Note: If there are many such names chose the lexicographically largest one.
Take for example, names = ["bubby", "bunny", "berry"], with length $n = 3$. Then, the name that you should choose is "zzzzz" as this name has no common character with any name in the names list and is also lexicographically the largest.
Function Description
Complete the productName function in the editor below. It should return the lexigraphically largest string of length whose sum of differences with all the names is maximal.
productName has the following parameter(s):
names: array of $n$ names
Input Format
- The first line contains an integer, $n$, denoting the number of elements in $names$.
- Each line $i$ of the $n$ subsequent lines (where $0 le i le n$) contains a string describing $names_i$.
Constraints
- $1 le n le 10^5$
- All characters in the names are lowercase English alphabets.
- Each name is of length $5$.
Output Format
- The output should contain the lexigraphically largest string of length whose sum of differences with all the names is maximal.
Sample Input 0
3
bubby
bunny
berry
Sample Output 0
zzzzz
Explanation 0
- Difference between $names_0$, bubby, and zzzzz is $5$.
- Difference between $names_1$, bunny, and zzzzz is $5$.
- Difference between $names_2$, berry, and zzzzz is $5$.
So, total difference is 15, which is maximal.
Sample Input 1
3
ready
stedy
zebra
Sample Output 1
yzzzz
Explanation 1
- Difference between $names_0$, ready, and yzzzz is $5$.
- Difference between $names_1$, stedy, and yzzzz is $5$.
- Difference between $names_2$, zebra, and yzzzz is $5$.
So, total differce is 15, which is maximal.
I would strip the extraneous parts from my solution:
import math, os, random, re, sys
from collections import defaultdict as dd, Counter as count
alphabet = "abcdefghijklmnopqrstuvwxyz"
def productName(names):
charmap = [dd(lambda: 0, count(name[i] for name in names)) for i in range(5)]
return "".join(max(alphabet, key=lambda x: (-charmap[i][x], x)) for i in range(5))
I'm concerned with adhering to best practices and maximising performance.
python performance beginner programming-challenge
$endgroup$
add a comment |
$begingroup$
Link: https://www.hackerrank.com/contests/hackerrank-all-womens-codesprint-2019/challenges/name-the-product/
Problem
You are contesting to name a new product in your company given the following conditions:
You are given an array of $n$ different names, $names$, where $names_i$ denotes the $i^{th}$ name and all the names are of length $5$. The distance between any two names is the number of positions in which the characters in these names differ. For example, "bubby" and "bunny" differ in two positions.
You have to choose a name such that the sum of differences of all names in $names$ with the chosen name is maximal. In order to win the contest, give the new product this chosen name.
Note: If there are many such names chose the lexicographically largest one.
Take for example, names = ["bubby", "bunny", "berry"], with length $n = 3$. Then, the name that you should choose is "zzzzz" as this name has no common character with any name in the names list and is also lexicographically the largest.
Function Description
Complete the productName function in the editor below. It should return the lexigraphically largest string of length whose sum of differences with all the names is maximal.
productName has the following parameter(s):
names: array of $n$ names
Input Format
- The first line contains an integer, $n$, denoting the number of elements in $names$.
- Each line $i$ of the $n$ subsequent lines (where $0 le i le n$) contains a string describing $names_i$.
Constraints
- $1 le n le 10^5$
- All characters in the names are lowercase English alphabets.
- Each name is of length $5$.
Output Format
- The output should contain the lexigraphically largest string of length whose sum of differences with all the names is maximal.
Sample Input 0
3
bubby
bunny
berry
Sample Output 0
zzzzz
Explanation 0
- Difference between $names_0$, bubby, and zzzzz is $5$.
- Difference between $names_1$, bunny, and zzzzz is $5$.
- Difference between $names_2$, berry, and zzzzz is $5$.
So, total difference is 15, which is maximal.
Sample Input 1
3
ready
stedy
zebra
Sample Output 1
yzzzz
Explanation 1
- Difference between $names_0$, ready, and yzzzz is $5$.
- Difference between $names_1$, stedy, and yzzzz is $5$.
- Difference between $names_2$, zebra, and yzzzz is $5$.
So, total differce is 15, which is maximal.
I would strip the extraneous parts from my solution:
import math, os, random, re, sys
from collections import defaultdict as dd, Counter as count
alphabet = "abcdefghijklmnopqrstuvwxyz"
def productName(names):
charmap = [dd(lambda: 0, count(name[i] for name in names)) for i in range(5)]
return "".join(max(alphabet, key=lambda x: (-charmap[i][x], x)) for i in range(5))
I'm concerned with adhering to best practices and maximising performance.
python performance beginner programming-challenge
$endgroup$
$begingroup$
Meta comment, writing up the question took me much more time than actually solving the question due to the copious amounts of formatting involved. I would likely submit more questions from this particular codesprint, would leaving out the problem description and merely dropping the link be acceptable?
$endgroup$
– Tobi Alafin
2 hours ago
3
$begingroup$
Absolutely not.
$endgroup$
– Mast
2 hours ago
$begingroup$
See Can I include problem statements when posting exercise solutions to Code Review?. In short, a link alone is not sufficient (the question must be complete in itself), but you may need to write the requirements in your own words - unless you have specific permission to copy and republish.
$endgroup$
– Toby Speight
2 hours ago
$begingroup$
I think online programming challenges are by default public domain?
$endgroup$
– Tobi Alafin
2 hours ago
$begingroup$
I'd have thought that unlikely - you'll need to check with the specific site whether its license allows re-use of the challenge text here. Remember that Stack Exchange requires you to license your post using CC By-SA 3.0 with Attribution Required - if that contradicts your other obligations, then your question is at risk of being deleted.
$endgroup$
– Toby Speight
1 hour ago
add a comment |
$begingroup$
Link: https://www.hackerrank.com/contests/hackerrank-all-womens-codesprint-2019/challenges/name-the-product/
Problem
You are contesting to name a new product in your company given the following conditions:
You are given an array of $n$ different names, $names$, where $names_i$ denotes the $i^{th}$ name and all the names are of length $5$. The distance between any two names is the number of positions in which the characters in these names differ. For example, "bubby" and "bunny" differ in two positions.
You have to choose a name such that the sum of differences of all names in $names$ with the chosen name is maximal. In order to win the contest, give the new product this chosen name.
Note: If there are many such names chose the lexicographically largest one.
Take for example, names = ["bubby", "bunny", "berry"], with length $n = 3$. Then, the name that you should choose is "zzzzz" as this name has no common character with any name in the names list and is also lexicographically the largest.
Function Description
Complete the productName function in the editor below. It should return the lexigraphically largest string of length whose sum of differences with all the names is maximal.
productName has the following parameter(s):
names: array of $n$ names
Input Format
- The first line contains an integer, $n$, denoting the number of elements in $names$.
- Each line $i$ of the $n$ subsequent lines (where $0 le i le n$) contains a string describing $names_i$.
Constraints
- $1 le n le 10^5$
- All characters in the names are lowercase English alphabets.
- Each name is of length $5$.
Output Format
- The output should contain the lexigraphically largest string of length whose sum of differences with all the names is maximal.
Sample Input 0
3
bubby
bunny
berry
Sample Output 0
zzzzz
Explanation 0
- Difference between $names_0$, bubby, and zzzzz is $5$.
- Difference between $names_1$, bunny, and zzzzz is $5$.
- Difference between $names_2$, berry, and zzzzz is $5$.
So, total difference is 15, which is maximal.
Sample Input 1
3
ready
stedy
zebra
Sample Output 1
yzzzz
Explanation 1
- Difference between $names_0$, ready, and yzzzz is $5$.
- Difference between $names_1$, stedy, and yzzzz is $5$.
- Difference between $names_2$, zebra, and yzzzz is $5$.
So, total differce is 15, which is maximal.
I would strip the extraneous parts from my solution:
import math, os, random, re, sys
from collections import defaultdict as dd, Counter as count
alphabet = "abcdefghijklmnopqrstuvwxyz"
def productName(names):
charmap = [dd(lambda: 0, count(name[i] for name in names)) for i in range(5)]
return "".join(max(alphabet, key=lambda x: (-charmap[i][x], x)) for i in range(5))
I'm concerned with adhering to best practices and maximising performance.
python performance beginner programming-challenge
$endgroup$
Link: https://www.hackerrank.com/contests/hackerrank-all-womens-codesprint-2019/challenges/name-the-product/
Problem
You are contesting to name a new product in your company given the following conditions:
You are given an array of $n$ different names, $names$, where $names_i$ denotes the $i^{th}$ name and all the names are of length $5$. The distance between any two names is the number of positions in which the characters in these names differ. For example, "bubby" and "bunny" differ in two positions.
You have to choose a name such that the sum of differences of all names in $names$ with the chosen name is maximal. In order to win the contest, give the new product this chosen name.
Note: If there are many such names chose the lexicographically largest one.
Take for example, names = ["bubby", "bunny", "berry"], with length $n = 3$. Then, the name that you should choose is "zzzzz" as this name has no common character with any name in the names list and is also lexicographically the largest.
Function Description
Complete the productName function in the editor below. It should return the lexigraphically largest string of length whose sum of differences with all the names is maximal.
productName has the following parameter(s):
names: array of $n$ names
Input Format
- The first line contains an integer, $n$, denoting the number of elements in $names$.
- Each line $i$ of the $n$ subsequent lines (where $0 le i le n$) contains a string describing $names_i$.
Constraints
- $1 le n le 10^5$
- All characters in the names are lowercase English alphabets.
- Each name is of length $5$.
Output Format
- The output should contain the lexigraphically largest string of length whose sum of differences with all the names is maximal.
Sample Input 0
3
bubby
bunny
berry
Sample Output 0
zzzzz
Explanation 0
- Difference between $names_0$, bubby, and zzzzz is $5$.
- Difference between $names_1$, bunny, and zzzzz is $5$.
- Difference between $names_2$, berry, and zzzzz is $5$.
So, total difference is 15, which is maximal.
Sample Input 1
3
ready
stedy
zebra
Sample Output 1
yzzzz
Explanation 1
- Difference between $names_0$, ready, and yzzzz is $5$.
- Difference between $names_1$, stedy, and yzzzz is $5$.
- Difference between $names_2$, zebra, and yzzzz is $5$.
So, total differce is 15, which is maximal.
I would strip the extraneous parts from my solution:
import math, os, random, re, sys
from collections import defaultdict as dd, Counter as count
alphabet = "abcdefghijklmnopqrstuvwxyz"
def productName(names):
charmap = [dd(lambda: 0, count(name[i] for name in names)) for i in range(5)]
return "".join(max(alphabet, key=lambda x: (-charmap[i][x], x)) for i in range(5))
I'm concerned with adhering to best practices and maximising performance.
python performance beginner programming-challenge
python performance beginner programming-challenge
asked 2 hours ago


Tobi AlafinTobi Alafin
60419
60419
$begingroup$
Meta comment, writing up the question took me much more time than actually solving the question due to the copious amounts of formatting involved. I would likely submit more questions from this particular codesprint, would leaving out the problem description and merely dropping the link be acceptable?
$endgroup$
– Tobi Alafin
2 hours ago
3
$begingroup$
Absolutely not.
$endgroup$
– Mast
2 hours ago
$begingroup$
See Can I include problem statements when posting exercise solutions to Code Review?. In short, a link alone is not sufficient (the question must be complete in itself), but you may need to write the requirements in your own words - unless you have specific permission to copy and republish.
$endgroup$
– Toby Speight
2 hours ago
$begingroup$
I think online programming challenges are by default public domain?
$endgroup$
– Tobi Alafin
2 hours ago
$begingroup$
I'd have thought that unlikely - you'll need to check with the specific site whether its license allows re-use of the challenge text here. Remember that Stack Exchange requires you to license your post using CC By-SA 3.0 with Attribution Required - if that contradicts your other obligations, then your question is at risk of being deleted.
$endgroup$
– Toby Speight
1 hour ago
add a comment |
$begingroup$
Meta comment, writing up the question took me much more time than actually solving the question due to the copious amounts of formatting involved. I would likely submit more questions from this particular codesprint, would leaving out the problem description and merely dropping the link be acceptable?
$endgroup$
– Tobi Alafin
2 hours ago
3
$begingroup$
Absolutely not.
$endgroup$
– Mast
2 hours ago
$begingroup$
See Can I include problem statements when posting exercise solutions to Code Review?. In short, a link alone is not sufficient (the question must be complete in itself), but you may need to write the requirements in your own words - unless you have specific permission to copy and republish.
$endgroup$
– Toby Speight
2 hours ago
$begingroup$
I think online programming challenges are by default public domain?
$endgroup$
– Tobi Alafin
2 hours ago
$begingroup$
I'd have thought that unlikely - you'll need to check with the specific site whether its license allows re-use of the challenge text here. Remember that Stack Exchange requires you to license your post using CC By-SA 3.0 with Attribution Required - if that contradicts your other obligations, then your question is at risk of being deleted.
$endgroup$
– Toby Speight
1 hour ago
$begingroup$
Meta comment, writing up the question took me much more time than actually solving the question due to the copious amounts of formatting involved. I would likely submit more questions from this particular codesprint, would leaving out the problem description and merely dropping the link be acceptable?
$endgroup$
– Tobi Alafin
2 hours ago
$begingroup$
Meta comment, writing up the question took me much more time than actually solving the question due to the copious amounts of formatting involved. I would likely submit more questions from this particular codesprint, would leaving out the problem description and merely dropping the link be acceptable?
$endgroup$
– Tobi Alafin
2 hours ago
3
3
$begingroup$
Absolutely not.
$endgroup$
– Mast
2 hours ago
$begingroup$
Absolutely not.
$endgroup$
– Mast
2 hours ago
$begingroup$
See Can I include problem statements when posting exercise solutions to Code Review?. In short, a link alone is not sufficient (the question must be complete in itself), but you may need to write the requirements in your own words - unless you have specific permission to copy and republish.
$endgroup$
– Toby Speight
2 hours ago
$begingroup$
See Can I include problem statements when posting exercise solutions to Code Review?. In short, a link alone is not sufficient (the question must be complete in itself), but you may need to write the requirements in your own words - unless you have specific permission to copy and republish.
$endgroup$
– Toby Speight
2 hours ago
$begingroup$
I think online programming challenges are by default public domain?
$endgroup$
– Tobi Alafin
2 hours ago
$begingroup$
I think online programming challenges are by default public domain?
$endgroup$
– Tobi Alafin
2 hours ago
$begingroup$
I'd have thought that unlikely - you'll need to check with the specific site whether its license allows re-use of the challenge text here. Remember that Stack Exchange requires you to license your post using CC By-SA 3.0 with Attribution Required - if that contradicts your other obligations, then your question is at risk of being deleted.
$endgroup$
– Toby Speight
1 hour ago
$begingroup$
I'd have thought that unlikely - you'll need to check with the specific site whether its license allows re-use of the challenge text here. Remember that Stack Exchange requires you to license your post using CC By-SA 3.0 with Attribution Required - if that contradicts your other obligations, then your question is at risk of being deleted.
$endgroup$
– Toby Speight
1 hour ago
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Imports
import math, os, random, re, sys
from collections import defaultdict as dd, Counter as count
Seriously, don't do this. It may be useful to read PEP8 regarding imports again.
- Imports should be on separate lines.
Why do
Counter as count
? It impairs readability.Especially in larger scripts, every Python dev knows
Counter
, butcount
could be a random variable and is easy to be overshadowed.You don't use all of the imported modules; just remove them if you don't need them.
alphabet = "abcdefghijklmnopqrstuvwxyz"
Here you missed something that is in the standard lib:
from string import ascii_lowercase
Misc
This
dd(lambda: 0, ...
adds no valueCounter is already a dictionary with
default value 0
just remove that partMagic numbers
5
is a Magic number, you should define it as a CONSTANT:NAME_LENGTH = 5
The rest looks good!
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f215662%2fhackerrank-all-womens-codesprint-2019-name-the-product%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Imports
import math, os, random, re, sys
from collections import defaultdict as dd, Counter as count
Seriously, don't do this. It may be useful to read PEP8 regarding imports again.
- Imports should be on separate lines.
Why do
Counter as count
? It impairs readability.Especially in larger scripts, every Python dev knows
Counter
, butcount
could be a random variable and is easy to be overshadowed.You don't use all of the imported modules; just remove them if you don't need them.
alphabet = "abcdefghijklmnopqrstuvwxyz"
Here you missed something that is in the standard lib:
from string import ascii_lowercase
Misc
This
dd(lambda: 0, ...
adds no valueCounter is already a dictionary with
default value 0
just remove that partMagic numbers
5
is a Magic number, you should define it as a CONSTANT:NAME_LENGTH = 5
The rest looks good!
$endgroup$
add a comment |
$begingroup$
Imports
import math, os, random, re, sys
from collections import defaultdict as dd, Counter as count
Seriously, don't do this. It may be useful to read PEP8 regarding imports again.
- Imports should be on separate lines.
Why do
Counter as count
? It impairs readability.Especially in larger scripts, every Python dev knows
Counter
, butcount
could be a random variable and is easy to be overshadowed.You don't use all of the imported modules; just remove them if you don't need them.
alphabet = "abcdefghijklmnopqrstuvwxyz"
Here you missed something that is in the standard lib:
from string import ascii_lowercase
Misc
This
dd(lambda: 0, ...
adds no valueCounter is already a dictionary with
default value 0
just remove that partMagic numbers
5
is a Magic number, you should define it as a CONSTANT:NAME_LENGTH = 5
The rest looks good!
$endgroup$
add a comment |
$begingroup$
Imports
import math, os, random, re, sys
from collections import defaultdict as dd, Counter as count
Seriously, don't do this. It may be useful to read PEP8 regarding imports again.
- Imports should be on separate lines.
Why do
Counter as count
? It impairs readability.Especially in larger scripts, every Python dev knows
Counter
, butcount
could be a random variable and is easy to be overshadowed.You don't use all of the imported modules; just remove them if you don't need them.
alphabet = "abcdefghijklmnopqrstuvwxyz"
Here you missed something that is in the standard lib:
from string import ascii_lowercase
Misc
This
dd(lambda: 0, ...
adds no valueCounter is already a dictionary with
default value 0
just remove that partMagic numbers
5
is a Magic number, you should define it as a CONSTANT:NAME_LENGTH = 5
The rest looks good!
$endgroup$
Imports
import math, os, random, re, sys
from collections import defaultdict as dd, Counter as count
Seriously, don't do this. It may be useful to read PEP8 regarding imports again.
- Imports should be on separate lines.
Why do
Counter as count
? It impairs readability.Especially in larger scripts, every Python dev knows
Counter
, butcount
could be a random variable and is easy to be overshadowed.You don't use all of the imported modules; just remove them if you don't need them.
alphabet = "abcdefghijklmnopqrstuvwxyz"
Here you missed something that is in the standard lib:
from string import ascii_lowercase
Misc
This
dd(lambda: 0, ...
adds no valueCounter is already a dictionary with
default value 0
just remove that partMagic numbers
5
is a Magic number, you should define it as a CONSTANT:NAME_LENGTH = 5
The rest looks good!
edited 52 mins ago


Toby Speight
26.4k742118
26.4k742118
answered 1 hour ago


LudisposedLudisposed
8,71422166
8,71422166
add a comment |
add a comment |
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f215662%2fhackerrank-all-womens-codesprint-2019-name-the-product%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
Meta comment, writing up the question took me much more time than actually solving the question due to the copious amounts of formatting involved. I would likely submit more questions from this particular codesprint, would leaving out the problem description and merely dropping the link be acceptable?
$endgroup$
– Tobi Alafin
2 hours ago
3
$begingroup$
Absolutely not.
$endgroup$
– Mast
2 hours ago
$begingroup$
See Can I include problem statements when posting exercise solutions to Code Review?. In short, a link alone is not sufficient (the question must be complete in itself), but you may need to write the requirements in your own words - unless you have specific permission to copy and republish.
$endgroup$
– Toby Speight
2 hours ago
$begingroup$
I think online programming challenges are by default public domain?
$endgroup$
– Tobi Alafin
2 hours ago
$begingroup$
I'd have thought that unlikely - you'll need to check with the specific site whether its license allows re-use of the challenge text here. Remember that Stack Exchange requires you to license your post using CC By-SA 3.0 with Attribution Required - if that contradicts your other obligations, then your question is at risk of being deleted.
$endgroup$
– Toby Speight
1 hour ago