DSA - Finding the Second Smallest Element in an Array (3 approaches) | Implementation + Analysis
In this video, we will solve the problem on finding the second smallest element in an array. We will discuss three approaches to solve this problem. For each approach, we will write the code and we will also analyze the approach in depth and to the core by doing a dry run for each of the three implementations that we write for this problem. The code for the video can be found on GitHub.
----------------------------------------
⏱ Timestamps ⏱
📌 let's start (0:00)
📌 understanding the first approach to solve the problem (0:13)
📌 first implementation using sorting (0:53)
📌 solving same problem in two traversals (2nd approach) (3:16)
📌 implementation of second approach (3:58)
📌 dry run analysis of the second approach (9:03)
📌 solving same problem in single traversal (3rd approach) (15:24)
📌 implementation of third approach (17:40)
📌 dry run analysis of the third approach (20:57)
📌 conclusion (26:24)
🐱💻 🐱💻 Course Links:
Complete Code - https://github.com/The-Nerdy-Dev
Visual Studio Code - https://code.visualstudio.com
Git - https://git-scm.com/downloads
---
Support my channel:
💜 Join the Discord community 👨👩👧👦: / discord
💜 One time donations via PayPal
Thank you! 🙏
---
Follow me on:
👉 Twitter: / the_nerdy_dev
👉 Instagram: / thenerdydev