DEV Community

100 Days Computer Science Series' Articles

Back to Shankar L's Series
Binary Search : Finding Data in O(log n)

Binary Search : Finding Data in O(log n)

Comments
7 min read
Merge Sort : Sorting in O(n log n) Using Divide and Conquer

Merge Sort : Sorting in O(n log n) Using Divide and Conquer

Comments 1
8 min read
Quick Sort: Fast Sorting with Divide and Conquer

Quick Sort: Fast Sorting with Divide and Conquer

Comments
8 min read
DFS : Exploring Graphs One Path at a Time

DFS : Exploring Graphs One Path at a Time

Comments
8 min read
BFS : Exploring Graphs Level by Level

BFS : Exploring Graphs Level by Level

Comments
9 min read
Greedy Algorithms : Making the Best Choice at Every Step

Greedy Algorithms : Making the Best Choice at Every Step

Comments
8 min read
Dynamic Programming : Solving Complex Problems by Reusing Solutions

Dynamic Programming : Solving Complex Problems by Reusing Solutions

Comments
8 min read
Backtracking : Exploring Choices and Undoing Wrong Decisions

Backtracking : Exploring Choices and Undoing Wrong Decisions

Comments
8 min read
Sliding Window Technique : Solving Subarray and Substring Problems Efficiently

Sliding Window Technique : Solving Subarray and Substring Problems Efficiently

Comments
8 min read