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 :
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
Print in Reverse
Given a pointer to the head of a singly-linked list, print each data value from the reversed list. If the given list is empty, do not print anything. Example head* refers to the linked list with data values 1->2->3->Null Print the following: 3 2 1 Function Description: Complete the reversePrint function in the editor below. reversePrint has the following parameters: Sing
View Solution →Reverse a linked list
Given the pointer to the head node of a linked list, change the next pointers of the nodes so that their order is reversed. The head pointer given may be null meaning that the initial list is empty. Example: head references the list 1->2->3->Null. Manipulate the next pointers of each node in place and return head, now referencing the head of the list 3->2->1->Null. Function Descriptio
View Solution →Compare two linked lists
You’re given the pointer to the head nodes of two linked lists. Compare the data in the nodes of the linked lists to check if they are equal. If all data attributes are equal and the lists are the same length, return 1. Otherwise, return 0. Example: list1=1->2->3->Null list2=1->2->3->4->Null The two lists have equal data attributes for the first 3 nodes. list2 is longer, though, so the lis
View Solution →Merge two sorted linked lists
This challenge is part of a tutorial track by MyCodeSchool Given pointers to the heads of two sorted linked lists, merge them into a single, sorted linked list. Either head pointer may be null meaning that the corresponding list is empty. Example headA refers to 1 -> 3 -> 7 -> NULL headB refers to 1 -> 2 -> NULL The new list is 1 -> 1 -> 2 -> 3 -> 7 -> NULL. Function Description C
View Solution →Get Node Value
This challenge is part of a tutorial track by MyCodeSchool Given a pointer to the head of a linked list and a specific position, determine the data value at that position. Count backwards from the tail node. The tail is at postion 0, its parent is at 1 and so on. Example head refers to 3 -> 2 -> 1 -> 0 -> NULL positionFromTail = 2 Each of the data values matches its distance from the t
View Solution →Delete duplicate-value nodes from a sorted linked list
This challenge is part of a tutorial track by MyCodeSchool You are given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete nodes and return a sorted list with each distinct value in the original list. The given head pointer may be null indicating that the list is empty. Example head refers to the first node in the list 1 -> 2 -
View Solution →