Iteratively checking array of array of stringsReview my prime factorization function. Is it complete?Python Port Scanner 2.0Typeahead Talent BuddyPython Octree ImplementationFlatten a nested dict structure in PythonYear 0: Instruction FollowerBytecode Interpreter for a custom programming languageFirstDuplicate FinderSystemd service configuration helper scriptDecomposing a matrix as a sum of two bitstrings
Explaining pyrokinesis powers
Instead of a Universal Basic Income program, why not implement a "Universal Basic Needs" program?
Why do passenger jet manufacturers design their planes with stall prevention systems?
A diagram about partial derivatives of f(x,y)
What's the meaning of a knight fighting a snail in medieval book illustrations?
How to make healing in an exploration game interesting
Could the Saturn V actually have launched astronauts around Venus?
Recruiter wants very extensive technical details about all of my previous work
Do I need life insurance if I can cover my own funeral costs?
What did “the good wine” (τὸν καλὸν οἶνον) mean in John 2:10?
When to use a slotted vs. solid turner?
Bach's Toccata and Fugue in D minor breaks the "no parallel octaves" rule?
Is it normal that my co-workers at a fitness company criticize my food choices?
Examples of transfinite towers
Min function accepting varying number of arguments in C++17
Happy pi day, everyone!
Book: Young man exiled to a penal colony, helps to lead revolution
ERC721: How to get the owned tokens of an address
Is it true that good novels will automatically sell themselves on Amazon (and so on) and there is no need for one to waste time promoting?
Math equation in non italic font
What is a ^ b and (a & b) << 1?
Different outputs for `w`, `who`, `whoami` and `id`
Is there a symmetric-key algorithm which we can use for creating a signature?
How to get the n-th line after a grepped one?
Iteratively checking array of array of strings
Review my prime factorization function. Is it complete?Python Port Scanner 2.0Typeahead Talent BuddyPython Octree ImplementationFlatten a nested dict structure in PythonYear 0: Instruction FollowerBytecode Interpreter for a custom programming languageFirstDuplicate FinderSystemd service configuration helper scriptDecomposing a matrix as a sum of two bitstrings
$begingroup$
The goal is to reduce the run-time of the operation, the function is working as intended but I'm struggling to make it more efficient larger inputs
You are given 2 arguments:
possible_criminals = [['9AheT-12=', 'Daniel', 'Lenny', '3512-6910',
'134.0', 'USD', 'M53'],
['zOvfqFxTWqQ=', 'Sylar', 'Seil', '1081-6760', '331.0', 'GBP', 'A46047']]
personal_information = [['Tzhq+56p=', 'Daniel', 'Lenny', '134.0',
'USD','M53', '37'],
['qWNmZankudw=', 'Sylar', 'Seil', '331.0', 'GBP', 'A46047', '676']]
Return an output (as an array of strings) that checks the arguments against each other in the
following format:
scanner(possible_criminals, personal_information) =
[['9AheT-12=', 'Tzhq+56p=', 'criminal'], ['zOvfqFxTWqQ=', 'qWNmZankudw=',
'criminal']]
def scanner(possible_criminals , personal_information)
'''
this problem can be simplified by understanding that the output
contains an array of 3 values
1) index[0] from argument 1
2) index[0] from argument 2
3) a value calculated by our function db_checker
steps to solve the problem:
- creating value 1) and 2) in output by extracting index 0 from given
arguments(possible_criminals , personal_information)
- "prepare" the arguments(possible_criminals , personal_information) for comparison
by sanitizing them:
- run "".lower() to account for case-insensitive matches
- pop unnecessary values
- calculating whether the arguments match by using a function
that compares possible_criminals with their personal_information
- function checks how many matches are there
'''
def db_checker(A, B):
counter = 0
for x in A:
if B.count(x) == 0:
counter += 1
if counter == 0:
return "criminal"
elif counter == 1:
return "possible"
elif counter == 2:
return "unlikely"
else:
return "none"
def init_output(N, M):
outputs = []
for i in range(len(N)):
output = []
output += [N[i].pop(0)] + [M[i].pop(0)]
outputs.append(output)
N[i].pop(2) # remove undesired values
M[i].pop(-1)
N[i] = [y.lower() for y in N[i]]
M[i] = [k.lower() for k in M[i]]
return outputs, N, M
# driver program
final = init_output(possible_criminals , personal_information )
for i in range(len(final[1])):
final[0][i].append(confidence_calculator(final[1][i], final[2][i]))
return final[0]
assert scanner(possible_criminals , personal_information) ==
[['9AheT-12=', 'Tzhq+56p=', 'criminal'], ['zOvfqFxTWqQ=', 'qWNmZankudw=', 'criminal']]
python formatting
$endgroup$
add a comment |
$begingroup$
The goal is to reduce the run-time of the operation, the function is working as intended but I'm struggling to make it more efficient larger inputs
You are given 2 arguments:
possible_criminals = [['9AheT-12=', 'Daniel', 'Lenny', '3512-6910',
'134.0', 'USD', 'M53'],
['zOvfqFxTWqQ=', 'Sylar', 'Seil', '1081-6760', '331.0', 'GBP', 'A46047']]
personal_information = [['Tzhq+56p=', 'Daniel', 'Lenny', '134.0',
'USD','M53', '37'],
['qWNmZankudw=', 'Sylar', 'Seil', '331.0', 'GBP', 'A46047', '676']]
Return an output (as an array of strings) that checks the arguments against each other in the
following format:
scanner(possible_criminals, personal_information) =
[['9AheT-12=', 'Tzhq+56p=', 'criminal'], ['zOvfqFxTWqQ=', 'qWNmZankudw=',
'criminal']]
def scanner(possible_criminals , personal_information)
'''
this problem can be simplified by understanding that the output
contains an array of 3 values
1) index[0] from argument 1
2) index[0] from argument 2
3) a value calculated by our function db_checker
steps to solve the problem:
- creating value 1) and 2) in output by extracting index 0 from given
arguments(possible_criminals , personal_information)
- "prepare" the arguments(possible_criminals , personal_information) for comparison
by sanitizing them:
- run "".lower() to account for case-insensitive matches
- pop unnecessary values
- calculating whether the arguments match by using a function
that compares possible_criminals with their personal_information
- function checks how many matches are there
'''
def db_checker(A, B):
counter = 0
for x in A:
if B.count(x) == 0:
counter += 1
if counter == 0:
return "criminal"
elif counter == 1:
return "possible"
elif counter == 2:
return "unlikely"
else:
return "none"
def init_output(N, M):
outputs = []
for i in range(len(N)):
output = []
output += [N[i].pop(0)] + [M[i].pop(0)]
outputs.append(output)
N[i].pop(2) # remove undesired values
M[i].pop(-1)
N[i] = [y.lower() for y in N[i]]
M[i] = [k.lower() for k in M[i]]
return outputs, N, M
# driver program
final = init_output(possible_criminals , personal_information )
for i in range(len(final[1])):
final[0][i].append(confidence_calculator(final[1][i], final[2][i]))
return final[0]
assert scanner(possible_criminals , personal_information) ==
[['9AheT-12=', 'Tzhq+56p=', 'criminal'], ['zOvfqFxTWqQ=', 'qWNmZankudw=', 'criminal']]
python formatting
$endgroup$
add a comment |
$begingroup$
The goal is to reduce the run-time of the operation, the function is working as intended but I'm struggling to make it more efficient larger inputs
You are given 2 arguments:
possible_criminals = [['9AheT-12=', 'Daniel', 'Lenny', '3512-6910',
'134.0', 'USD', 'M53'],
['zOvfqFxTWqQ=', 'Sylar', 'Seil', '1081-6760', '331.0', 'GBP', 'A46047']]
personal_information = [['Tzhq+56p=', 'Daniel', 'Lenny', '134.0',
'USD','M53', '37'],
['qWNmZankudw=', 'Sylar', 'Seil', '331.0', 'GBP', 'A46047', '676']]
Return an output (as an array of strings) that checks the arguments against each other in the
following format:
scanner(possible_criminals, personal_information) =
[['9AheT-12=', 'Tzhq+56p=', 'criminal'], ['zOvfqFxTWqQ=', 'qWNmZankudw=',
'criminal']]
def scanner(possible_criminals , personal_information)
'''
this problem can be simplified by understanding that the output
contains an array of 3 values
1) index[0] from argument 1
2) index[0] from argument 2
3) a value calculated by our function db_checker
steps to solve the problem:
- creating value 1) and 2) in output by extracting index 0 from given
arguments(possible_criminals , personal_information)
- "prepare" the arguments(possible_criminals , personal_information) for comparison
by sanitizing them:
- run "".lower() to account for case-insensitive matches
- pop unnecessary values
- calculating whether the arguments match by using a function
that compares possible_criminals with their personal_information
- function checks how many matches are there
'''
def db_checker(A, B):
counter = 0
for x in A:
if B.count(x) == 0:
counter += 1
if counter == 0:
return "criminal"
elif counter == 1:
return "possible"
elif counter == 2:
return "unlikely"
else:
return "none"
def init_output(N, M):
outputs = []
for i in range(len(N)):
output = []
output += [N[i].pop(0)] + [M[i].pop(0)]
outputs.append(output)
N[i].pop(2) # remove undesired values
M[i].pop(-1)
N[i] = [y.lower() for y in N[i]]
M[i] = [k.lower() for k in M[i]]
return outputs, N, M
# driver program
final = init_output(possible_criminals , personal_information )
for i in range(len(final[1])):
final[0][i].append(confidence_calculator(final[1][i], final[2][i]))
return final[0]
assert scanner(possible_criminals , personal_information) ==
[['9AheT-12=', 'Tzhq+56p=', 'criminal'], ['zOvfqFxTWqQ=', 'qWNmZankudw=', 'criminal']]
python formatting
$endgroup$
The goal is to reduce the run-time of the operation, the function is working as intended but I'm struggling to make it more efficient larger inputs
You are given 2 arguments:
possible_criminals = [['9AheT-12=', 'Daniel', 'Lenny', '3512-6910',
'134.0', 'USD', 'M53'],
['zOvfqFxTWqQ=', 'Sylar', 'Seil', '1081-6760', '331.0', 'GBP', 'A46047']]
personal_information = [['Tzhq+56p=', 'Daniel', 'Lenny', '134.0',
'USD','M53', '37'],
['qWNmZankudw=', 'Sylar', 'Seil', '331.0', 'GBP', 'A46047', '676']]
Return an output (as an array of strings) that checks the arguments against each other in the
following format:
scanner(possible_criminals, personal_information) =
[['9AheT-12=', 'Tzhq+56p=', 'criminal'], ['zOvfqFxTWqQ=', 'qWNmZankudw=',
'criminal']]
def scanner(possible_criminals , personal_information)
'''
this problem can be simplified by understanding that the output
contains an array of 3 values
1) index[0] from argument 1
2) index[0] from argument 2
3) a value calculated by our function db_checker
steps to solve the problem:
- creating value 1) and 2) in output by extracting index 0 from given
arguments(possible_criminals , personal_information)
- "prepare" the arguments(possible_criminals , personal_information) for comparison
by sanitizing them:
- run "".lower() to account for case-insensitive matches
- pop unnecessary values
- calculating whether the arguments match by using a function
that compares possible_criminals with their personal_information
- function checks how many matches are there
'''
def db_checker(A, B):
counter = 0
for x in A:
if B.count(x) == 0:
counter += 1
if counter == 0:
return "criminal"
elif counter == 1:
return "possible"
elif counter == 2:
return "unlikely"
else:
return "none"
def init_output(N, M):
outputs = []
for i in range(len(N)):
output = []
output += [N[i].pop(0)] + [M[i].pop(0)]
outputs.append(output)
N[i].pop(2) # remove undesired values
M[i].pop(-1)
N[i] = [y.lower() for y in N[i]]
M[i] = [k.lower() for k in M[i]]
return outputs, N, M
# driver program
final = init_output(possible_criminals , personal_information )
for i in range(len(final[1])):
final[0][i].append(confidence_calculator(final[1][i], final[2][i]))
return final[0]
assert scanner(possible_criminals , personal_information) ==
[['9AheT-12=', 'Tzhq+56p=', 'criminal'], ['zOvfqFxTWqQ=', 'qWNmZankudw=', 'criminal']]
python formatting
python formatting
asked 8 mins ago
sgezasgeza
133
133
add a comment |
add a comment |
0
active
oldest
votes
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%2f215591%2fiteratively-checking-array-of-array-of-strings%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f215591%2fiteratively-checking-array-of-array-of-strings%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