This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<h1 class="line red">Rookies du samedi</h1> | |
<p>décompte : <span id="decompte"></span> </p> | |
<ul class="line"> | |
<li class="li"><div> | |
<h2 onmouseover="over()">George</h2> | |
<P>Mes objectifs : Besoin de me dérouiller sur HTML, CSS et JS. Arriver à coder rapidement et faire des katas et exercices algorithmiques.</P> | |
</div></li> | |
<li class="li"><div> | |
<h2 onmouseover="over()" onmouseover="over()" onmouseover="over()">Andy</h2> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
> primaa-test-back@0.0.0 start /usr/src/app/primaa_test_back | |
> node ./bin/www | |
internal/modules/cjs/loader.js:905 | |
throw err; | |
^ | |
Error: Cannot find module '/usr/src/app/primaa_test_back/bin/www' | |
at Function.Module._resolveFilename (internal/modules/cjs/loader.js:902:15) | |
at Function.Module._load (internal/modules/cjs/loader.js:746:27) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import collections | |
def find_it(seq): | |
varseq = collections.Counter(seq) | |
return [key for key,val in varseq.items() if val%2][0] | |
find_it([1,1,1,1,1,1,10,1,1,1,1]) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import unittest | |
from unittest.mock import patch, Mock | |
from amiga import get_vm_yoyo | |
from amiga import get_vm_yaya | |
RAW_PVE_VM_CONFIG_EXAMPLE = """bou bou | |
""" |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import que_ans | |
from termcolor import colored | |
def question_answer(): | |
good = 0 | |
bad = 0 | |
while True: | |
qa = que_ans.QA | |
question,answer = qa.new() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from random import randrange | |
class QA: | |
# use an enum for that | |
def new(rand_val=None): | |
rand_val = randrange(0,7) | |
print(rand_val) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
''' | |
This is probably by far the most common string manipulation interview question. Given an input string, reverse all the words. | |
To clarify, | |
input: “Interviews are awesome!” | |
output: “awesome! are Interviews”. | |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
''' | |
# Question 6 creer une classe Mot avec un attribut mot et une fonction comptelettre | |
# qui prend un parametre une chaine d'une lettre et revoie le nombre d'occurences | |
#dans le mot. attenton cela ne doit pas entre sensible a la casse | |
>>> mot = Mot('Bonjour') | |
>>> mot.mot | |
'Bonjour' | |
>>> mot.comptelette('o') | |
2 | |
>>> mot.comptelettre('B') == mot.comptelettre('b') == 1 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
''' | |
E-MIAGE D351 - Processus stochastiques et simulation | |
Devoir 1 Q1 - Pile ou face - vous le programmez | |
Vous disposez au départ de 100 €. | |
Vous lancer une pièce: | |
Si vous avez pile, vous multipliez vos avoirs par 1.5 (ou 150%) | |
Si vous avez face, vous perdez 40% de vos avoirs (vous les multipliez par 0.6 ou 60%). | |
Ainsi, par exemple, vous acceptez de jouer, on vous donne les 100 € et vous lancez la pièce. | |
Vous avez pile, on vous donne 50 € et vous avez désormais 150€. | |
Vous relancez une pièce, vous avez face. Vous rendez 40% de vos avoirs, soit 60 €, il vous reste donc 90 €. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
''' | |
E-MIAGE D351 - Processus stochastiques et simulation | |
Devoir 1 Q1 - Pile ou face - vous le programmez | |
Vous disposez au départ de 100 €. | |
Vous lancer une pièce: | |
Si vous avez pile, vous multipliez vos avoirs par 1.5 (ou 150%) | |
Si vous avez face, vous perdez 40% de vos avoirs (vous les multipliez par 0.6 ou 60%). | |
Ainsi, par exemple, vous acceptez de jouer, on vous donne les 100 € et vous lancez la pièce. | |
Vous avez pile, on vous donne 50 € et vous avez désormais 150€. | |
Vous relancez une pièce, vous avez face. Vous rendez 40% de vos avoirs, soit 60 €, il vous reste donc 90 €. |
NewerOlder