fix(guide) Replace invalid prism code block names (#35961)

* fix: replace sh with shell

fix replace terminal with shell

fix replace node with js

fix replace output with shell

fix replace cs with csharp

fix replace c++ with cpp

fix replace c# with csharp

fix replace javasctipt with js

fix replace syntax  with js

fix replace unix with shell

fix replace linux with shell

fix replace java 8 with java

fix replace swift4 with swift

fix replace react.js with jsx

fix replace javascriot with js

fix replace javacsript with js

fix replace c++ -  with cpp

fix: corrected various typos

fix: replace Algorithm with nothing

fix: replace xaml with xml

fix: replace solidity with nothing

fix: replace c++ with cpp

fix: replace txt with shell

fix: replace code with json and css

fix: replace console with shell

guide/portuguese/algorithms/graph-algorithms/depth-first-search/index.md

@@ -12,7 +12,7 @@ Profundidade A primeira pesquisa é um dos algoritmos gráficos mais simples. El
 
 ### Implementation (C++14)
 
- ```c++
+ ```cpp
 #include <iostream> 
 #include <vector> 
 #include <queue>  
@@ -91,7 +91,7 @@ int main()
  A DFS é completa num numero finito de nós. Trabalhando melhor em arvores esparssas.
  
  ### Implementation of DFS in C++ 
-```c++
+```cpp
 #include<iostream>
 #include<vector>
 #include<queue>