（转载）Two Sum Problem : aiming at (log n) square complexity

[heteroclinic]

此帖转自 heteroclinic 在 STEM 的帖子：Two Sum Problem : aiming at (log n) square complexity

https://github.com/wangzhikai/TwoSumPro ... /README.md


TwoSumProblem

Two Sum Problem - - the well-known tech interview question and proposed solution aiming at (log n) square time complexity and O(1) space complexity.

The high level algorithm design is documented here. text

The original work of mine, POC completed is as this file. text

I asked Chatgpt to review the code. It provided a more concise version plus more test cases. Again, it is still POC protype and I don't aim it having the industry level robustness. text

With the assistance of Chatgpt, we are able to construct worst case test data. Which makes time complexity O(n). text

I have been thinking of the worst case for days. According to the analysis in the pdf file, I decided to add one step per loop in the algorithm "opportunistic guessing". It is not purely opportunistic as discussed in the pdf file. Chatgpt quickly implemented the idea as a Python file. text It shows case we can beat the O(n) case with a O( log^2 n) approach. I have not got the chance to thouroughly review the Python file. Any comments will be welcome!

Further Research An immediate application of this problem can be for Goldbach’s conjecture as computer validation in limited scope. A large enough even number is the sum of two prime numbers. Given a large even number t and a complete list of prime numbers in scope, we can search for two prime numbers one is less than t/2 and the other is greater than t/2.

Acknowledgement Thanks to Leetcode presenting the problem to the ardent CS students and programmers! I used Node JS, VS Code + Copilot for the POC. Chatgpt greatly speeds up orginal research. Python is also used in the POC of code and visualizing important clues. Here are some chat histories with Chatgpt: https://chatgpt.com/share/682cc20d-57d0 ... 460c77d0a2 https://chatgpt.com/share/682cc226-2e38 ... 60ee0c65e8 https://chatgpt.com/share/682cc258-324c ... 471a70e78e

[heteroclinic]

本人有一定的预算支付给reviewer 合理成本.多谢!

[hci]

是想发表么？

本人有一定的预算支付给reviewer 合理成本.多谢!

[heteroclinic]

是想发表么？

是，版主有路子么？
要求不高稍微正式点的刊物就行。
有朋友connections 介绍一下也好。润色润色，改进改进。

多谢！

[hci]

自己投一下不就行了么？投稿还要路子？投一下，根据reviewer的评论改进就行了。

是，版主有路子么？
要求不高稍微正式点的刊物就行。
有朋友connections 介绍一下也好。润色润色，改进改进。

多谢！

[heteroclinic]

自己投一下不就行了么？投稿还要路子？投一下，根据reviewer的评论改进就行了。

以前试过,好像据稿不需要理由too.和武侠小说了主持,观主也没啥区别.
都是宰圈子外的.

为了避免浪费宝贵的时间与资源,还是得找对人.