The latest articles on DEV Community by Jaeheon Shim (@jaeheonshim). https://dev.to/jaeheonshim https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F286783%2F6faf9891-150e-4d10-9f36-53c658bfbef0.jpeg https://dev.to/jaeheonshim en Jaeheon Shim Mon, 13 Apr 2020 15:00:00 +0000 https://dev.to/jaeheonshim/project-euler-problem-6-overview-ifm https://dev.to/jaeheonshim/project-euler-problem-6-overview-ifm <p>In this article, we’ll be exploring Project Euler problem 6. I’ll provide some ideas and hints, but it’ll be up to you to create a...</p> <p>The post <a href="https://jaeheonshim.com/project-euler-problem-6-overview/">Project Euler: Problem 6 Overview</a> appeared first on <a href="https://jaeheonshim.com">Coding with Jaeheon Shim</a>.</p> projecteuler algorithms Jaeheon Shim Mon, 30 Mar 2020 15:00:45 +0000 https://dev.to/jaeheonshim/introducing-my-java-tutorial-series-1o9c https://dev.to/jaeheonshim/introducing-my-java-tutorial-series-1o9c <p>I’ve decided to start a series of articles on my blog dedicated to teaching you, the reader, the basics and fundamentals of Java. In my...</p> <p>The post <a href="https://jaeheonshim.com/introducing-my-java-tutorial-series/">Introducing My Java Tutorial Series</a> appeared first on <a href="https://jaeheonshim.com">Coding with Jaeheon Shim</a>.</p> java javatutorialseries learnjava Jaeheon Shim Mon, 23 Mar 2020 15:49:22 +0000 https://dev.to/jaeheonshim/how-to-learn-java-14be https://dev.to/jaeheonshim/how-to-learn-java-14be <p>I've been working on an article on my blog, Coding with Jaeheon Shim, for quite some time now. </p> <p>In this article, learn why learning Java is a good investment to yourself, and how you can learn Java effectively and retain information.</p> <p>I'll cover why you should learn Java, tips for learning Java, books, videos, and websites for learning Java, and some project ideas for you to use to exercise your Java skills.</p> <p>In this article:</p> <ul> <li>Why learn Java</li> <li>How to learn Java (How to stay motivated, retain information, etc.)</li> <li>Resources for learning Java (books, online courses, websites, communities)</li> <li>Project ideas for learning Java.</li> </ul> <p>Check it out here! <a href="https://jaeheonshim.com/how-to-learn-java/">How to Learn Java</a> on <a href="https://jaeheonshim.com">Coding with Jaeheon Shim</a>.</p> java learnjava studying Jaeheon Shim Mon, 23 Mar 2020 13:49:59 +0000 https://dev.to/jaeheonshim/i-built-a-discord-bot-for-freecodecamp-s-code-radio-3i62 https://dev.to/jaeheonshim/i-built-a-discord-bot-for-freecodecamp-s-code-radio-3i62 <p>Hey everyone, today I want to share a project I decided to make today. </p> <p>If you don't already know, <a href="https://coderadio.freecodecamp&lt;br&gt;%0A.org">code radio</a> is freecodecamp's music stream that plays ambient music for coding 24/7.</p> <p>What I did is, I brought that music stream into a discord bot, so that you can listen to code radio within a discord server.</p> <p>You can add this bot to your own discord server. Click <a href="https://discordapp.com/api/oauth2/authorize?client_id=691360591507619881&amp;permissions=3147776&amp;scope=bot">here</a> to do so.</p> <p>You can find instructions on how to use the bot on its <a href="https://coderadio.jaeheonshim.dev">official home page</a>.</p> <p>Finally, you can find the source code <a href="https://github.com/jaeheonshim/coderadio-bot">here</a>. Stars on the GitHub repository would be really appreciated!</p> <p>Thanks for checking my project out<br> Jaeheon Shim</p> showdev Jaeheon Shim Wed, 18 Mar 2020 13:53:08 +0000 https://dev.to/jaeheonshim/project-euler-problem-5-walkthrough-22g8 https://dev.to/jaeheonshim/project-euler-problem-5-walkthrough-22g8 <p>This article is a full walkthrough on project euler problem 5 where I'll discuss how you can implement the solution to this problem in code.</p> <p>The post <a href="https://jaeheonshim.com/project-euler-problem-5-walkthrough/">Project Euler: Problem 5 Walkthrough</a> appeared first on <a href="https://jaeheonshim.com">Coding with Jaeheon Shim</a>.</p> projecteuler algorithms problemsolving Jaeheon Shim Wed, 04 Mar 2020 17:00:00 +0000 https://dev.to/jaeheonshim/project-euler-problem-5-overview-i0p https://dev.to/jaeheonshim/project-euler-problem-5-overview-i0p <p>Let's take a look at the concepts that we can use to solve project euler problem 5 efficiently. Note that this isn't the actual solution article, in this article I'll just cover the general topics.</p> <p>The post <a href="https://jaeheonshim.com/project-euler-problem-5-overview/">Project Euler: Problem 5 Overview</a> appeared first on <a href="https://jaeheonshim.com">Coding with Jaeheon Shim</a>.</p> projecteuler algorithms problemsolving Jaeheon Shim Sun, 01 Mar 2020 15:02:49 +0000 https://dev.to/jaeheonshim/project-euler-problem-4-walkthrough-49of https://dev.to/jaeheonshim/project-euler-problem-4-walkthrough-49of <p>This article is a full walkthrough on Project Euler problem 4. If you’re stumped on solving this problem, you’re in the right place. This article...</p> <p>The post <a href="https://jaeheonshim.com/project-euler-problem-4-walkthrough/">Project Euler: Problem 4 Walkthrough</a> appeared first on <a href="https://jaeheonshim.com">Coding with Jaeheon Shim</a>.</p> projecteuler java problemsolving Jaeheon Shim Sun, 23 Feb 2020 16:51:55 +0000 https://dev.to/jaeheonshim/i-made-a-chess-library-in-java-1j9h https://dev.to/jaeheonshim/i-made-a-chess-library-in-java-1j9h <p>One day I was feeling pretty bored, so I started making a chess library. I had originally named it ChessBored, but then I decided against...</p> <p>The post <a href="https://jaeheonshim.com/i-made-a-chess-library-in-java/">I Made a Chess Library in Java</a> appeared first on <a href="https://jaeheonshim.com">Coding with Jaeheon Shim</a>.</p> projects java library Jaeheon Shim Fri, 21 Feb 2020 22:23:32 +0000 https://dev.to/jaeheonshim/i-made-a-chess-library-in-java-3hfa https://dev.to/jaeheonshim/i-made-a-chess-library-in-java-3hfa <p>Hey guys, in this post I just wanted to share this project I've been working on for the past couple of weeks.</p> <p>It's basically a library written in Java that represents the game chess. You can create a board, make moves on it, kill pieces, check if a move is valid, castle kings and rooks, etc. It could be used to make a chess game in java, create a chess AI, create an online chess server, etc.</p> <p>My project is hosted on GitHub, and I'd appreciate it if you could check out my hard work. ;)<br> <a href="https://github.com/jaeheonshim/ChessBoard">https://github.com/jaeheonshim/ChessBoard</a></p> <p>You can also find some instructions on how to use the library on GitHub. The library is hosted on maven central and can be downloaded to any project simply by adding my package as a repository.</p> <p>This project is still a work in progress and there are many features left to implement. I just wanted to share the current state of the project.</p> <p>Thanks!<br> Jaeheon</p> chess java library github Jaeheon Shim Fri, 07 Feb 2020 14:53:50 +0000 https://dev.to/jaeheonshim/using-a-vigenere-cipher-to-encrypt-text-4ncg https://dev.to/jaeheonshim/using-a-vigenere-cipher-to-encrypt-text-4ncg <p>The vigenere cipher is a way of hiding your messages that has been around for a long, long time. In fact, it was first described by Giovan Battista Bellaso in 1553. It became so popular back then because the cipher was easy to understand and implement, but remained unbroken until 1863, three centuries later. </p> <p>You can build your own vigenere cipher as well with just a little bit of code. While the example I provided here is in Java, the same concept applies to many other languages.</p> <p>My example of the vigenere cipher can be found on GitHub <a href="https://github.com/jaeheonshim/VigenereCipher/">here</a>.</p> <h1> How a Vigenere Cipher works </h1> <h2> Polyalphabetic Substitution </h2> <p>Polyalphabetic substitution is a method for encrypting text using a substitution alphabet. This means that letters from the original text get substituted into an alphabet to encrypt them. To decrypt the text, you need only the shift value and perform the substitution process backwards. </p> <p>Below is an example of a simple case of polyalphabetic substitution.</p> <div class="table-wrapper-paragraph"><table> <thead> <tr> <th><strong>A</strong></th> <th><strong>B</strong></th> <th><strong>C</strong></th> <th><strong>D</strong></th> <th><strong>E</strong></th> <th><strong>F</strong></th> <th><strong>G</strong></th> <th><strong>H</strong></th> <th><strong>I</strong></th> <th><strong>J</strong></th> <th><strong>K</strong></th> <th><strong>L</strong></th> <th><strong>M</strong></th> <th><strong>N</strong></th> <th><strong>O</strong></th> <th><strong>P</strong></th> <th><strong>Q</strong></th> <th><strong>R</strong></th> <th><strong>S</strong></th> <th><strong>T</strong></th> <th><strong>U</strong></th> <th><strong>V</strong></th> <th><strong>W</strong></th> <th><strong>X</strong></th> <th><strong>Y</strong></th> <th><strong>Z</strong></th> </tr> </thead> <tbody> <tr> <td><strong>Z</strong></td> <td><strong>A</strong></td> <td><strong>B</strong></td> <td><strong>C</strong></td> <td><strong>D</strong></td> <td><strong>E</strong></td> <td><strong>F</strong></td> <td><strong>G</strong></td> <td><strong>H</strong></td> <td><strong>I</strong></td> <td><strong>J</strong></td> <td><strong>K</strong></td> <td><strong>L</strong></td> <td><strong>M</strong></td> <td><strong>N</strong></td> <td><strong>O</strong></td> <td><strong>P</strong></td> <td><strong>Q</strong></td> <td><strong>R</strong></td> <td><strong>S</strong></td> <td><strong>T</strong></td> <td><strong>U</strong></td> <td><strong>V</strong></td> <td><strong>W</strong></td> <td><strong>X</strong></td> <td><strong>Y</strong></td> </tr> </tbody> </table></div> <p>This cipher table is just the alphabet shifted to the right by one letter. This table can be used to substitute letters and encode text:</p> <p>Jaeheon Shim -----&gt; IZDGDNM RGHL</p> <p>To form this encoding, I just found the letters of my name one by one on the first row of the text, and replaced that letter with the one directly below the row.</p> <p>However, this form of encryption is not very secure. In fact, it is not secure at all. Someone trying to crack this would only have to try 26 different combinations for the cipher table, which is a trivial task for a computer.</p> <p>The Vigenere Cipher improves upon this by using multiple substitution alphabets.</p> <h2> The Vigenere Cipher </h2> <p>The cipher table for a Vigenere cipher consists of the alphabet written out 26 times in 26 different rows, each alphabet shifted one letter to the left compared to the previous alphabet.<br><br> The alphabet used for substitution depends on a keyword, known as our key.</p> <p>This is what the table looks like for the Vigenere Cipher:</p> <div class="table-wrapper-paragraph"><table> <thead> <tr> <th>A</th> <th>B</th> <th>C</th> <th>D</th> <th>E</th> <th>F</th> <th>G</th> <th>H</th> <th>I</th> <th>J</th> <th>K</th> <th>L</th> <th>M</th> <th>N</th> <th>O</th> <th>P</th> <th>Q</th> <th>R</th> <th>S</th> <th>T</th> <th>U</th> <th>V</th> <th>W</th> <th>X</th> <th>Y</th> <th>Z</th> </tr> </thead> <tbody> <tr> <td><strong>B</strong></td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> <td>H</td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> </tr> <tr> <td><strong>C</strong></td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> <td>H</td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> </tr> <tr> <td><strong>D</strong></td> <td>E</td> <td>F</td> <td>G</td> <td>H</td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> </tr> <tr> <td><strong>E</strong></td> <td>F</td> <td>G</td> <td>H</td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> </tr> <tr> <td><strong>F</strong></td> <td>G</td> <td>H</td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> </tr> <tr> <td><strong>G</strong></td> <td>H</td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> </tr> <tr> <td><strong>H</strong></td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> </tr> <tr> <td><strong>I</strong></td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> <td>H</td> </tr> <tr> <td><strong>J</strong></td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> <td>H</td> <td>I</td> </tr> <tr> <td><strong>K</strong></td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> <td>H</td> <td>I</td> <td>J</td> </tr> <tr> <td><strong>L</strong></td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> <td>H</td> <td>I</td> <td>J</td> <td>K</td> </tr> <tr> <td><strong>M</strong></td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> <td>H</td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> </tr> <tr> <td><strong>N</strong></td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> <td>H</td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> </tr> <tr> <td><strong>O</strong></td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> <td>H</td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> </tr> <tr> <td><strong>P</strong></td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> <td>H</td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> </tr> <tr> <td><strong>Q</strong></td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> <td>H</td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> </tr> <tr> <td><strong>R</strong></td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> <td>H</td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> </tr> <tr> <td><strong>S</strong></td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> <td>H</td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> </tr> <tr> <td><strong>T</strong></td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> <td>H</td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> </tr> <tr> <td><strong>U</strong></td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> <td>H</td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> </tr> <tr> <td><strong>V</strong></td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> <td>H</td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> </tr> <tr> <td><strong>W</strong></td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> <td>H</td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> </tr> <tr> <td><strong>X</strong></td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> <td>H</td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> </tr> <tr> <td><strong>Y</strong></td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> <td>H</td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> </tr> <tr> <td><strong>Z</strong></td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> <td>H</td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> </tr> </tbody> </table></div> <p>Here is an example of using the viginere cipher to encrypt a string of text.</p> <p>For this example, I'll be using my first name, jaeheon, as the text to encrypt, and my last name, shim, as the key.</p> <p><strong>Step 1</strong> <br> Step 1 is to repeat my key until it is the same length as the text I want to encrypt. Likewise, if my key was longer than the text, it would be truncated to match the length.</p> <p>shimshi </p> <p>As you can see, I repeated the key and then truncated it to fit the length of my text but not exceed it. In practice there would not be a huge problem if the key was longer than the text, but it is still good to trim it so that we can avoid code errors.</p> <p><strong>Step 2</strong><br> The second step is to actually encode the letters.<br> For every letter in my text, I will first find the row in the cipher table that starts with the corresponding letter of the key. For example, if I wanted to encode the second letter of my name I would need to find the row that starts with h, since that is the second letter of my key.</p> <div class="table-wrapper-paragraph"><table> <thead> <tr> <th>A</th> <th>B</th> <th>C</th> <th>D</th> <th>E</th> <th>F</th> <th>G</th> <th>H</th> <th>I</th> <th>J</th> <th>K</th> <th>L</th> <th>M</th> <th>N</th> <th>O</th> <th>P</th> <th>Q</th> <th>R</th> <th>S</th> <th>T</th> <th>U</th> <th>V</th> <th>W</th> <th>X</th> <th>Y</th> <th>Z</th> </tr> </thead> <tbody> <tr> <td>H</td> <td>I</td> <td>J</td> <td>K</td> <td>L</td> <td>M</td> <td>N</td> <td>O</td> <td>P</td> <td>Q</td> <td>R</td> <td>S</td> <td>T</td> <td>U</td> <td>V</td> <td>W</td> <td>X</td> <td>Y</td> <td>Z</td> <td>A</td> <td>B</td> <td>C</td> <td>D</td> <td>E</td> <td>F</td> <td>G</td> </tr> </tbody> </table></div> <p>Now to find the actual letter to substitute, we can treat this as a normal substitution cipher and get the letter that corresponds with the second letter in the text to encrypt. In this case that would be h, because <strong>a</strong> corresponds with <strong>h</strong> in the table. This can be repeated with every letter in the text being encrypted.</p> <p>By using this process, the shift of the substitution table is determined by the key, and there are multiple degrees of shifting as not every letter in the key is the same.</p> <p>The same process can be repeated backwards to decrypt text.</p> encryption java Jaeheon Shim Tue, 04 Feb 2020 03:01:19 +0000 https://dev.to/jaeheonshim/project-euler-problem-3-walkthrough-42jj https://dev.to/jaeheonshim/project-euler-problem-3-walkthrough-42jj <p>This serves as a full walkthrough to the solution for Project Euler problem 3. Stay tuned for future project Euler walkthroughs, and stick around to...</p> <p>The post <a href="https://jaeheonshim.com/project-euler-problem-3-walkthrough/">Project Euler: Problem 3 Walkthrough</a> appeared first on <a href="https://jaeheonshim.com">Coding with Jaeheon Shim</a>.</p> projecteuler primefactors Jaeheon Shim Sun, 19 Jan 2020 21:56:00 +0000 https://dev.to/jaeheonshim/project-euler-problem-2-walkthrough-40k9 https://dev.to/jaeheonshim/project-euler-problem-2-walkthrough-40k9 <p>This article is a full walkthrough to the solution for Project Euler problem 2. Stick around to see how I solved this problem. This article...</p> <p>The post <a href="https://jaeheonshim.com/project-euler-problem-2-walkthrough/">Project Euler: Problem 2 Walkthrough</a> appeared first on <a href="https://jaeheonshim.com">Coding with Jaeheon Shim</a>.</p> projecteuler