Programming & Computer Science Answers

Problem : Common Schedule
The Leaders of all countries around the world need to gather in order to sign the World Peace Summit.

Today is the D-Day. Given N countries and the schedule of their leaders for next 24 hours, your task is to find a maximum time slot such that all leaders are available during that period.
Input Format:

The first line contains N, the number of countries.

The following line contains:
1. I - unique id of the leader
2. [A , B) - the time slot when the leader is busy i.e. including time A, but excluding time B

End of input is given by "-1"

Note:
• Each country will have only one representative
• Time slot [A, B) will be in the format HH:MM

Problem : Super ASCII String Cost
A string S is said to be "Super ASCII", if it contains the character frequency equal to their ascii values. String will contain only lower case alphabets ('a'-'z') and the ascii values will starts from 1 (i.e ascii value of 'a' is 1 and 'z' is 26). Now given a string S, you can perform operations, namely, add, delete and replace of any character present in the string. Every operation will consists of following costs

add = 2 unit
replace = 1 unit
delete = 3 unit

Your task is to convert the string to super ascii with the minimum cost. While converting the string to super ascii, the final string should contain the same characters as in the input string.
Input Format:

First line starts with T i.e. number of test cases, and then T lines will follow each containing a string "S".
Output Format:

Print the minimum cost of conversion for each string to a Super Ascii string.
Constraints:
1<=T<=100
1<=|S|<=300, S will contains only lower case alphabets ('a'-'z').
Sample Input

I am a new learner in python. I have completed learning the basics in it. I am in need to learn the "os" module in it. But i am not able to understand it can any one help me in this

Implement FLAMES game
F-Friend
L-Love
A-Affection
M-Marriage
E-Enemy
S-Sister

Problem : Beautiful Substring
A string is said to be "Beautiful", if it contains only non repetitive alphabets. Let S be the string with lower case alphabets, your task is to find out the longest "Beautiful sub-string" present in the given string S.

Input Format:

First line starts with T, which is the number of test cases. Each test case contains string S.
Output Format:

Print the first longest beautiful sub string present in the string S.
Constraints:
1<=T<=10
1<=|S|<=5500, S will contain only lower case alphabets.
Sample Input and Output
SNo. Input Output
1
2
ss
abcdeddd
s
abcde

Note:

Please do not use package and namespace in your code. For object oriented languages your code should be written in one class.
Note:

Participants submitting solutions in C language should not use functions from <conio.h> / <process.h> as these files do not exist in gcc