Is it possible to efficiently store all possible phone numbers in memory?
Posted
by
Spencer K
on Programmers
See other posts from Programmers
or by Spencer K
Published on 2012-04-14T21:48:51Z
Indexed on
2012/04/14
23:45 UTC
Read the original article
Hit count: 364
algorithms
|data-structures
Given the standard North American phone number format: (Area Code) Exchange - Subscriber, the set of possible numbers is about 6 billion. However, efficiently breaking down the nodes into the sections listed above would yield less than 12000 distinct nodes that can be arranged in groupings to get all the possible numbers.
This seems like a problem already solved.
Would it done via a graph or tree?
© Programmers or respective owner