Swagasoft Developers

Algorithms are the building block of every software developer/ software engineer.
Join me on this journey becoming an Algorithm expert from zero to hero.
Your coding interview will never remain the same.

Day-8 Majority element (Using frequency counter)

Highlight

Majority Element- Daily Algorithms (Day 8) - O(N)Time , O(N) Space (frequency counter) approach. Majority Element - Daily Algorithms (Day 8) - O(N)Time, O(N) Space.This is a good way to start your algorithm journey, follow me on this journey as we solve...

Most general-purpose algorithms have a time complexity of O(n^2), one of the best popular sorting algorithms is mergeSort with a Big O(n log n) time.
However, while solving a problem yesterday on AlgoExpert, I sorted an array using Two pointer approach which gives a good performance algorithm of Big O(n) time and Big O(n) space.


I am currently sharing exciting videos on algorithms and data structure for beginners. 👉 https://lnkd.in/dV-yC92u
I am going to cover the type of algorithms (Sorting, searching algorithms, algorithms coding patterns, and many more).

Here is another video on the Big Notation series. If the Big O of O(log N) Algorithm is still not clear to you, this is a must-watch video.

👉 https://youtu.be/WA5892VOaX0 for full video.

we just released another video (Single linked list) on the data Structure and Algorithm master class.

1.2 Data Structure and Algorithm Master class - single linked list In this video, we covered and explain a linear data type (Single linked list). We cover virtual representation, implementation, and debugging of a single lin...