All Tracks Algorithms String Algorithms Basics of String Manipulation Problem

Print first Occurence
Tag(s):
No tags
Problem
Editorial
Analytics

Given a string containing only lower case letters ,print first occurrence of all the letters present in that order only.

Input :

  • Test cases, t
  • string ,s

Output :

Desired Output

Constraint :

string length <=200

SAMPLE INPUT
2
aasdvasvavda
sajhags
SAMPLE OUTPUT
asdv
sajhg
Time Limit: 1.0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB
Marking Scheme: Marks are awarded when all the testcases pass.
Allowed Languages: Bash, C, C++, C++14, C++17, Clojure, C#, D, Erlang, F#, Go, Groovy, Haskell, Java, Java 8, Java 14, JavaScript(Rhino), JavaScript(Node.js), Julia, Kotlin, Lisp, Lisp (SBCL), Lua, Objective-C, OCaml, Octave, Pascal, Perl, PHP, Python, Python 3, Python 3.8, R(RScript), Racket, Ruby, Rust, Scala, Swift-4.1, Swift, TypeScript, Visual Basic

CODE EDITOR

Initializing Code Editor...
Your Rating:

Contributor

Notifications
View All Notifications

?