Merge branch 'master' of https://github.com/mpektkd/Algorithms-Comple…

…xity

BFS-StayHome/README.md

@@ -1,4 +1,4 @@
-# BFS Flood-Fill
+### BFS Flood-Fill
 
 We have to save Swtiris. Due to Covid-19 lockdown, Swtiris has meen n in University and we must help him to go home. Covid polutes the area very fast.
 

Powers of 2/README.md

@@ -1,4 +1,4 @@
-# Numbers representation with powers of 2
+### Numbers representation with powers of 2
 
 Given a number N, 1 <= N <= 1.000.000.000 
 we have to find if N can be witten as the sum of exactly K powers of 2(1 <= K <= 200.000)

README.md

@@ -1,6 +1,6 @@
 ### Problems through several programming languages
 
 > - Representation of a number with powers of 2.
-> - Implementation of BFS Algorithm in a funny version.
+> - Implementation of BFS Algorithm in a funny version(StayHome).
 > - DFS Implementation in a funny version detecting Corona Virus
 > - Stacks finding Vaccine for Corona

Stacks-Vaccine/README.md

@@ -0,0 +1,9 @@
+### Problem 2: Vaccine 💉 (Java Implementation)
+
+Given a stack of RNA nitrogenous bases ("A", "U", "G", "C"), we consider the following possible moves that we can do, in order to create another stack in which all the nitrogenous bases of the given stack are in groups (all "A"s together, all "T"s together and so on). The moves are:
+
+- "p" (push): removes the top base from the given stack and puts it on top of the new stack
+- "c" (comlement): replaces all the bases from the given stack with their complementary ones ("A" ↔️ "U", "C" ↔️ "G")
+- "r" (reverse): turns the new stack's content upside-down
+
+The program should print the shortest (on a tie, the lexicographicaly smallest) sequence of moves that need to be done, in order the create the above mentioned stack.