PowerLevel9000 / dsa-presentation

This is a presentation on Data Structures and Algorithms, including community programming with a group(named Basic fun), aimed at making DSA more enjoyable and effective on a weekly basis. The programming language used will be either Ruby or JavaScript

DSA WEEKLY PRESENTATION

📗 Table of Contents

• Next week Challenge
• Next Week DSA topic
• Week-3 Activity And Discussion
  • what we did
  • what we discuss
  • Challenge of this week
• Week-2 Activity And Discussion
  • what we did
  • what we discuss
  • Challenge of this week
• Week-1 Activity And Discussion
  • What we did
  • what we discuss
  • Challenge of this week
• Week-0 Activity

NEXT MEETING Exercise

We have already discuss linkedlist so we have to improved it

• add more relevant functions
• improve our functions

NEXT WEEK PRESENTATION

A presentation with coding challenge

---

• We will use shorting hat function of this file visit me to decide our presenter
  • presenter have to share screen if he is comfortable and discuss the activity below
  • presenter receive constructive feedback of the meeting
  • presenter will ask if someone want to add something in code base
• We will solve 2 - 3 good coding challenge related to linked list, queue, stack

---

(back to top)

week - 3 info

what we did

• date 2020-04-30 and we discuses about Linked List
  • we create LinkedList & Node class with various Linked List function such as
    • insert
    • atIndex
    • nodeAtIndex
    • insertAtIndex
    • print
    • removeAtIndex
    • etc
    • we discussed at base level of everything

(back to top)

what we discuss

• we discussed last week challenges
• files
  • linkedlist.js And improved and discussed stack Queue

(back to top)

week - 2 info

what we did

• date 2020-04-16 and we discuses about QUEUE
  • we create Queue class with various Queue function such as
    • insert
    • delete
    • isEmpty
    • clear
    • etc

(back to top)

what we discuss

• we discussed last week challenges
• files
  • queue.js And improved and discussed in this file

(back to top)

Challenge of the Week

revise everything with coding challenge like stack and queue

(back to top)

week - 1 info

what we did

• date 2020-04-09 and we discuses about Stack
  • we create stack class with various stack function such as
    • push
    • pop
    • isEmpty
    • clear
    • last removed
    • etc

(back to top)

what we discuss

• we make our shorting hat function and ask for improvement for edge cases
• files
  • stack.js And shorting-hat.js

(back to top)

challenge of the week

• Improve Shorting hat Function For edge cases Click here
  • For person with third name
  • Two person with the same First name
• Improve stack.js from week-2
  • LastRemove function is not Working. it should return the last pop element since we just mutate count it should be easy and it should return you have nothing in stack or your stack is cleared when stack is cleared . Note here stack empty and stack cleared is two different things
  • ADD some more function like 2nd last removed
  • a function which return last pop element whenever it called like

  const stack = [a,b,c,d,e,f,g,h]
  stack.pop() // removes h
  stack.pop() // removes g
  stack.pop() // removes f
  stack.pop() // removes e
  stack.pop() // removes d
  // our new function name could be anything you want for
  //instance reverter
  stack.reverter() // should return d
  stack.reverter() // now it  should return e
  stack.reverter() // now it  should return f
  stack.reverter() // now it  should return g
  stack.reverter() // lastly it  should return h
  stack.reverter() // lastly it  should return "no more removed items"
  
  

---

(back to top)

week - 0 info

• date 2022-04-02 and we discuses about time complexity
• no coding just intro and some fun stuffs

---

(back to top)

# Happy Coding

(back to top)