Algorithms, Data Structures, Competitive Coding, and problems from LeetCode with complete Solution Approach, Pseudocode, and Explanation.
A Queue is a data structure that follows the FIFO (First In, First Out) principle. Think of it like a real-world queue 🧑🤝🧑 where people join from the last and exit from the start. Operations performed on a Queue JavaScript Code for a Queue I have implemented the JavaScript code… Read More »Implementing Queue in JavaScript
A stack is a data structure that follows the LIFO (Last In, First Out) principle. Think of it like a stack of books 📚: you can only add a new book to the top or remove one from the top. Operations performed on a Stack JavaScript Code for a Stack… Read More »Implementing Stack in JavaScript
Contains Duplicate – LeetCode problem: We need to check if the given array contains duplicates and return True if duplicates are present and False otherwise. Link: Contains Duplicate LeetCode Difficulty: Easy Examples:Input: nums = [1,2,3,2]Output: true Example 2:Input: nums = [1,2,3,4]Output: false Solution in JavaScript Here we use an object… Read More »Contains Duplicate LeetCode – JS Solution
Given an array of size n, find the majority element. The element that appears more than ⌊ n/2 ⌋ times in the array. Note: Input will be a non-empty and unsorted array. Example Solution Approach 1. Sorting On sorting the given array, the element occurring more than [n/2] times will… Read More »Majority Element in an Array – LeetCode
Sorting algorithms are cool. But, every time I learn or refer to any algorithm in my head or watch a YouTube video, I can understand and recall how it works but, my brain starts yelling – write the code! write the code! If you are trying to learn or understand… Read More »Sorting Algorithms in C++
Given a matrix of N dimensions, and we need to transpose it. One of the standard problem on matrices. Don’t confuse Transpose with Rotation, the rotation is normally performed on the X-Y axis while in a transpose, the matrix is flipped on its diagonal. Example: Solution Approach This is simple… Read More »Transpose a Matrix