Semaine 26 : projets fil rouge

Objectifs

• Boucler les projets fil rouge
• Apprendre à bosser en groupeS
• Apprendre à faire un audit web

Lundi

Présentation projets pédago

Veille de la semaine

Fil rouge : audit

Aujourd'hui, chaque groupe va mener un audit sur le projet de l'autre groupe qui a bossé sur la même problématique. Ceci amène donc plusieurs questions :

• Comment mener un audit? Avec quels outils?
• Comment rester bienveillant?
• Sous quelle forme présenter le résultat de l'audit?

Mardi

Kata

Problem

Using the JavaScript language, have the function CorrectPath(str) read the str parameter being passed, which will represent the movements made in a 5x5 grid of cells starting from the top left position. The characters in the input string will be entirely composed of: r, l, u, d, ?. Each of the characters stand for the direction to take within the grid, for example: r = right, l = left, u = up, d = down. Your goal is to determine what characters the question marks should be in order for a path to be created to go from the top left of the grid all the way to the bottom right without touching previously travelled on cells in the grid.

For example: if str is "r?d?drdd" then your program should output the final correct string that will allow a path to be formed from the top left of a 5x5 grid to the bottom right. For this input, your program should therefore return the string rrdrdrdd. There will only ever be one correct path and there will always be at least one question mark within the input string.

Test Cases

Input:"???rrurdr?" Output:"dddrrurdrd"

Input:"drdr??rrddd?" Output:"drdruurrdddd"

Projet fil rouge : résultats de l'audit

• Présentation des résultats de l'audit.
• Dans votre projet, prenez en compte les résultats de l'audit qui vous semblent pertinents.

Mercredi

Révisions

Projet fil rouge : PWA

Transformez votre projet en PWA (accessible offline, responsive, splash screen, icône).

Jeudi

Randori

Problem

Using the JavaScript language, have the function ClosestEnemyII(strArr) read the matrix of numbers stored in strArr which will be a 2D matrix that contains only the integers 1, 0, or 2. Then from the position in the matrix where a 1 is, return the number of spaces either left, right, down, or up you must move to reach an enemy which is represented by a 2. You are able to wrap around one side of the matrix to the other as well. For example: if strArr is ["0000", "1000", "0002", "0002"] then this looks like the following:

0 0 0 0 1 0 0 0 0 0 0 2 0 0 0 2

For this input your program should return 2 because the closest enemy (2) is 2 spaces away from the 1 by moving left to wrap to the other side and then moving down once. The array will contain any number of 0's and 2's, but only a single 1. It may not contain any 2's at all as well, where in that case your program should return a 0.

Test Cases

Input:"000", "100", "200" Output:1

Input:"0000", "2010", "0000", "2002" Output:2

Projet fil rouge : bonus

Avec l'un des groupes qui a travaillé sur l'autre problématique, voyez comment gérer les flux de données entre vos applications. Exemple : si un terme technique apparaît sur l'arbre de compétences, il doit être lié à sa définition dans le glossaire.

Vendredi