Data Structures Challenge 1 Caleb Kim

[calebkimsd]

Score: 2.95 / 5

Replit

[rpeddakama]

Score: (6/12 = 2/4) + 0.85 = 2.95/5

• [ ] Queue add/delete - allows you to add to queue, remove from it using .add(), .remove(). Clear understanding of this datastructure (0/1)
• [x] Comments are in the code and explain important parts of the algorithm's functionality (1/1)
• [ ] Add example working without errors in the replit runtime (0/1)
• [x] Delete implementation shown with .remove() and .poll() and showing comments (1/2)
• [x] Comments in delete implementation are evident (1/1)
• [ ] No implementation of Merge Methods (0/2)
• [x] Class definition - main class and separate classes for each of the challenges (2/2)
• [x] Comments are well put throughout the code and general tester with console input is there in Main.java. I am able to run the code and keep testing challenges without having to re-run multiple times (1/1)
• [ ] Reverse order queue to stack is there (0/1) 6/12 because most implementations use java.util functions rather than using boilerplate.