DSA ( Data Structures & Algorithms ) Series

A data structure is a named location that can be used to store and organize data. And, an algorithm is a collection of steps to solve a particular problem. Learning data structures and algorithms allow us to write efficient and optimized computer programs.

Basic Fundamentals

youtube	article	description
		algorithm & flochart
		flowchart explained and example
		introduction to DSA
		big O notation and time complexity part-1
		the term time complexity in DSA

Array Part – 1

#	Description
	2sum
	Remove Duplicates from Sorted Array
	Remove Element
	Search Insert Position
	Plus One
	Merge Sorted Array
	Single Number
	Shuffle the Array
	Running Sum of 1d Array
	Number of Good Pairs
	Shuffle String
	Truncate Sentence
	Build Array from Permutation
	Concatenation of Array
	Final Value of Variable After Performing Operations
	Maximum Number of Words Found in Sentences
	Counting Words With a Given Prefix
	Count Prefixes of a Given String

String Part – 1

#	Description
	Longest Substring Without Repeating Characters
	Regular Expression Matching
	Integer to Roman
	Roman to Integer
	Longest Common Prefix
	Valid Parentheses
	Length of Last Word
	Add Binary
	Running Sum of 1d Array
	Reverse String
	To Lower Case
	Defanging an IP Address
	Split a String in Balanced Strings
	Shuffle String
	Truncate Sentence
	Replace All Digits with Characters
	Sorting the Sentence
	Final Value of Variable After Performing Operations
	Maximum Number of Words Found in Sentences
	Counting Words With a Given Prefix
	Count Prefixes of a Given String
	Count Asterisks
	First Letter to Appear Twice

Hashtable

Dynamic Programming

Linked list

Stack

Queue

Searching

Sorting

Graph

Math

Binary Tree

DFS

BFS

Heap

Binary Search

Tree