17. Letter Combinations of a Phone Number

-

Difficulty: Medium 

Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order.

A mapping of digits to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters.

 

Example 1:

Input: digits = "23"
Output: ["ad","ae","af","bd","be","bf","cd","ce","cf"]

Example 2:

Input: digits = ""
Output: []

Example 3:

Input: digits = "2"
Output: ["a","b","c"]

Python Solution:

class Solution:
 def letterCombinations(self, digits: str) -> List[str]:
 d={2:'abc',3:'def',4:'ghi',5:'jkl',6:'mno',7:'pqrs',8:'tuv',9:'wxyz'}
 i=0
 l=[]
 try:
 for i in d[int(digits[0])]:
 try:
 for j in d[int(digits[1])]:
 try:
 for k in d[int(digits[2])]:
 try:
 for m in d[int(digits[3])]:
 l.append(i+j+k+m)
 except:
 l.append(i+j+k)
 except:
 l.append(i+j)
 except:
 l.append(i)
 return l
 except:
 return l

If you have any doubt in code, just ask me in gmail, I'll clear your doubt: varunkapoor.29085@gmail.com

Comments

Post a Comment

Popular posts from this blog

136. Single Number

-
  Difficulty: Easy Given a  non-empty  array of integers  nums , every element appears  twice  except for one. Find that single one. You must implement a solution with a linear runtime complexity and use only constant extra space. Example 1: Input: nums = [2,2,1] Output: 1 Example 2: Input: nums = [4,1,2,1,2] Output: 4 Example 3: Input: nums = [1] Output: 1 Python Solution: class Solution(object):     def singleNumber(self, nums):         nums.sort()         i=0         while 1:             try:                 if nums[i]==nums[i+1]:                     del nums[i]                     del nums[i]                 else:             ...
Read more

35. Search Insert Position

-
Difficulty: Easy   Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You must write an algorithm with  O(log n)  runtime complexity.   Example 1: Input: nums = [1,3,5,6], target = 5 Output: 2 Example 2: Input: nums = [1,3,5,6], target = 2 Output: 1 Example 3: Input: nums = [1,3,5,6], target = 7 Output: 4 Python Solution: class Solution: def searchInsert(self, nums: List[int], target: int) -> int: if target in nums: return nums.index(target) else: nums.append(target) nums.sort() return nums.index(target)
Read more

7. Reverse Integer

-
Difficulty: Medium   Given a signed 32-bit integer   x , return   x  with its digits reversed . If reversing   x   causes the value to go outside the signed 32-bit integer range   [-2 31 , 2 31  - 1] , then return   0 . Assume the environment does not allow you to store 64-bit integers (signed or unsigned). Example 1: Input: x = 123 Output: 321 Example 2: Input: x = -123 Output: -321 Example 3: Input: x = 120 Output: 21 Constraints: -2 31  <= x <= 2 31  - 1 Python Solution: class Solution: def reverse(self, x: int) -> int: x=str(x) x=x[::-1] if x[-1]=='-': if (-1)*int(x[:-1])<=2**31-1 and (-1)*int(x[:-1])>=-2**31: return (-1)*int(x[:-1]) else: return 0 else: if int(x)<=2**31-1 and int(x)>=-2**31: return int(x) else: return 0
Read more