Calculate maximum value using '+' or '*' sign between two numbers in a string Last Updated : 15 Sep, 2023 Comments Improve Suggest changes Like Article Like Report Given a string of numbers, the task is to find the maximum value from the string, you can add a '+' or '*' sign between any two numbers. Examples: Input : 01231 Output : ((((0 + 1) + 2) * 3) + 1) = 10 In above manner, we get the maximum value i.e. 10 Input : 891 Output :73 As 8*9*1 = 72 and 8*9+1 = 73.So, 73 is maximum. Asked in : Facebook Recommended: Please solve it on “PRACTICE ” first, before moving on to the solution. The task is pretty simple as we can get the maximum value on multiplying all values but the point is to handle the case of 0 and 1 i.e. On multiplying with 0 and 1 we get the lower value as compared to on adding with 0 and 1. So, use '*' sign between any two numbers(except numbers containing 0 and 1) and use '+' if any of the numbers is 0 and 1. Implementation: C++ // C++ program to find maximum value #include <bits/stdc++.h> using namespace std; // Function to calculate the value int calcMaxValue(string str) { // Store first character as integer // in result int res = str[0] -'0'; // Start traversing the string for (int i = 1; i < str.length(); i++) { // Check if any of the two numbers // is 0 or 1, If yes then add current // element if (str[i] == '0' || str[i] == '1' || res < 2 ) res += (str[i]-'0'); // Else multiply else res *= (str[i]-'0'); } // Return maximum value return res; } // Drivers code int main() { string str = "01891"; cout << calcMaxValue(str); return 0; } Java // Java program to find maximum value public class GFG { // Method to calculate the value static int calcMaxValue(String str) { // Store first character as integer // in result int res = str.charAt(0) -'0'; // Start traversing the string for (int i = 1; i < str.length(); i++) { // Check if any of the two numbers // is 0 or 1, If yes then add current // element if (str.charAt(i) == '0' || str.charAt(i) == '1' || res < 2 ) res += (str.charAt(i)-'0'); // Else multiply else res *= (str.charAt(i)-'0'); } // Return maximum value return res; } // Driver Method public static void main(String[] args) { String str = "01891"; System.out.println(calcMaxValue(str)); } } Python3 # Python program to find maximum value # Function to calculate the value def calcMaxValue(str): # Store first character as integer # in result res = ord(str[0]) - 48 # Start traversing the string for i in range(1, len(str)): # Check if any of the two numbers # is 0 or 1, If yes then add current # element if(str[i] == '0' or str[i] == '1' or res < 2): res += ord(str[i]) - 48 else: res *= ord(str[i]) - 48 return res # Driver code if __name__== "__main__": str = "01891"; print(calcMaxValue(str)); # This code is contributed by Sairahul Jella C# //C# program to find maximum value using System; class GFG { // Method to calculate the value static int calcMaxValue(String str) { // Store first character as integer // in result int res = str[0] -'0'; // Start traversing the string for (int i = 1; i < str.Length; i++) { // Check if any of the two numbers // is 0 or 1, If yes then add current // element if (str[i] == '0' || str[i] == '1' || res < 2 ) res += (str[i] - '0'); // Else multiply else res *= (str[i] - '0'); } // Return maximum value return res; } // Driver Code static public void Main () { String str = "01891"; Console.Write(calcMaxValue(str)); } } // This code is contributed by jit_t PHP <?php // PHP program to find // maximum value // Function to calculate // the value function calcMaxValue($str) { // Store first character // as integer in result $res = $str[0] - '0'; // Start traversing // the string for ($i = 1; $i < strlen($str); $i++) { // Check if any of the // two numbers is 0 or // 1, If yes then add // current element if ($str[$i] == '0' || $str[$i] == '1' || $res < 2 ) $res += ($str[$i] - '0'); // Else multiply else $res *= ($str[$i] - '0'); } // Return maximum value return $res; } // Driver code $str = "01891"; echo calcMaxValue($str); // This code is contributed by ajit ?> JavaScript <script> // Javascript program to // find maximum value // Method to calculate the value function calcMaxValue(str) { // Store first character as integer // in result let res = str[0].charCodeAt() - '0'.charCodeAt(); // Start traversing the string for (let i = 1; i < str.length; i++) { // Check if any of the two numbers // is 0 or 1, If yes then add current // element if (str[i] == '0' || str[i] == '1' || res < 2 ) res += (str[i].charCodeAt() - '0'.charCodeAt()); // Else multiply else res *= (str[i].charCodeAt() - '0'.charCodeAt()); } // Return maximum value return res; } let str = "01891"; document.write(calcMaxValue(str)); </script> Output82 Time complexity : O(n) Auxiliary Space : O(1) Above program consider the case of small inputs i.e. up to which C/C++ can handle the range of maximum value. Comment More infoAdvertise with us Next Article Quick Sort S Sahil Chhabra Improve Article Tags : Strings DSA Facebook Practice Tags : FacebookStrings Similar Reads DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on 7 min read Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st 2 min read Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s 12 min read Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge 12 min read Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir 8 min read Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc 15 min read Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta 15+ min read Linked List Data Structure A linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Hereâs the comparison of Linked List vs Arrays Linked List: 2 min read Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T 9 min read Array Data Structure Guide In this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous 3 min read Like