Convert all substrings of length 'k' from base 'b' to decimal
Last Updated :
14 Mar, 2023
A string defining a valid number is given. Output all the base conversions of substrings of length 'k' from base 'b' to base 10.
Examples:
Input : str = "12212",
k = 3, b = 3.
Output : 17 25 23
Explanation :
All the substrings of length 'k' are : 122, 221, 212.
Base conversion can be computed using the formula.
Naive approach: A simple approach is to use a simple base conversion technique. For a base b number str, its decimal equivalent is str[0]*b0 + str[1]*b1 + str[2]*b2 + ... + str[n-1]*bn-1
Follow the below steps to implement the above idea:
- Define the substringConversions function that takes a string str, an integer k (substring length), and an integer b (target base) as input.
- For each substring of length k in str:
a. Extract the substring and save it in the variable sub.
b. Evaluate the decimal value of sub by iterating over each character in sub from right to left:
i. Convert the character to its corresponding digit value using sub.at(i) - '0'.
ii. Multiply the digit value by the base raised to the power of its position in the substring, starting from 0 (i.e., the rightmost digit has a power of 0).
iii. Add the result of step ii to a running total sum.
c. Print the final value of sum for the current substring. - End the substringConversions function.
Below is the implementation of the above approach:
C++
// Simple C++ program to convert all substrings from
// decimal to given base.
#include <bits/stdc++.h>
using namespace std;
int substringConversions(string str, int k, int b)
{
for (int i=0; i + k <= str.size(); i++)
{
// Saving substring in sub
string sub = str.substr(i, k);
// Evaluating decimal for current substring
// and printing it.
int sum = 0, counter = 0;
for (int i = sub.size() - 1; i >= 0; i--)
{
sum = sum + ((sub.at(i) - '0') * pow(b, counter));
counter++;
}
cout << sum << " ";
}
}
// Driver code
int main()
{
string str = "12212";
int b = 3, k = 3;
substringConversions(str, b, k);
return 0;
}
// Simple Java program to convert all substrings from
// decimal to given base.
class GFG
{
static void substringConversions(String str, int k, int b)
{
for (int i=0; i + k <= str.length(); i++)
{
// Saving substring in sub
String sub = str.substring(i, i+k);
// Evaluating decimal for current substring
// and printing it.
int sum = 0, counter = 0;
for (int j = sub.length() - 1; j >= 0; j--)
{
sum = (int) (sum + ((sub.charAt(j) - '0') *
Math.pow(b, counter)));
counter++;
}
System.out.print(sum + " ");
}
}
// Driver code
public static void main(String[] args)
{
String str = "12212";
int b = 3, k = 3;
substringConversions(str, b, k);
}
}
// This code is contributed by 29AjayKumar
# Simple Python3 program to convert
# all substrings from decimal to given base.
import math
def substringConversions(s, k, b):
l = len(s);
for i in range(l):
if((i + k) < l + 1):
# Saving substring in sub
sub = s[i : i + k];
# Evaluating decimal for current
# substring and printing it.
sum, counter = 0, 0;
for i in range(len(sub) - 1, -1, -1):
sum = sum + ((ord(sub[i]) - ord('0')) *
pow(b, counter));
counter += 1;
print(sum , end = " ");
# Driver code
s = "12212";
b, k = 3, 3;
substringConversions(s, b, k);
# This code is contributed
# by Princi Singh
// Simple C# program to convert all substrings from
// decimal to given base.
using System;
class GFG
{
static void substringConversions(String str, int k, int b)
{
for (int i = 0; i + k <= str.Length; i++)
{
// Saving substring in sub
String sub = str.Substring(i, k);
// Evaluating decimal for current substring
// and printing it.
int sum = 0, counter = 0;
for (int j = sub.Length - 1; j >= 0; j--)
{
sum = (int) (sum + ((sub[j] - '0') *
Math.Pow(b, counter)));
counter++;
}
Console.Write(sum + " ");
}
}
// Driver code
public static void Main(String[] args)
{
String str = "12212";
int b = 3, k = 3;
substringConversions(str, b, k);
}
}
/* This code is contributed by PrinciRaj1992 */
<script>
// Simple Javascript program to convert
// all substrings from decimal to given base.
function substringConversions(str, k, b)
{
for(let i = 0; i + k <= str.length; i++)
{
// Saving substring in sub
let sub = str.substring(i, i+k);
// Evaluating decimal for current substring
// and printing it.
let sum = 0, counter = 0;
for(let j = sub.length - 1; j >= 0; j--)
{
sum = (sum + ((sub[j].charCodeAt(0) -
'0'.charCodeAt(0)) *
Math.pow(b, counter)));
counter++;
}
document.write(sum + " ");
}
}
// Driver code
let str = "12212";
let b = 3, k = 3;
substringConversions(str, b, k);
// This code is contributed by patel2127
</script>
Time Complexity : O(n*k)
Auxiliary Space: O(n)
Efficient approach (Using sliding window): We can use Sliding Window technique to solve it in linear time. Every time we slide the window, we will subtract the weight of first element i.e. (element * pow(b, k-1) ). Now multiplying the previous sum with 'b' will increase weight of every element 3 times which is required. Also we will simply add the new element in window because its weight will be element * pow(b, 0).
Below is the implementation :
C++
// Efficient C++ program to convert all substrings from
// decimal to given base.
#include <bits/stdc++.h>
using namespace std;
int substringConversions(string str, int k, int b)
{
int i = 0, sum = 0, counter = k-1;
// Computing the decimal of first window
for (i; i < k; i++)
{
sum = sum + ((str.at(i) - '0') * pow(b, counter));
counter--;
}
cout << sum << " ";
// prev stores the previous decimal
int prev = sum;
// Computing decimal equivalents of all other windows
sum = 0, counter = 0;
for (i; i < str.size(); i++)
{
// Subtracting weight of the element pushed out of window
sum = prev - ((str.at(i - k) - '0') * pow(b, k-1));
// Multiplying the decimal by base to formulate other window
sum = sum * b;
// Adding the new element of window to sum
sum = sum + (str.at(i) - '0');
// Decimal of current window
cout << sum << " ";
// Updating prev
prev = sum;
counter++;
}
}
// Driver code
int main()
{
string str = "12212";
int b = 3, k = 3;
substringConversions(str, b, k);
return 0;
}
// Efficient Java program to convert
// all substrings from decimal to given base.
import java.util.*;
class GFG
{
static void substringConversions(String str,
int k, int b)
{
int i = 0, sum = 0, counter = k-1;
// Computing the decimal of first window
for (i = 0; i < k; i++)
{
sum = (int) (sum + ((str.charAt(i) - '0') *
Math.pow(b, counter)));
counter--;
}
System.out.print(sum + " ");
// prev stores the previous decimal
int prev = sum;
// Computing decimal equivalents of all other windows
sum = 0; counter = 0;
for (; i < str.length(); i++)
{
// Subtracting weight of the element
// pushed out of window
sum = (int) (prev - ((str.charAt(i - k) - '0') *
Math.pow(b, k - 1)));
// Multiplying the decimal by base
// to formulate other window
sum = sum * b;
// Adding the new element of window to sum
sum = sum + (str.charAt(i) - '0');
// Decimal of current window
System.out.print(sum + " ");
// Updating prev
prev = sum;
counter++;
}
}
// Driver code
public static void main(String[] args)
{
String str = "12212";
int b = 3, k = 3;
substringConversions(str, b, k);
}
}
// This code is contributed by Rajput-Ji
# Simple Python3 program to convert all
# substrings from decimal to given base.
import math as mt
def substringConversions(str1, k, b):
for i in range(0, len(str1) - k + 1):
# Saving substring in sub
sub = str1[i:k + i]
# Evaluating decimal for current
# substring and printing it.
Sum = 0
counter = 0
for i in range(len(sub) - 1, -1, -1):
Sum = (Sum + ((ord(sub[i]) - ord('0')) *
pow(b, counter)))
counter += 1
print(Sum, end = " ")
# Driver code
str1 = "12212"
b = 3
k = 3
substringConversions(str1, b, k)
# This code is contributed by
# Mohit Kumar 29
// Efficient C# program to convert
// all substrings from decimal to given base.
using System;
class GFG
{
static void substringConversions(String str,
int k, int b)
{
int i = 0, sum = 0, counter = k-1;
// Computing the decimal of first window
for (i = 0; i < k; i++)
{
sum = (int) (sum + ((str[i] - '0') *
Math.Pow(b, counter)));
counter--;
}
Console.Write(sum + " ");
// prev stores the previous decimal
int prev = sum;
// Computing decimal equivalents
// of all other windows
sum = 0; counter = 0;
for (; i < str.Length; i++)
{
// Subtracting weight of the element
// pushed out of window
sum = (int) (prev - ((str[i - k] - '0') *
Math.Pow(b, k - 1)));
// Multiplying the decimal by base
// to formulate other window
sum = sum * b;
// Adding the new element of window to sum
sum = sum + (str[i] - '0');
// Decimal of current window
Console.Write(sum + " ");
// Updating prev
prev = sum;
counter++;
}
}
// Driver code
public static void Main(String[] args)
{
String str = "12212";
int b = 3, k = 3;
substringConversions(str, b, k);
}
}
// This code is contributed by Princi Singh
<script>
// Efficient Javascript program to convert
// all substrings from decimal to given base.
function substringConversions(str, k, b)
{
let i = 0, sum = 0, counter = k-1;
// Computing the decimal of first window
for(i = 0; i < k; i++)
{
sum = (sum + ((str[i].charCodeAt(0) -
'0'.charCodeAt(0)) *
Math.pow(b, counter)));
counter--;
}
document.write(sum + " ");
// prev stores the previous decimal
let prev = sum;
// Computing decimal equivalents of
// all other windows
sum = 0; counter = 0;
for(; i < str.length; i++)
{
// Subtracting weight of the element
// pushed out of window
sum = (prev - ((str[i - k].charCodeAt(0) -
'0'.charCodeAt(0)) *
Math.pow(b, k - 1)));
// Multiplying the decimal by base
// to formulate other window
sum = sum * b;
// Adding the new element of window to sum
sum = sum + (str[i].charCodeAt(0) -
'0'.charCodeAt(0));
// Decimal of current window
document.write(sum + " ");
// Updating prev
prev = sum;
counter++;
}
}
// Driver code
let str = "12212";
let b = 3, k = 3;
substringConversions(str, b, k);
// This code is contributed by unknown2108
</script>
Time Complexity: O(n)
Auxiliary Space: O(n)
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn 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
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA 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
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA 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
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem