Untitled

[jatinmandav3-blog]

Explanatory Data Analysis on Stack OverFlow Data

StackOverflow.com is an online question-and-answer site for programmers. Started in fall 2008, its rich feature set brought rapid popularity: users can ask and answer questions, collaboratively tag and edit questions, vote on the quality of answers, and post comments on individual questions and answers.

Dataset of answers posted between February 18 2009 to Jun 7 2009. Although this dataset does…

View On WordPress

[jatinmandav3-blog]

Sentiment Analysis Using Word2Vec, FastText and Universal Sentence Encoder in Keras

Sentiment Analysis Using Word2Vec, FastText and Universal Sentence Encoder in Keras

Opinion mining (sometimes known as sentiment analysis or emotion AI) refers to the use of natural language processing, text analysis, computational linguistics, and biometrics to systematically identify, extract, quantify, and study affective states and subjective information. Sentiment analysis is widely applied to voice of the customer materials such as reviews and survey responses, online and…

View On WordPress

[jatinmandav3-blog]

I attempt to recreate one of the most popular Android or iOS Game, Angry Birds in Python using PyGame.

If you have never played it heard about it, here is the link to original game: Angry Birds Classic – Android, Angry Birds Classic – iOS

The Game

Angry Birds follows the story that the survival of Angry Birds is at stake as the Piggies have stolen their eggs and the Birds now have to destroy the greedy pig’s defenses! In my attempt to recreate this game, I follow the same plot story i.e., destroy the pig’s defenses and kill the all!

To clear any particular level, you must kill all the pigs with given number of Birds. My version of Angry Birds contains 15 different levels each a very tiny bit tricky than the previous. Feel free to clear all the levels! 🙂

The Code

The whole game is divided in 5 sub-modules.

main.py: Starts the Game!

physics_engine.py: Class PIGS, Class BIRDS, Class BLOCKS, func COLLISION HANDLER

objects.py: Class SLABS or WALLS

maps.py: Sets all the Maps of different Levels

interface.py: Class BUTTONS and Class LABELS for User Interface

  Link to Code on GitHub: Gaming-in-Python/Angry_Birds

Code for Other Games in Python: Gaming-in-Python

During the Coding process, I decided set a stopwatch and capturing screen-shots of the whole thing, using a simple python script which takes screen-shots at regular intervals. After completion, I made a quick Time Lapse Video from the Screen-shots and here is the result: Angry Birds – 14 Hour Time Lapse

A like would be appreciated, this is what keeps me going! 😉

Let me know your thoughts in the Comment Section Below or you can tweet me @jatinmandav.

Also let me know what game would you like me to code next!

This slideshow requires JavaScript.

This slideshow requires JavaScript.

YouTube Channel: MANDAV

GitHub Profile: Jatin Mandav

Twitter: @jatinmandav

  You May Also Like:

A.I Learns to Drive

A.I. learns to play Flappy-Bird

Explorers – Using Genetic Algorithm

Battles – Game inspired by Clash Of Clans

#CodingOf218

8 Ball Pool in Python

                                                      Angry Birds in Python Using PyGame I attempt to recreate one of the most popular Android or iOS Game, Angry Birds in Python using PyGame.

[jatinmandav3-blog]

In this post, I present to you an implementation of A.I. that tries to learn to drive through any track.

Here A.I. tries to learn using the combination of Genetic Algorithm and Neural Networks. Neural Network here is a simple feed forward network which acts as a driver for the “car” and it learns using genetic algorithm.

The “Frame work” in which the tracks and stuff are created is using PyGame in Python 2.7

You can get a quick idea about  genetic algorithm from A.I. learns to play Flappy-Bird!

You can watch the learning in action here!

Population size: 10

Crossover Technique:

Crossover Technique used in this Implementation

Mutation Rate: 5%

Selection Technique: Selection is carried out according to their fitness. Higher the fitness, the more is the probability of getting that as Parent.

Neural Network:

Network used is a simple feed forward network with 4 input and 3 output with 1 hidden layer of size 5 neurons.

Neural Network used in this implementation

The four inputs to the neural network are the lengths measured by the 4 “sensors” in the car.

4 “sensors” in the car

Fitness is measured as the distance traveled by the “car” from the start position.

The 3 output neuron tells whether to move right, or no change in direction or move left.

Neuron 1: Move Right

Neuron 2: go straight or no change in direction

Neuron 3: Move Left

The neuron with max value from the three is considered as the decision of the network.

This slideshow requires JavaScript.

Let me know your thoughts in the comments and please like, subscribe its what makes me going!

YouTube Channel: MANDAV

GitHub Profile: Jatin Mandav

Twitter: @jatinmandav

#CodingOf218 #Happy Coding

You May Also Like:

A.I. learns to play Flappy-Bird

Explorers – Using Genetic Algorithm

Battles – Game inspired by Clash Of Clans

#CodingOf218

8 Ball Pool in Python

A.I Learns to Drive In this post, I present to you an implementation of A.I. that tries to learn to drive through any track.

[jatinmandav3-blog]

Genetic Algorithm, one of the algorithm that fascinate me the most, when combined with Neural Networks, can be really powerful. In this post I present to an implementation of AI playing Flappy-Bird, Using Neural-Networks and Genetic Algorithm.

This small project has been programmed in using Python. Everything has been coded from scratch! The actual game using PyGame and Neural Network implementation using Numpy and Random. Pickle and cPickle Libraries are also been used to save the best neural network for later use.

Let’s Start!

Genetic Algorithm? What is it? Genetic Algorithm is inspired by process of natural selection that belongs to the larger class of evolutionary algorithms. GAs are commonly used to generate high-quality solutions to optimization and search problems by relying on bio-inspired operators such as mutation, crossover and selection. Generation over generation, the population gets “smarter” and “more close to the desired result”. Broadly 4 steps are there for this Algorithm 1. Creating population: To evolve the required result you first need a population to start with. The initial population is created with randomly generated DNA, In this implementation, population size is 12. 2. Calculation of the Fitness: From the given population, calculating their fitness function you decide, In this implementation, The more distance the “species” travel, the more it is “fit”. 3. Reproduction:     a. Selection: Selecting the parents from the population according to their “fitness”, i.e., The more fit and individual is, the more likely is it to be picked. b. Crossover: Creating child DNA from the two chosen parent DNAs.

Crossover technique used in this implementation

c. Mutation: Mutate the child population based on mutation rate. Here mutation rate is 30%. 4. Replacing the Parents:  Finally the parent population is replaced by the child population and the process continuous.

The Neural Network The Neural Network here acts like the brain of the bird/species which allows the bird/species to think whether to go up or down. NN here is a 3 layer Feed Forward Neural Network. First or Input Layer is of 5 neurons, second or hidden layer is of 4 neurons, and third or output layer is of 1 neuron. If the output is of value greater than 0.5, the bird/species jumps/flaps/moves up, and if less than 0.5, it goes down.

3-Layer Neural Network

The 5 inputs to the Neural Network are: 1. X – coordinate of the front – most “pillar”. 2. Y – Coordinate of the lower part of the Upper “Pillar” i.e., (0 + height of Upper pillar) 3. Y – Coordinate of the upper part of the Lower “Pillar” 4. X – Coordinate of the Bird/Species itself 5. y – Coordinate of the Bird/Species itself

For the first Layer of the Neural Network, the activation function is a combination of ReLU and Softmax, and for the second activation function is sigmoid.

This slideshow requires JavaScript.

  You can watch the game and AI in action here!

For me combination of Genetic Algorithm and Neural Network seems really powerful at the moment. I will probably play with this for a while and will be making some more of such AI based games! If you have any suggestions or ideas or challenges that you would like me to code, let me know in the comments below!

Let me know your thoughts in the comments and please like, subscribe its what makes me going!

YouTube Channel: MANDAV

GitHub Profile: Jatin Mandav

Twitter: @jatinmandav

#CodingOf218 #Happy Coding

You May Also Like:

Explorers – Using Genetic Algorithm

Battles – Game inspired by Clash Of Clans

#CodingOf218

Programming Languages – 2017

Two Dice Roll Graph Simulation in Python

Snake Game in Python

8 Ball Pool in Python

A.I. learns to play Flappy-Bird Genetic Algorithm, one of the algorithm that fascinate me the most, when combined with Neural Networks, can be really powerful.

[jatinmandav3-blog]

In the last 2 weeks of December 2017, I challenged myself to code a game similar to the popular mobile video game, Clash Of Clans. And by 30th of December 2017 I completed this game and am here to share it with you guys!

Battles in completely coded using PyGame library in Python 2.7.

Not familiar with Clash Of Clans? Clash of Clans is a freemium mobile strategy video game developed and published by Finnish game developer Supercell. The game was released for iOS platforms on August 2, 2012, and on Google Play for Android on October 7, 2013.

The game is set in a fantasy themed persistent world where the player is a chief of a village. Clash of Clans tasks players to build their own town using the resources gained from attacking other players through the game’s fighting features. The main resources are gold, elixir and dark elixir. Players can conjoin to create clans, groups of up to fifty people who can then partake in Clan Wars together, donate and receive troops, and talk with each other. [Source: Wikipedia]

You can download the game here : CoC for Android, CoC for iOS

About Battles Battles allows you to attack predefined bases with fixed troops. The troops gets unlocked and the level increases automatically as you progress through the game. Also the Defense Structures gets unlocked and the level of structures increases as well! The most important Building is the “Headquarters” which is a pentagon shaped building usually in the middle of the base. Destroying HQ will earn you 1 star. If your damage percent crosses 50%, you will be rewarded another star and finally destroying everything will reward you another star!

Troops Troops that are available are : Shooters (Levels 1-5), Tanks (Level 1-4) and Helicopter (Level 1-3). My personal favorite is the Level 3 Helicopter!

Shooters Level 1 – 5

Tanks Level 1 – 4

Helicopters Level 1 – 3

  Defense Structures and Other Buildings Structures in the Base :  Cannons (Level 1-4), Mortars (Level 1-3), Towers (Level 1-4) and Headquarters (Level 1 – 5)

Cannons Level 1 – 4

Mortars Level 1 – 3

Towers Level 1 – 4

Headquarters Level 1 – 5

Creating Maps and Custom Mode You can create your own maps with different levels of buildings and attack on them in custom mode! Where you have access to any level of troops you like!

Here are some game play screenshots:

This slideshow requires JavaScript.

  The Code The entire code of the game is divided into 4 Libraries : Troops.py, Structures.py, GUI.py and Maps.py. And these libraries are called in Battles.py. You can find the entire code to the game in my GitHub Repository whose link is given below. You can also download the game (in .exe form i.e., ready to go application) which also uploaded in the repository.

Link to code: GitHub Link Link to Video: Video on YouTube

Let me know your thoughts in the comment section below and if you enjoyed the game or learned something new, like and share this because this is what keeps me going!

And finally I am going to start my this years challenge, #CodingOf218 from 7th of January! If you too have made this your 2018’s challenge let me know by tweeting with #CodingOf218 hashtag in your tweet!

You May Also like :

Explorers – Using Genetic Algorithm

#CodingOf218

Programming Languages – 2017

Stacks in Python Using PyGame

#CodingOf208 – Ends!

8 Ball Pool in Python

Battles – Game inspired by Clash Of Clans In the last 2 weeks of December 2017, I challenged myself to code a game similar to the popular mobile video game, Clash Of Clans.

[jatinmandav3-blog]

Explorers - Using Genetic Algorithm

Explorers – Using Genetic Algorithm

In computer science and operations research, a genetic algorithm is a metaheuristic inspired by process of natural selection that belongs to the larger class of evolutionary algorithms. Genetic Algorithms are commonly used to generate high-quality solutions to optimization and search problems by relying on bio-inspired operators such as mutation, crossover and selection.

The AlgorithmStep 1:

Crea…

View On WordPress

[jatinmandav3-blog]

#CodingOf218

With a great success last year on #CodingOf208, I have decided to do this this year too! This year its going to be “#CodingOf218”!

What is #CodingOf218 Similar to last year, I am again going to challenge myself in 2018 to code for 218 days where the challenge is to not miss any days between and being as regular as possible! The primary goal of this challenge is to dedicate some hours to code daily…

View On WordPress

[jatinmandav3-blog]

Programming Languages - 2017

Programming Languages – 2017

Programming is something vast and rather individual as each developer chooses tools that are most convenient to them. Each language is best in its own way! So first of all here is a quick introduction on some of the Programming languages, take a look!

Python Being my personnel favorite, Python is a widely used high-level programming language for general-purpose programming, created by Guido van…

View On WordPress

[jatinmandav3-blog]

Stacks is an Android Game developed by Ketchapp Games. And here I attempt to code the same in Python!

Here is the link to original game : Stacks on Play Store

The Game

The rules are simple, make your stack is as big as possible! If any portion of “brick” is outside the previous brick, the rest is cut off.

The Code

Link to Code on GitHub : Stacks on GitHub

Code to other Games in Python : Gaming In Python

This slideshow requires JavaScript.

You May Also Like :

8 Ball Pool in Python

Chain Reaction in Python

Two Dice Roll Graph Simulation in Python

Space Invaders in Python

Snake Game in Python

#CodingOf208 – Ends!

                            Stacks in Python Using PyGame Stacks is an Android Game developed by Ketchapp Games. And here I attempt to code the same in Python!

[jatinmandav3-blog]

If you guys have been checking your tweeter, I asked which Android Game should I code as this week’s challenge, and the votes decided “8 Ball Pool”! This version is single Player.

You Can Download the Original Android Game Here : Google Play Store : 8 Ball Pool

The Game

Eight-ball (often spelled 8-ball or eight ball, and sometimes called solids and stripes, spots and stripes in the UK or, more rarely, bigs and littles/smalls, highs and lows, halves and wholes) is a pool (pocket billiards) game popular in much of the world, and the subject of international professional and amateur competition. Played on a pool table with six pockets, the game is so universally known in some countries that beginners are often unaware of other pool games and believe the word “pool” itself refers to eight-ball. The game has numerous variations, mostly regional. Standard eight-ball is the second most competitive professional pool game, after nine-ball, and for the last several decades ahead of straight pool.

Eight-ball is played with cue sticks and 16 balls: a cue ball, and 15 object balls consisting of seven striped balls, seven solid-colored balls and the black 8 ball. After the balls are scattered with a break shot, the players are assigned either the group of solid balls or the stripes once a ball from a particular group is legally pocketed. The ultimate object of the game is to legally pocket the eight ball in a called pocket, which can only be done after all of the balls from a player’s assigned group have been cleared from the table.

(Source : Wikipedia : Eight-Ball)

The Code

Object Oriented Programming has been used for Balls, Cue Stick, and Pockets, along with some other functions to check Collision, reset etc.

Code on GitHub : 8 Ball Pool

Time Lapse Video : Time Lapse : 8 Ball Pool

This slideshow requires JavaScript.

    You May Also Like :

Chain Reaction in Python

Two Dice Roll Graph Simulation in Python

Random Walker In Python

Space Invaders in Python

Snake Game in Python

#CodingOf208 – Ends!

8 Ball Pool in Python If you guys have been checking your tweeter, I asked which Android Game should I code as this week's challenge, and the votes decided "8 Ball Pool"!

[jatinmandav3-blog]

Chain Reaction in Python

Chain Reaction in Python

So a few days back I tweeted asking whether I should code an Android Game called Chain – Reaction, well their were a few responses, but all positive! So I decided to code it!

So here it is, Chain Reaction Using Pygamein Python!

The Game

Chain reaction is a deterministic combinatorial game of perfect information for 2 – 8 players.

It was originally developed by Buddy-Matt Entertainment for…

View On WordPress

[jatinmandav3-blog]

On a follow-up of Random Walker In Python, I attempt to simulate probability distribution graph of rolling two dice and adding the numbers achieved in Python using PyGame.

In Theory

When rolling two dice, distinguish between them in some way: a first one and second one, a left and a right, a red and a green, etc. Let (a,b) denote a possible outcome of rolling the two die, with a the number on the top of the first die and b the number on the top of the second die. Note that each of a and b can be any of the integers from 1 through 6. Here is a listing of all the joint possibilities for (a,b):

