193. Valid Phone Numbers LeetCode Solution

In this guide, you will get 193. Valid Phone Numbers LeetCode Solution with the best time and space complexity. The solution to Valid Phone Numbers problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.

Table of Contents

1. Problem Statement
2. Complexity Analysis
3. Valid Phone Numbers solution in C++
4. Valid Phone Numbers solution in Java
5. Valid Phone Numbers solution in Python
6. Additional Resources

Problem Statement of Valid Phone Numbers

Given a text file file.txt that contains a list of phone numbers (one per line), write a one-liner bash script to print all valid phone numbers.
You may assume that a valid phone number must appear in one of the following two formats: (xxx) xxx-xxxx or xxx-xxx-xxxx. (x means a digit)
You may also assume each line in the text file must not contain leading or trailing white spaces.
Example:
Assume that file.txt has the following content:

987-123-4567
123 456 7890
(123) 456-7890

Your script should output the following valid phone numbers:

987-123-4567
(123) 456-7890

Example not found

Constraints not found

Complexity Analysis

• Time Complexity: Google AdSense
• Space Complexity: Google Analytics

193. Valid Phone Numbers LeetCode Solution in C++

grep -e "^[0-9]\{3\}\-[0-9]\{3\}\-[0-9]\{4\}$" -e "^([0-9]\{3\}) [0-9]\{3\}\-[0-9]\{4\}$" file.txt
/* code provided by PROGIEZ */

193. Valid Phone Numbers LeetCode Solution in Java

N/A
// code provided by PROGIEZ

193. Valid Phone Numbers LeetCode Solution in Python

N/A
 # code by PROGIEZ

Additional Resources

• Explore all LeetCode problem solutions at Progiez here
• Explore all problems on LeetCode website here

Happy Coding! Keep following PROGIEZ for more updates and solutions.