String Construction


Problem Statement :


Amanda has a string of lowercase letters that she wants to copy to a new string. She can perform the following operations with the given costs. She can perform them any number of times to construct a new string :

Append a character to the end of string  at a cost of  dollar.
Choose any substring of  and append it to the end of  at no charge.
Given  strings , find and print the minimum cost of copying each  to  on a new line.

For example, given a string , it can be copied for  dollars. Start by copying ,  and  individually at a cost of  dollar per character. String  at this time. Copy  to the end of  at no cost to complete the copy.

Function Description

Complete the stringConstruction function in the editor below. It should return the minimum cost of copying a string.

stringConstruction has the following parameter(s):

s: a string
Input Format

The first line contains a single integer n, the number of strings
Each of the next  lines contains a single string, .s[ i ].


Constraints

1  <=   n  <=  5
1  <=  | S[ i ] |  <= 10^5

Output Format

For each string s[ i ] print the minimum cost of constructing a new string p [ i ]  on a new line.


Solution :



title-img 


                            Solution in C :

In   C++  :






#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<bits/stdc++.h>
using namespace std;


int main() {

    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        string s;
        cin>>s;
        set<char> a;
        for(int i=0;i<s.size();i++){
            a.insert(s[i]);
        }
        cout<<a.size()<<endl;
    }
    return 0;
}









In   Java  :






import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        for(int a0 = 0; a0 < n; a0++){
            String s = in.next();
            HashSet<Character> hs=new HashSet<Character>();
            int count=0;
            for(int i=0;i<s.length();i++){
                if(!hs.contains(s.charAt(i))){
                    hs.add(s.charAt(i));
                    count++;
                }
            }
            System.out.println(count);
        }
       
        
    }
}









In  C  :






#include <stdio.h>
#include <string.h>

int main(void) {
	
	int t;scanf("%d",&t);
	while(t--)
{	char inp[100005];
	int i,c=0,l,arr[26];
	for(i=0;i<26;i++)arr[i]=0;
	scanf("%s",inp);
	l=strlen(inp);
	for(i=0;i<l;i++)
	{
	    arr[inp[i]-'a']+=1;
	}
	for(i=0;i<26;i++)
	if(arr[i]!=0)
	c+=1;
	printf("%d\n",c);}
	return 0;
}










In  Python3 :






t = int(input())

for i in range(t):
    s = input()
    print(len(set(s)))








View More Similar Problems

Find the Running Median

The median of a set of integers is the midpoint value of the data set for which an equal number of integers are less than and greater than the value. To find the median, you must first sort your set of integers in non-decreasing order, then: If your set contains an odd number of elements, the median is the middle element of the sorted sample. In the sorted set { 1, 2, 3 } , 2 is the median.

View Solution →

Minimum Average Waiting Time

Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h

View Solution →

Merging Communities

People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w

View Solution →

Components in a graph

There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu

View Solution →

Kundu and Tree

Kundu is true tree lover. Tree is a connected graph having N vertices and N-1 edges. Today when he got a tree, he colored each edge with one of either red(r) or black(b) color. He is interested in knowing how many triplets(a,b,c) of vertices are there , such that, there is atleast one edge having red color on all the three paths i.e. from vertex a to b, vertex b to c and vertex c to a . Note that

View Solution →

Super Maximum Cost Queries

Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and

View Solution →