(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (2,1) (2,2) (2,3) (2,4) (2,5) (2,6) (3,1) (3,2) (3,3) (3,4) (3,5) (3,6) (4,1) (4,2) (4,3) (4,4) (4,5) (4,6) (5,1) (5,2) (5,3) (5,4) (5,5) (5,6) (6,1) (6,2) (6,3) (6,4) (6,5) (6,6)

Note that there are 36 possibilities for (a,b). This total number of possibilities can be obtained from the multiplication principle: there are 6 possibilities for a, and for each outcome for a, there are 6 possibilities for b. So, the total number of joint outcomes (a,b) is 6 times 6 which is 36. The set of all possible outcomes for (a,b) is called the sample space of this probability experiment.

With the sample space now identified, formal probability theory requires that we identify the possible events. These are always subsets of the sample space, and must form a sigma-algebra. In an example such as this, where the sample space is finite because it has only 36 different outcomes, it is perhaps easiest to simply declare ALL subsets of the sample space to be possible events. That will be a sigma-algebra and avoids what might otherwise be an annoying technical difficulty. We make that declaration with this example of two dice.

Theoretical Graph

With the above declaration, the outcomes where the sum of the two dice is equal to 5 form an event. If we call this event E, we have

E={(1,4),(2,3),(3,2),(4,1)}.

Note that we have listed all the ways a first die and second die add up to 5 when we look at their top faces.

Consider next the probability of E, P(E). Here we need more information. If the two dice are fair and independent , each possibility (a,b) is equally likely. Because there are 36 possibilities in all, and the sum of their probabilities must equal 1, each singleton event {(a,b)} is assigned probability equal to 1/36. Because E is composed of 4 such distinct singleton events, P(E)=4/36= 1/9.

In general, when the two dice are fair and independent, the probability of any event is the number of elements in the event divided by 36. (Source : http://www.math.hawaii.edu/~ramsey/Probability/TwoDice.html)

The Code Frame Work

 The programming language used is Python and module used in PyGame.

The complete code is in a single function dice_roll(). This function initializes the variables, rolls the dice and blits everything on pygame window.

This slideshow requires JavaScript.

The Code

Code for Two Dice Rolls Graph Simulation : Two Dice Roll Graph Simulation

Time Lapse Video : Time Lapse Video

    Let me know your thoughts and suggestions or any ideas on what should I code next!

You may also like :

Random Walker In Python

Space Invaders in Python

Snake Game in Python

#CodingOf208 – Ends!

Music Player – #CodingOf208

Quiz Master – #CodingOf208

          Two Dice Roll Graph Simulation in Python On a follow-up of Random Walker In Python, I attempt to simulate probability distribution graph of rolling two dice and adding the numbers achieved in Python using PyGame.

[jatinmandav3-blog]

I attempt to code basic 2-D random walker. But what is Random Walker.

What is a Random Walk?

A random walk is a mathematical object, known as a stochastic or random process, that describes a path that consists of a succession of random steps on some mathematical space such as the integers. An elementary example of a random walk is the random walk on the integer number line, which starts at 0 and at each step moves +1 or −1 with equal probability. Other examples include the path traced by a molecule as it travels in a liquid or a gas, the search path of a foraging animal, the price of a fluctuating stock and the financial status of a gambler can all be approximated by random walk models, even though they may not be truly random in reality. As illustrated by those examples, random walks have applications to many scientific fields including ecology, psychology, computer science, physics, chemistry, biology as well as economics. Random walks explain the observed behaviors of many processes in these fields, and thus serve as a fundamental model for the recorded stochastic activity. As a more mathematical application, the value of pi can be approximated by the usage of random walk in agent-based modelling environment. The term random walk was first introduced by Karl Pearson in 1905 (source Wikipedia, For More Info : Random Walker – Wikipedia).

The Code

The code contains a single function that displays the walker on 2-D surface. at each step, the direction of walker changes to any 4 of the directions (up, down, left, right). The complete path of walker is traced from beginning and the number of steps taken is displayed at the top bar. The program also saves photo of the pattern at 1,000, 10,000, 50,000, 100,000, 500,000 steps.

Code to Random Walker : Random Walker

Time Lapse Video : Random Walker – Time Lapse

  This slideshow requires JavaScript.

Further Developments

In the next post (and video on YouTube) there will be some of the Random Walk applications . Stay tuned!

  Your thoughts and suggestions will be much appreciated!

You May Also Like :

Space Invaders in Python

Snake Game in Python

#CodingOf208 – Ends!

Music Player – #CodingOf208

Quiz Master – #CodingOf208

Random Walker In Python I attempt to code basic 2-D random walker. But what is Random Walker. What is a Random Walk?

[jatinmandav3-blog]

Space Invaders in Python

Space Invaders in Python

Space Invaders in a 2-D fixed shooting game, I attempt to code the same using PyGame in Python.

The Game

Space Invaders is an arcade video game created by Tomohiro Nishikadoand released in 1978. It was originally manufactured and sold by Taito in Japan, and was later licensed for production in the United States by the Midway division of Bally. Space Invaders is one of the earliest shooting…

View On WordPress

[jatinmandav3-blog]

Snake Game in Python

Snake Game in Python

Snake, is a Classic 2-D game which I attempt to code in Python using PyGame. But first a bit about the game!

The Game

Snake is the common name for a video game concept where the player maneuvers a line which grows in length, with the line itself being a primary obstacle. The concept originated in the 1976 arcade game Blockade, and the ease of implementing Snake has led to hundreds of versions…

View On WordPress

[jatinmandav3-blog]

WOW!! Finally #CodingOf208 has come to an end! This is really exciting! Congratulations to all who joined me!

#CodingOf208 was my New Year’s resolution, i.e., to code for 208 days in the year 2017 with skipping as less days as possible. I skipped around 10 days through this process because I had my exams in between + travelling days. So during this, I could not code and had to skip.

But finally I am done with this and have completed 208 days of coding!

So what did I achieve?

I started this thing when I had the knowledge till Arrays in C Language. Starting from there I am now quite familiar with most of C, C++ and have learned much of Python (Including different modules like, Tkinter, Py2exe, Pyglet, PyGame, etc). I have developed 5 projects during this period and one is still in progress.

Here’s the list of these projects :

Battle Ship : A simple game that works on concept of Random Numbers.

The Battleship using File handling

Date of Completion/Publishing : 15 January 2017 Language : C Language Modules/Header Files used : stdio.h, stdlib.h, unistd.h, string.h, stdbool.h Video : Battleship on YouTube More info and Link to Download the game : BattleShip – #CodingOf208

Chess : A two player game in C language.

King And Queen using File Handling

Linux – Based OS

Date of Completion/Publishing : 11 February 2017 Language :  C Language Modules/Headers files Used : stdio.h, stdlib.h, unistd.h, string.h, stdbool.h, windows.h, conio.h Video : Chess on YouTube More info and link to Download : Chess – #CodingOf208

Quiz Master : A simple quiz game that also allows you to add your own questions and categories.

The Question Mark Here is Due to File Handling

Date of Completion/Publishing : 22 February 2017 Language :  C Language Modules/Headers files Used : stdio.h, stdlib.h, unistd.h, string.h, stdbool.h, math.h, ctype.h Video : Quiz Master on YouTube More info and link to Download : Quiz Master – #CodingOf208

Mandav.h : It is a header file. Date of Completion/Publishing : 28 March 2017 Language :  C Language Modules/Headers files Used : stdio.h, stdlib.h, unistd.h, string.h, stdbool.h, math.h, ctype.h More info and link to Download : Mandav.h – #CodingOf208

Music Player : It is a Windows 64- bit application, a music player.

Date of Completion/Publishing : 18 July 2017 Language :  Python Modules/Headers files Used : Tkinter, Pyglet, DateTime, Random. Video : Music Player on YouTube More info and link to download : Music Player – #CodingOf208

Mark Assistant : MARK, is the assistant that runs my PC, it is still in development not yet completed! Date of Completion/Publishing : Still in Progress. Language :  Python Playlist giving features of MARK : MARK Playlist in YouTube Every week new feature is Uploaded on my YouTube Channel.

Along side making projects, I also solved problems on HackerRank. Profile : Jatin Mandav – HackerRank On 27 March 2017, I received a 4 star Badge in Algorithms.

So that was my progress for coding 208 Days starting with the knowledge in Arrays in C. I am really glad I made this my New Year’s Resolution!

Next Year too I am going to do the same! Next Year it is going to be #CodingOf218!

#CodingOf218 starts on 1st January 2018, and I will be tweeting my weekly progress on my Twitter (@jatinmandav)! I am planning a little more things to do next time (in #CodingOf218), if you are interested to join me through this, tweet your progress with #CodingOf208, and stay tuned for updates!

#HappyCoding #CodingOf208 #CodingOf218

See you guys soon!!

You May Also Like :

Weird Websites

Blue Screen Of Death

Art Of Debugging ! !

Pseudo Codes And Algorithms….

Browser Hijackers!

#CodingOf208 – Ends! WOW!! Finally #CodingOf208 has come to an end! This is really exciting! Congratulations to all who joined me!