Byron Pérez byron-perez

## Solution2 javascript course
<!DOCTYPE html>
<html>
    <head>
        <meta charset="utf-8">
        <script src="library.js"></script>

    </head>
    <body>
        <div>
            <h3>Search Product by Type</h3>

## wastefull.cpp
/*
   Reverse a doubly linked list, input list may also be empty
   Node is defined as
   struct Node
   {
     int data;
     Node *next;
     Node *prev;
   }
*/

## reverse_ll.cpp
/*
  Reverse a linked list and return pointer to the head
  The input list will have at least one element
  Node is defined as
  struct Node
  {
     int data;
     struct Node *next;
  }
*/

## phpMailer.php
<?php
// Import PHPMailer classes into the global namespace
// These must be at the top of your script, not inside a function
use PHPMailer\PHPMailer\PHPMailer;
use PHPMailer\PHPMailer\Exception;

//Load composer's autoloader
require 'vendor/autoload.php';

$mail = new PHPMailer(true);                              // Passing true enables exceptions

## check.cpp
#include <bits/stdc++.h>

using namespace std;

vector<int> findBlackKing(vector < vector<char> > board)
{
    int board_len = board.size();
    vector<int> king_pos;
    for(int x = 0; x < board_len; x++)
    {

## check.cpp
#include <bits/stdc++.h>

using namespace std;

vector<int> findBlackKing(vector < vector<char> > board)
{
    int board_len = board.size();
    vector<int> king_pos;
    for(int x = 0; x < board_len; x++)
    {

## 4and7
#include <bits/stdc++.h>

using namespace std;

int numDigits(int number)
{
    int digits = 0;
    if (number < 0) digits = 1; // remove this line if '-' counts as a digit
    while (number) {
        number /= 10;

## try the trie
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>

## unoptimal.py
#!/bin/python3

import sys

#functions
def bsearch(x, L):
    if x == L[len(L) // 2]:
        return True
    if (len(L) // 2) == 0:
        return False

## gist:067a9087df4cf1ba9fc3c4d188c923da
#!/bin/python3

import sys


#functions
def BFS(G, s):

    explored = []
    queue = [s]
	<!DOCTYPE html>
	<html>
	<head>
	<meta charset="utf-8">
	<script src="library.js"></script>

	</head>
	<body>
	<div>
	<h3>Search Product by Type</h3>
	/*
	Reverse a doubly linked list, input list may also be empty
	Node is defined as
	struct Node
	{
	int data;
	Node *next;
	Node *prev;
	}
	*/
	/*
	Reverse a linked list and return pointer to the head
	The input list will have at least one element
	Node is defined as
	struct Node
	{
	int data;
	struct Node *next;
	}
	*/
	<?php
	// Import PHPMailer classes into the global namespace
	// These must be at the top of your script, not inside a function
	use PHPMailer\PHPMailer\PHPMailer;
	use PHPMailer\PHPMailer\Exception;

	//Load composer's autoloader
	require 'vendor/autoload.php';

	$mail = new PHPMailer(true); // Passing true enables exceptions
	#include <bits/stdc++.h>

	using namespace std;

	vector<int> findBlackKing(vector < vector<char> > board)
	{
	int board_len = board.size();
	vector<int> king_pos;
	for(int x = 0; x < board_len; x++)
	{
	#include <bits/stdc++.h>

	using namespace std;

	int numDigits(int number)
	{
	int digits = 0;
	if (number < 0) digits = 1; // remove this line if '-' counts as a digit
	while (number) {
	number /= 10;
	#include <map>
	#include <set>
	#include <list>
	#include <cmath>
	#include <ctime>
	#include <deque>
	#include <queue>
	#include <stack>
	#include <string>
	#include <bitset>
	#!/bin/python3

	import sys

	#functions
	def bsearch(x, L):
	if x == L[len(L) // 2]:
	return True
	if (len(L) // 2) == 0:
	return False