I have a bunch of numbers in a text file, around 80000 lines, the first ones are as follows:
What I am trying to do is finding the corresponding second column e.g. (1.1) by searching for a string e.g., 46-73-212345. I am trying to find the longest option possible meaning,
46732 will be the exact match for the input 46-73-212345, but for another string value 46-73-111134, then 4673 would be the exact match.
Since there are too many records, how can i process this in C# or Java?
This is obvious an algorithm based question.
e.g. should I go per character matching but consider the number of total records which is high..