Abdulrahman Alotaibi abdulrahmanAlotaibi

## workerPool.go
package main

import (
	"fmt"
  "time"
)

func main() {
  numJobs := 20
  limit := numJobs * 2

## binarySearch.go
package main

import (
	"fmt"
)

func main() {
	fmt.Println("Hello, World!")

  arr := []int{1,2,3,4}

## minStack.go
type MinStack struct {
    stack [][]int
    top int

}

func Constructor() MinStack {
    stack := [][]int{}
    return MinStack{
        stack:stack,

## ringbuffer.go
type MyCircularQueue struct {
    size int
    head int
    queue []int
}


func Constructor(k int) MyCircularQueue {
    queue := make([]int, k)
    size := 0

## isSymmetric.go
/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func isSymmetric(root *TreeNode) bool {


## maxDepth.go
/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */

type t struct {

## hasCycle.go
/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
func hasCycle(head *ListNode) bool {

    dummy := head

## isPalindrome.go
/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
func isPalindrome(head *ListNode) bool {

    dummy := &ListNode{

## reverseList.go
/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
func reverseList(head *ListNode) *ListNode {
    dummy := head
    var prev *ListNode

## removeNthFromEnd.go
/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
func removeNthFromEnd(head *ListNode, n int) *ListNode {

    dummy := &ListNode{}
	package main

	import (
	"fmt"
	"time"
	)

	func main() {
	numJobs := 20
	limit := numJobs * 2
	type MinStack struct {
	stack [][]int
	top int

	}

	func Constructor() MinStack {
	stack := [][]int{}
	return MinStack{
	stack:stack,
	type MyCircularQueue struct {
	size int
	head int
	queue []int
	}


	func Constructor(k int) MyCircularQueue {
	queue := make([]int, k)
	size := 0
	/**
	* Definition for a binary tree node.
	* type TreeNode struct {
	* Val int
	* Left *TreeNode
	* Right *TreeNode
	* }
	*/
	func isSymmetric(root *TreeNode) bool {
	/**
	* Definition for singly-linked list.
	* type ListNode struct {
	* Val int
	* Next *ListNode
	* }
	*/
	func hasCycle(head *ListNode) bool {

	dummy := head