This repository aims to solve and create new problems from different spheres of coding. A path to help students to get access to solutions and discuss their doubts.
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.
Enter link to the question(if question belongs to any online platform) -
Enter your question -
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.
Enter link to the question(if question belongs to any online platform) -
https://leetcode.com/problems/letter-combinations-of-a-phone-number/
Tags for the question(eg - Array, Basic, Stack, etc.) -
String