Leetcode Problem 246. Strobogrammatic Number

246. Strobogrammatic Number

Leetcode Solutions

Approach: Two Pointers

  1. Define a hashmap to store the valid strobogrammatic pairs.
  2. Initialize two pointers, left at the start of the string and right at the end.
  3. While left is less than or equal to right: a. Check if the character at left is in the hashmap. b. If not, return false. c. Retrieve the expected character that should be at right from the hashmap. d. If the character at right does not match the expected character, return false. e. Increment left and decrement right.
  4. If all pairs are valid, return true.
UML Thumbnail

Approach: Make a Rotated Copy

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...