UsefullTools

TODO

• boolean isVoyelle(char c);
• boolean contientDesVoyelles(String s);
• int compteVoyelles(String str)
• String inverserTousLesDeuxCaracteres();
• String reverseString();
• boolean isPair(int i);
• boolean isWordInHashMap(HashMap<String, String> map, String word);
• boolean isIntegerInHashMap(HashMap<Integer,Integer> map, int value);
• Préparer une série de fonction permettant de rechercher dans HashMap String, String, HashMap Integer,Integer (attention, bien mettre le Integer et pas int)
• Fonction de recherche dans un tableau à deux dimension, que ce soit String ou int
• Fonction de lecture/écriture utilisateur/fichier
• Séparer une chaine en fonction d'un séparateur: split

Training

• Given two strings, write a program that efficiently finds the longest common subsequence.
• Given an array with numbers, write a program that efficiently answers queries of the form: “Which is the nearest larger value for the number at position "i", where distance is the difference in array indices. For example in the array [1,4,3,2,5,7], the nearest larger value for 4 is 5. After linear time preprocessing you should be able to answer queries in constant time.
• Given two strings, write a program that outputs the shortest sequence of character insertions and deletions that turn one string into the other.
• Write a function that multiplies two matrices together.