Algorithm and Data Structure
Introduction
String/Array
Question 1
Creating Main Class
Creating Reverse Function
Question 2
Creating Main Class
Creating countTriplets Function
Question 3
Creating Main Class
Creating generate Function
Creating generateUtil Function
Question 4
Creating Main Class
Creating Brute Force Way
Creating Sorting Method
Question 5
Creating Main Class
Creating findLength Function
Question 6
Creating Main Class
Creating findSmallest Function
Bit Manipulation
The Basics
XOR
When To Use
Summary
Question 1
Creating Main Class
Creating maxSubarrayXOR Function
Question 2
Creating Main Class
Creating sumBitDifferences Function
Question 3
Question 4
Searching
Basic Search
Performing Basic Seaching
Binary Search
Creating Main Class
Creating binarySearch Function
Binary Search in Sorted and Rotated Array
Creating Main Class
Creating binarySearchRotated Function
Sorting
Insertion Sort
Creating Main Class
Creating insertionSort Function
Bubble Sort
Creating Main Class
Creating bubbleSort Function
Other Sorting Methods
Complexity
Tree and Binary Search Tree
Binary Tree
Binary Search Tree
Adding Data
Finding Data
Removing Data
Traversal
Question 1
The Idea
Question 2
The Idea
Question 3
Graph
Djikstra
Kruskal Minimum Spanning Tree
Prim Minimum Spanning Tree
Traversal in Graph
Breadth First Search
Depth First Search
Commonly Used Technique by Programmer
Recursion
Example 1
Example 2
Linked List
Advatages and Drawbacks
Linked List Basic Operation
Linked List Operation (2)
Question 1
Perform Addition
Question 2
Perform Insertion
Powered by
GitBook
Complexity
Complexity
Below, listed the complexity among sorting methods.
results matching "
"
No results matching "
"
