Ttykuu

What does "Scientists rise up against statistical significance" mean? (Comment in Nature)

Why is so much work done on numerical verification of the Riemann Hypothesis?

Does the UK parliament need to pass secondary legislation to accept the Article 50 extension

How do you respond to a colleague from another team when they're wrongly expecting that you'll help them?

Unexpected behavior of the procedure `Area` on the object 'Polygon'

Non-trope happy ending?

How much character growth crosses the line into breaking the character

Why should universal income be universal?

Why is it that I can sometimes guess the next note?

Calculating total slots

Yosemite Fire Rings - What to Expect?

How should I respond when I lied about my education and the company finds out through background check?

It grows, but water kills it

Did arcade monitors have same pixel aspect ratio as TV sets?

Is there a way to get `mathscr' with lower case letters in pdfLaTeX?

Can I say "fingers" when referring to toes?

Why is short-wave infrared portion of electromagnetic spectrum so sensitive to fire?

Lowest total scrabble score

Does the Linux kernel need a file system to run?

Does Doodling or Improvising on the Piano Have Any Benefits?

Why is the "ls" command showing permissions of files in a FAT32 partition?

Pre-mixing cryogenic fuels and using only one fuel tank

Can a college of swords bard use blade flourish on an OA from dissonant whispers?

Limits and Infinite Integration by Parts

A One-Pass Hash Table Solution to twoSum

Python Hash Table ImplementationHackerRank Ransom Note, solved using Data.Map as a hash tableHash table using linear probingHackerrank “Hash Tables: Ransom Note” Javascript SolutionDirect address hash tableFour sum algorithm mock interview practiceCounting out game with std::listPython 3 two-sum performanceHash table in PythonHash table solution to twoSum

0

$begingroup$

I read the guiding solution to twoSum in leetcodes ;

Approach 3: One-pass Hash Table

It turns out we can do it in one-pass. While we iterate and inserting elements into the table, we also look back to check if current element's complement already exists in the table. If it exists, we have found a solution and return immediately.

and mimic a python solution

class Solution:
 def twoSum(self, nums, target) -> List[int]:
 """
 :type nums: List[int]
 :type target: int
 """
 nums_d = 

 for i in range(len(nums)):
 complement = target - nums[i]

 if nums_d.get(complement) != None: #Check None not True Value
 return [i, nums_d.get(complement)] 
 nums_d[nums[i]] = i #produce a map 
 return [] 

Unfortunately, my solution is only faster than 81%, which I thought was a best solution.

Runtime: 40 ms, faster than 81.00% of Python3 online submissions for Two Sum.
Memory Usage: 14.3 MB, less than 5.08% of Python3 online submissions for Two Sum.
Next challenges:

How could continue to improve the code, and I am curious about the approaches of the top 20%.

algorithm python-3.x programming-challenge

share|improve this question

asked 13 mins ago

AliceAlice

1603

New contributor

Alice is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

0

$begingroup$

I read the guiding solution to twoSum in leetcodes ;

Approach 3: One-pass Hash Table

It turns out we can do it in one-pass. While we iterate and inserting elements into the table, we also look back to check if current element's complement already exists in the table. If it exists, we have found a solution and return immediately.

and mimic a python solution

class Solution:
 def twoSum(self, nums, target) -> List[int]:
 """
 :type nums: List[int]
 :type target: int
 """
 nums_d = 

 for i in range(len(nums)):
 complement = target - nums[i]

 if nums_d.get(complement) != None: #Check None not True Value
 return [i, nums_d.get(complement)] 
 nums_d[nums[i]] = i #produce a map 
 return [] 

Unfortunately, my solution is only faster than 81%, which I thought was a best solution.

Runtime: 40 ms, faster than 81.00% of Python3 online submissions for Two Sum.
Memory Usage: 14.3 MB, less than 5.08% of Python3 online submissions for Two Sum.
Next challenges:

How could continue to improve the code, and I am curious about the approaches of the top 20%.

algorithm python-3.x programming-challenge

share|improve this question

asked 13 mins ago

AliceAlice

1603

New contributor

Alice is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

$begingroup$

I read the guiding solution to twoSum in leetcodes ;

Approach 3: One-pass Hash Table

It turns out we can do it in one-pass. While we iterate and inserting elements into the table, we also look back to check if current element's complement already exists in the table. If it exists, we have found a solution and return immediately.

and mimic a python solution

class Solution:
 def twoSum(self, nums, target) -> List[int]:
 """
 :type nums: List[int]
 :type target: int
 """
 nums_d = 

 for i in range(len(nums)):
 complement = target - nums[i]

 if nums_d.get(complement) != None: #Check None not True Value
 return [i, nums_d.get(complement)] 
 nums_d[nums[i]] = i #produce a map 
 return [] 

Unfortunately, my solution is only faster than 81%, which I thought was a best solution.

Runtime: 40 ms, faster than 81.00% of Python3 online submissions for Two Sum.
Memory Usage: 14.3 MB, less than 5.08% of Python3 online submissions for Two Sum.
Next challenges:

How could continue to improve the code, and I am curious about the approaches of the top 20%.

algorithm python-3.x programming-challenge

share|improve this question

asked 13 mins ago

AliceAlice

1603

New contributor

Alice is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

class Solution:
 def twoSum(self, nums, target) -> List[int]:
 """
 :type nums: List[int]
 :type target: int
 """
 nums_d = 

 for i in range(len(nums)):
 complement = target - nums[i]

 if nums_d.get(complement) != None: #Check None not True Value
 return [i, nums_d.get(complement)] 
 nums_d[nums[i]] = i #produce a map 
 return [] 

share|improve this question

asked 13 mins ago

AliceAlice

1603

New contributor

Alice is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

share|improve this question

asked 13 mins ago

AliceAlice

1603

New contributor

Alice is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 13 mins ago

AliceAlice

1603

New contributor

Alice is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 13 mins ago

AliceAlice

1603