GAierken

class Node {
    constructor(value){
        this.value = value
        this.next = null
    }

}


class Stack {

GAierken

class Node {
    constructor(value){
        this.value = value
        this.next = null
    }

}


class Stack {

GAierken

// Problem link: https://leetcode.com/problems/valid-parentheses/

const isValid = (string) => {
    // create a hashMap to store the valid match   
    const bracketsMap = {
            '(': ')',
            '{': '}',
            '[': ']'
          }
    // create a stack data structure with array

GAierken

class Node {
    constructor(value){
        this.value = value
        this.next = null
    }

}


class Stack {

GAierken

const search = (nums, target) => {
    // declare start and end
    let start = 0
    let end = nums.length - 1
    // base condition 
    while(start <= end){
        // find the mid point
        let mid = Math.floor((start+end)/2)
        // if middle element is the target, return middle index
        if(nums[mid] === target){

GAierken

const search = (nums, target, start=0, end=nums.length-1) => {
     // base condition
     if(start > end) return -1
    // find the middle index
     let mid = Math.floor((start+end)/2)
     
     // if middle element is the target, return the middle index
     if(nums[mid] === target) return mid
    
    // if middle element is smaller than target, move the start index to mid + 1

GAierken

Guligena Aierken

g.aierken@gmail.com | Github| LinkedIn | Medium | Portfolio

TECHNICAL SKILLS

JavaScript · React · React Native · Redux · Redux-Saga · Ruby on Rails · SQL(PostgreSQL & SQLite) · HTML · CSS · RESTful API

TECHNICAL PROJECTS

Check Your Weather Weather forecast application - Frontend & Backend | Demo

• Architected single page frontend with React and Redux, utilized Redux-Saga for networking
• Enabled seven days weather forecast with One Call API by applying Geocoding API

GAierken

breathFirst(start){
  const queue = [start]
  const result = []
  const visited = {}
  let currentVertex
  visited[start] = true
  
  while(queue.length){
       currentVertex = queue.shift()
       result.push(currentVertex)

GAierken

// visiting/updating/checking each vertex in a graph recursive
  depthFirstRecursive(start){
     const result = []
     const visited = {}
     const adjacencyList = this.adjacencyList
     
     (function dfs(vertex){
        if(!vertex) return null
        visited[vertex] = true
        result.push(vertex)

GAierken

// visiting/updating/checking each vertex in a graph
DFS(vertex){
   if(!vertex) return 

}