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

Non-trivial topology where only open sets are closed

Simplify an interface for flexibly applying rules to periods of time

How can we have a quark condensate without a quark potential?

Custom alignment for GeoMarkers

Fastest way to pop N items from a large dict

Knife as defense against stray dogs

How to make healing in an exploration game interesting

What is the relationship between relativity and the Doppler effect?

Why do tuner card drivers fail to build after kernel update to 4.4.0-143-generic?

World War I as a war of liberals against authoritarians?

Why is a white electrical wire connected to 2 black wires?

Happy pi day, everyone!

A diagram about partial derivatives of f(x,y)

Does multi-classing into Fighter give you heavy armor proficiency?

Bacteria contamination inside a thermos bottle

While on vacation my taxi took a longer route, possibly to scam me out of money. How can I deal with this?

How to terminate ping <dest> &

Are Roman Catholic priests ever addressed as pastor

What is the adequate fee for a reveal operation?

Instead of a Universal Basic Income program, why not implement a "Universal Basic Needs" program?

How to pronounce "I ♥ Huckabees"?

What options are left, if Britain cannot decide?

Most cost effective thermostat setting: consistent temperature vs. lowest temperature possible

What did “the good wine” (τὸν καλὸν οἶνον) mean in John 2:10?



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













0












$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']]








share









$endgroup$
















    0












    $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']]








    share









    $endgroup$














      0












      0








      0





      $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']]








      share









      $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





      share












      share










      share



      share










      asked 3 mins ago









      sgezasgeza

      133




      133




















          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
          );



          );













          draft saved

          draft discarded


















          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















          draft saved

          draft discarded
















































          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.




          draft saved


          draft discarded














          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





















































          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







          Popular posts from this blog

          名間水力發電廠 目录 沿革 設施 鄰近設施 註釋 外部連結 导航菜单23°50′10″N 120°42′41″E / 23.83611°N 120.71139°E / 23.83611; 120.7113923°50′10″N 120°42′41″E / 23.83611°N 120.71139°E / 23.83611; 120.71139計畫概要原始内容臺灣第一座BOT 模式開發的水力發電廠-名間水力電廠名間水力發電廠 水利署首件BOT案原始内容《小檔案》名間電廠 首座BOT水力發電廠原始内容名間電廠BOT - 經濟部水利署中區水資源局

          Prove that NP is closed under karp reduction?Space(n) not closed under Karp reductions - what about NTime(n)?Class P is closed under rotation?Prove or disprove that $NL$ is closed under polynomial many-one reductions$mathbfNC_2$ is closed under log-space reductionOn Karp reductionwhen can I know if a class (complexity) is closed under reduction (cook/karp)Check if class $PSPACE$ is closed under polyonomially space reductionIs NPSPACE also closed under polynomial-time reduction and under log-space reduction?Prove PSPACE is closed under complement?Prove PSPACE is closed under union?

          Is my guitar’s action too high? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Strings too stiff on a recently purchased acoustic guitar | Cort AD880CEIs the action of my guitar really high?Μy little finger is too weak to play guitarWith guitar, how long should I give my fingers to strengthen / callous?When playing a fret the guitar sounds mutedPlaying (Barre) chords up the guitar neckI think my guitar strings are wound too tight and I can't play barre chordsF barre chord on an SG guitarHow to find to the right strings of a barre chord by feel?High action on higher fret on my steel acoustic guitar