Skip to content

SurajRai50/Data-Structures

BranchesTags
 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

130 Commits
ArrayStack and linkedStack
ArrayStack and linkedStack
 
 
BST Tree
BST Tree
 
 
Disjoint Set Union
Disjoint Set Union
 
 
Graph
Graph
 
 
LList
LList
 
 
Linked-List
Linked-List
 
 
Queue
Queue
 
 
Range Queries
Range Queries
 
 
patternSearching
patternSearching
 
 
1221. Split a String in Balanced Strings.cpp
1221. Split a String in Balanced Strings.cpp
 
 
1523. Count Odd Numbers in an Interval Range.cpp
1523. Count Odd Numbers in an Interval Range.cpp
 
 
A_Exciting_Bets.py
A_Exciting_Bets.py
 
 
A_Glory_Addicts.py
A_Glory_Addicts.py
 
 
A_Immobile_Knight.py
A_Immobile_Knight.py
 
 
A_K-divisible_Sum.py
A_K-divisible_Sum.py
 
 
A_Nastia_and_Nearly_Good_Numbers.py
A_Nastia_and_Nearly_Good_Numbers.py
 
 
A_Odd_Divisor.py
A_Odd_Divisor.py
 
 
A_Planets.py
A_Planets.py
 
 
Add_to_Subsequence.py
Add_to_Subsequence.py
 
 
Adjacent_Pairs.py
Adjacent_Pairs.py
 
 
BFS.cpp
BFS.cpp
 
 
B_Array_Recovery.py
B_Array_Recovery.py
 
 
B_Array_Reodering.py
B_Array_Reodering.py
 
 
B_Bad_Boy.py
B_Bad_Boy.py
 
 
B_Maximum_Cost_Deletion.py
B_Maximum_Cost_Deletion.py
 
 
B_Meeting_on_the_Line.py
B_Meeting_on_the_Line.py
 
 
B_Prefix_Sum_Addicts.py
B_Prefix_Sum_Addicts.py
 
 
BinaryTreeConstructor.java
BinaryTreeConstructor.java
 
 
Binary_Substituition.py
Binary_Substituition.py
 
 
Break_the_elements.py
Break_the_elements.py
 
 
Building_Race.py
Building_Race.py
 
 
C_Even_Number_Addicts.py
C_Even_Number_Addicts.py
 
 
C_Minimum_Notation.py
C_Minimum_Notation.py
 
 
Container_with_most_water_Leetcode11.cpp
Container_with_most_water_Leetcode11.cpp
 
 
DFS.cpp
DFS.cpp
 
 
DuplicateZeroes.cpp
DuplicateZeroes.cpp
 
 
E_Arranging_The_Sheep.py
E_Arranging_The_Sheep.py
 
 
Equalize_AB.py
Equalize_AB.py
 
 
Equivalent_Numbers.py
Equivalent_Numbers.py
 
 
Equivalent_Numbers.rs
Equivalent_Numbers.rs
 
 
Even_Splits.py
Even_Splits.py
 
 
Fibonacci.py
Fibonacci.py
 
 
Frequencyofnonvowels
Frequencyofnonvowels
 
 
Inorder Traversal of Binary Tree.cpp
Inorder Traversal of Binary Tree.cpp
 
 
InversionCount.java
InversionCount.java
 
 
MergedSortedArray.cpp
MergedSortedArray.cpp
 
 
MyLinkedList.java
MyLinkedList.java
 
 
N Queen Problem.cpp
N Queen Problem.cpp
 
 
Power of 2.cpp
Power of 2.cpp
 
 
RBTreeInsertion.java
RBTreeInsertion.java
 
 
README.md
README.md
 
 
Recamans_Sequence.cpp
Recamans_Sequence.cpp
 
 
RemoveDuplicatefromSortedArray.cpp
RemoveDuplicatefromSortedArray.cpp
 
 
Search_an_element_in_a_sorted_and_rotated_Array.cpp
Search_an_element_in_a_sorted_and_rotated_Array.cpp
 
 
SortArraybyParity.cpp
SortArraybyParity.cpp
 
 
Spiral_Matrix.cpp
Spiral_Matrix.cpp
 
 
Sudoku Solver.cpp
Sudoku Solver.cpp
 
 
Tower of Hanoi Problem using Binary Value.cpp
Tower of Hanoi Problem using Binary Value.cpp
 
 
ValidMountainArray.cpp
ValidMountainArray.cpp
 
 
Vertical_BinaryTraversal.cpp
Vertical_BinaryTraversal.cpp
 
 
abc String.txt
abc String.txt
 
 
anagram.txt
anagram.txt
 
 
armstrong-number.py
armstrong-number.py
 
 
balance-parenthesis.cpp
balance-parenthesis.cpp
 
 
binaryTree.py
binaryTree.py
 
 
bitcoinRate.py
bitcoinRate.py
 
 
buy sell stocks.txt
buy sell stocks.txt
 
 
buy-and-sell-stock-leetcode-java.md
buy-and-sell-stock-leetcode-java.md
 
 
factorial.py
factorial.py
 
 
fibonacci.txt
fibonacci.txt
 
 
huffman.cpp
huffman.cpp
 
 
merge2array.cpp
merge2array.cpp
 
 
mergearray.cpp
mergearray.cpp
 
 
mergeearray.cpp
mergeearray.cpp
 
 
powset.cpp
powset.cpp
 
 
rev_string.c
rev_string.c
 
 
searchInsertion.py
searchInsertion.py
 
 
secondmaxdiff.cpp
secondmaxdiff.cpp
 
 
solution.py
solution.py
 
 
stack.cpp
stack.cpp
 
 
subset.cpp
subset.cpp
 
 
trailingzeroes.cpp
trailingzeroes.cpp
 
 
upstack.cpp
upstack.cpp
 
 
valid_parentheses_leetcode.py
valid_parentheses_leetcode.py
 
 
validparenthesis.cpp
validparenthesis.cpp
 
 

Repository files navigation

Data-Structures

Data Structures are divided into two types linear and non-linear.

Linear data structures include Array, Linked List, Queue and Stack. Nonlinear data structures include Tree and Graph.

Stack and It's Implementations a. Balance Parenthesis b. Expressions and their conversions c. Stock Span d. Maximum Area of Histogram e. Smallest to the left, right and vice verca

Queues and it's applications\n a. Negative in K sized window b. Level order traversal of tree c. Circular Tour d. First Non Repeating Char in Stream

Linked List a. Mid of Linked List b. In Place Reversal of Linked List c. Reverse k groups in linked list d. Cycle detection in linked list e. Interleave first and second half of Linked List

Binary Tree a. Traversals of Binary Tree b. Height of Binary Tree c. Diameter of Binary Tree d. Max, Min from Binary Tree

Binary Search Trees a. Max, Min in BST b. Add new node in BST c. Delete heavy path d. Delete a Node e. Validate BST

Graphs a. BFS b. DFS c. Detect Cycle d. Find Islands

Dynamic Programming a. Coin Exchange b. Knapsack 0/1

Heaps a. Min, Max Heaps

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

0 stars

Watchers

0 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages

  • C++ 49.9%
  • Java 33.3%
  • Python 16.4%
  • C 0.4%