A Pen by Charlie Chrisman on CodePen.
This file contains hidden or 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
| <?xml version="1.0" encoding="UTF-8"?> | |
| <Response> | |
| <Speak language="en-US" voice="MAN"> | |
| Congratulations! You have successfully made a call with Salesforce and Plivo. | |
| </Speak> | |
| <Speak language="fr-FR" voice="WOMAN> | |
| Félicitations! Vous avez réussi à faire un appel en utilisant Salesforce et Plivo. | |
| </Speak> | |
| <Speak language="es-US" voice="MAN"> | |
| ¡Enhorabuena! Usted ha realizado con éxito una llamada con Salesforce y Plivo. |
This file contains hidden or 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
| <?xml version="1.0" encoding="UTF-8"?> | |
| <Response> | |
| <Play>https://s3.amazonaws.com/plivocloud/Trumpet.mp3</Play> | |
| </Response> |
This file contains hidden or 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
| // WDI Week 2 problems | |
| // Problem 1: Factorial using recursion | |
| function factorial(n) { | |
| if (n < 0) return "error"; //can't do factorial with negative numbers | |
| else if (n < 2) return 1; //terminal condition | |
| else return factorial(n - 1) * n; | |
| } | |
| console.log("\nfactorial"); | |
| console.log(factorial(5)); // => 120 |
This file contains hidden or 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
| function isPrime(num) { | |
| for ( var i = 2; i < num; i++ ) { | |
| if ( num % i === 0 ) { | |
| return false; | |
| } | |
| } | |
| return true; | |
| } | |
| y = 2 |
NewerOlder