# DSA

Algorithms, Data Structures, Competitive Coding, and problems from LeetCode with complete Solution Approach, Pseudocode, and Explanation.

• DSA

Yes, we are doing it today. The all-time famous interview question, Do you know how to reverse a Linked List? Well turns out, it isn’t that difficult and it’s all about logic and pointers, okay let’s get started. Alright, I already wrote a post explaining the basic operations and structure… Read More »Reverse a Linked List

## Fibonacci Series – Iterative vs Recursive

• DSA

The Fibonacci Series is a standard programming problem scenario, and we can obtain the series or nth Fibonacci number using both iterative as well as recursive. In this post, we’ll compare, discuss both methods and their complexities. Fibonacci Series – Example The principle behind this order/sequence is very simple The… Read More »Fibonacci Series – Iterative vs Recursive

## Maximum Occurring Character in a String

• DSA

Given, a String of Characters might be a mix of numbers, alphabets, and other special characters and we need to find the maximum occurring character and to do this we need to count the occurrence of each and every character and then the greatest one will be our answer. Examples… Read More »Maximum Occurring Character in a String

## Sum of Numbers in a String

• DSA

Today, I found a problem where we need to find the sum of numbers in a string, the string will be a mix of alphabets, numbers, and special characters, and usually, this can be solved by iterating through each character and adding all the numbers. Example Solution Approach Given a… Read More »Sum of Numbers in a String

## Linear Search Algorithm

• DSA

Linear Search, the most basic and easiest searching algorithm that we even use in our daily life. Yes, linear search is nothing but searching one after the other till we find what we want in a sequence one by one. Definition Linear Search is also known as Sequential Search, is… Read More »Linear Search Algorithm

## Bubble Sort Algorithm

• DSA

Bubble sort is one of the simple sorting techniques and it is also easier to code and understand. Bubble sort follows the simple principle of comparing two adjacent elements and swapping them according to our desired order. How Bubble Sort works? Consider the below example where we try to sort… Read More »Bubble Sort Algorithm