DSA ALGORITHMS

BELOW TOPICS ARE COVERED ALONG WITH USAGE (Scroll to see)

• SEARCHING (Linear, Binary Search)
• SORTING (Merge Sort)
• LINKED LIST (Singly Linked List, Doubly Linked List)
• STACK
• QUEUE
• TREES
• GRAPHS
• DYNAMIC PROGRAMMING
• SOME LEETCODE, HACKKERANK QUESTIONS TOO

Installation

pip install git+https://github.com/Avantika2512/dsa_programs

SEARCHING

Example

from dsa_algos.search import SearchAlgo

print(SearchAlgo.linear_search([1,2,3,4,5], 4))
print(SearchAlgo.linear_search_all_elements([1,2,3,4,5,5,5,6,7], 4))
print(SearchAlgo.binary_search(['a', 'A', 'b', 'B'], 'A'))

SORTING

Example

from dsa_algos.sort import SortAlgo
print(SearchAlgo.merge_sort([1,2,3,4,5], 4))

LINKED LIST

Singly Linked List

Example

from dsa_algos.singly_linked_list import SinglyLinkedList

# CREATE EMPTY LIST
sll = SinglyLinkedList()

# INSERT
sll.append(5)
sll.append(-5)
sll.prepend(10)
sll.prepend(100)
sll.insert(data=70, at_index=1)
sll.insert(data=100, at_index=-1)

# REMOVE
sll.pop()
sll.pop_first()
sll.remove(from_index=2)

# SEARCH 
sll.search(10)
sll.search(99)

# SORT
sll.sort()

# PRINT
print(sll)

# CLEAR 
sll.clear()

Doubly Linked List

Example

from dsa_algos.doubly_linked_list import DoublyLinkedList

# CREATE EMPTY LIST
dll = DoublyLinkedList()

# INSERT
dll.append(5)
dll.append(-5)
dll.prepend(10)
dll.prepend(100)
dll.insert(data=70, at_index=1)
dll.insert(data=100, at_index=-1)

# REMOVE
dll.pop()
dll.pop_first()
dll.remove(from_index=2)

# SEARCH 
dll.search('A')
dll.search('Z')

# SORT
dll.sort()

# PRINT
print(dll)

# CLEAR 
dll.clear()

Contributing

Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.