Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)
Fulltime,Contract to Hire
No LinkedIn Profile
No GitHub Profile
No StackOverflow Profile
You are given two sorted list of numbers (ascending order). The lists themselves are comma delimited and the two lists are semicolon delimited. Print out the intersection of these two sets.
File containing two lists of ascending order sorted integers, comma
delimited, one per line. E.g.
1,2,3,4;4,5,6 20,21,22;45,46,47 7,8,9;8,9,10,11,12
Print out the ascending order sorted intersection of the two lists,
one per line. Print empty new line in case the lists have
no intersection. E.g.
Write a program which determines the Mth to the last element in a list.
The first argument is a path to a file. The file contains the series of space delimited characters followed by an integer. The integer represents an index in the list (1-based), one per line.
Print to stdout the Mth element from the end of the list, one per line. If the index is larger than the number of elements in the list, ignore that input.
Write a program which reads a file and prints to stdout the specified number of the longest lines that are sorted based on their length in descending order.
Your program should accept a path to a file as its first argument. The file contains multiple lines. The first line indicates the number of lines you should output, the other lines are of different length and are presented randomly. You may assume that the input file is formatted correctly and the number in the first line is a valid positive integer.
Print out the longest lines limited by specified number and sorted by their length in descending order.
You are given a piece of text. Your job is to write a program that sets the case of text characters according to the following rules:
The first argument will be a path to a filename containing sentences, one per line. You can assume that all characters are from the English language.
Print to stdout the RoLlErCoAsTeR case version of the string.
The length of each piece of text does not exceed 1000 characters.
Write a program which prints all the permutations of a string in alphabetical order. We consider that digits < upper case letters < lower case letters. The sorting should be performed in ascending order.
Your program should accept a file as its first argument. The file contains input strings, one per line.
Print to stdout the permutations of the string separated by comma, in alphabetical order.
You have coordinates of 2 points and need to find the distance between them.
Your program should accept as its first argument a path to a filename. Input example is the following
All numbers in input are integers between -100 and 100.
Print results in the following way.
You don't need to round the results you receive. They must be integer numbers.
Given a list of numbers and a positive integer k, reverse the elements of the list, k items at a time. If the number of elements is not a multiple of k, then the remaining items in the end should be left as is.
Your program should accept as its first argument a path to a filename. Each line in this file contains a list of numbers and the number k, separated by a semicolon. The list of numbers are comma delimited. E.g.
Print out the new comma separated list of numbers obtained after reversing. E.g.
Given a string write a program to convert it into lowercase.
The first argument will be a path to a filename containing sentences, one per line. You can assume all characters are from the english language. E.g.
HELLO CODEEVAL This is some text
Print to stdout, the lowercase version of the sentence, each on a new line. E.g.
hello codeeval this is some text
Write a program which removes specific characters from a string.
The first argument is a path to a file. The file contains the source strings and the characters that need to be scrubbed. Each source string and characters you need to scrub are delimited by comma.
Print to stdout the scrubbed strings, one per line. Ensure that there are no trailing empty spaces on each line you print.
The Fibonacci series is defined as: F(0) = 0; F(1) = 1; F(n) = F(n–1) + F(n–2) when n>1. Given an integer n≥0, print out the F(n).
The first argument will be a path to a filename containing integer numbers, one per line. E.g.
Print to stdout, the fibonacci number, F(n). E.g.
Print the odd numbers from 1 to 99.
There is no input for this program.
Print the odd numbers from 1 to 99, one number per line.
Write a program which reverses the words in an input sentence.
The first argument is a file that contains multiple sentences, one per line. Empty lines are also possible.
Print to stdout each sentence with the reversed words in it, one per line. Empty lines in the input should be ignored. Ensure that there are no trailing empty spaces in each line you print.