Sum of array elements after reversing each element
Last Updated :
09 Apr, 2021
Given an array arr[] consisting of N positive integers, the task is to find the sum of all array elements after reversing digits of every array element.
Examples:
Input: arr[] = {7, 234, 58100}
Output: 18939
Explanation:
Modified array after reversing each array elements = {7, 432, 18500}.
Therefore, the sum of the modified array = 7 + 432 + 18500 = 18939.
Input: arr[] = {0, 100, 220}
Output: 320
Explanation:
Modified array after reversing each array elements = {0, 100, 220}.
Therefore, the sum of the modified array = 0 + 100 + 220 = 320.
Approach: The idea is to reverse each number of the given array as per the given conditions and find sum of all array elements formed after reversing. Below steps to solve the problem:
- Initialize a variable, say sum, to store the required sum.
- Initialize variable count as 0 and f as false to store count of ending 0s of arr[i] and flag to avoid all non-ending 0.
- Initialize rev as 0 to store reversal of each array element.
- Traverse the given array and for each array element do the following operation:
- Increment count and divide arr[i] by 10 until all the zeros at the end are traversed.
- Reset f with true that means all ending 0 digits have been considered.
- Now, reverse arr[i] by updating rev = rev*10 + arr[i] % 10 and arr[i] = arr[i]/10.
- After traversing each digit of arr[i], update rev = rev * Math.pow(10, count) to add all ending 0's to the end of reversed number.
- For each reverse number in the above step, add that value to the resultant sum.
Below is the implementation of the above approach:
C++
// C++ program for the above approach
#include <bits/stdc++.h>
using namespace std;
// Function to find the sum of elements
// after reversing each element in arr[]
void totalSum(int arr[], int n)
{
// Stores the final sum
int sum = 0;
// Traverse the given array
for(int i = 0; i < n; i++)
{
// Stores count of ending 0s
int count = 0;
int rev = 0, num = arr[i];
// Flag to avoid count of 0s
// that doesn't ends with 0s
bool f = false;
while (num > 0)
{
// Count of ending 0s
while (num > 0 && !f &&
num % 10 == 0)
{
count++;
num = num / 10;
}
// Update flag with true
f = true;
// Reversing the num
if (num > 0)
{
rev = rev * 10 +
num % 10;
num = num / 10;
}
}
// Add all ending 0s to
// end of rev
if (count > 0)
rev = rev * pow(10, count);
// Update sum
sum = sum + rev;
}
// Print total sum
cout << sum;
}
// Driver Code
int main()
{
// Given arr[]
int arr[] = { 7, 234, 58100 };
int n = sizeof(arr) / sizeof(arr[0]);
// Function call
totalSum(arr, n);
return 0;
}
// This code is contributed by akhilsaini
// Java program for the above approach
import java.util.*;
class GFG {
// Function to find the sum of elements
// after reversing each element in arr[]
static void totalSum(int[] arr)
{
// Stores the final sum
int sum = 0;
// Traverse the given array
for (int i = 0;
i < arr.length; i++) {
// Stores count of ending 0s
int count = 0;
int rev = 0, num = arr[i];
// Flag to avoid count of 0s
// that doesn't ends with 0s
boolean f = false;
while (num > 0) {
// Count of ending 0s
while (num > 0 && !f
&& num % 10 == 0) {
count++;
num = num / 10;
}
// Update flag with true
f = true;
// Reversing the num
if (num > 0) {
rev = rev * 10
+ num % 10;
num = num / 10;
}
}
// Add all ending 0s to
// end of rev
if (count > 0)
rev = rev
* (int)Math.pow(10,
count);
// Update sum
sum = sum + rev;
}
// Print total sum
System.out.print(sum);
}
// Driver Code
public static void
main(String[] args)
{
// Given arr[]
int[] arr = { 7, 234, 58100 };
// Function Call
totalSum(arr);
}
}
# Python3 program for the above approach
# Function to find the sum of elements
# after reversing each element in arr[]
def totalSum(arr, n):
# Stores the final sum
sums = 0
# Traverse the given array
for i in range(0, n):
# Stores count of ending 0s
count = 0
rev = 0
num = arr[i]
# Flag to avoid count of 0s
# that doesn't ends with 0s
f = False
while num > 0:
# Count of ending 0s
while (num > 0 and f == False and
num % 10 == 0):
count = count + 1
num = num // 10
# Update flag with true
f = True
# Reversing the num
if num > 0:
rev = rev * 10 + num % 10
num = num // 10
# Add all ending 0s to
# end of rev
if (count > 0):
rev = rev * pow(10, count)
# Update sum
sums = sums + rev
# Print total sum
print(sums)
# Driver Code
if __name__ == "__main__":
# Given arr[]
arr = [ 7, 234, 58100 ]
n = len(arr)
# Function call
totalSum(arr, n)
# This code is contributed by akhilsaini
// C# program for the above approach
using System;
class GFG{
// Function to find the sum of elements
// after reversing each element in arr[]
static void totalSum(int[] arr)
{
// Stores the final sum
int sum = 0;
// Traverse the given array
for(int i = 0; i < arr.Length; i++)
{
// Stores count of ending 0s
int count = 0;
int rev = 0, num = arr[i];
// Flag to avoid count of 0s
// that doesn't ends with 0s
bool f = false;
while (num > 0)
{
// Count of ending 0s
while (num > 0 && !f &&
num % 10 == 0)
{
count++;
num = num / 10;
}
// Update flag with true
f = true;
// Reversing the num
if (num > 0)
{
rev = rev * 10 +
num % 10;
num = num / 10;
}
}
// Add all ending 0s to
// end of rev
if (count > 0)
rev = rev * (int)Math.Pow(10, count);
// Update sum
sum = sum + rev;
}
// Print total sum
Console.Write(sum);
}
// Driver Code
static public void Main()
{
// Given arr[]
int[] arr = { 7, 234, 58100 };
// Function call
totalSum(arr);
}
}
// This code is contributed by akhilsaini
<script>
// Javascript program for the above approach
// Function to find the sum of elements
// after reversing each element in arr[]
function totalSum(arr, n)
{
// Stores the final sum
let sum = 0;
// Traverse the given array
for(let i = 0; i < n; i++)
{
// Stores count of ending 0s
let count = 0;
let rev = 0, num = arr[i];
// Flag to avoid count of 0s
// that doesn't ends with 0s
let f = false;
while (num > 0)
{
// Count of ending 0s
while (num > 0 && !f &&
num % 10 == 0)
{
count++;
num = Math.floor(num / 10);
}
// Update flag with true
f = true;
// Reversing the num
if (num > 0)
{
rev = rev * 10 +
num % 10;
num = Math.floor(num / 10);
}
}
// Add all ending 0s to
// end of rev
if (count > 0)
rev = rev * Math.pow(10, count);
// Update sum
sum = sum + rev;
}
// Print total sum
document.write(sum);
}
// Driver Code
// Given arr[]
let arr = [ 7, 234, 58100 ];
let n = arr.length;
// Function call
totalSum(arr, n);
// This code is contributed by Mayank Tyagi
</script>
Time Complexity: O(N*log10M), where N denotes the length of the array and M denotes maximum array element.
Auxiliary Space: O(1)
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
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
14 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
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
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
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
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
4 min read
Sorting Algorithms A Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read