Getting Started With DSA

Welcome to the Java DSA world. Here are all the Data Structures and Algorithms you ever need to help you get prepared for your job interviews.

Folder Structure

The workspace contains the following folders by default, where:

• src: the folder to maintain sources
  • linkedlist: The package containing Linked List implementation
    • printList()
    • getHead()
    • getTail()
    • getLength()
    • getLastValue()
    • append()
    • prepend()
    • removeFirst()
    • removeLast()
    • get()
    • set()
    • insert()
    • remove()
    • reverse()
    • findMiddleNode()
    • hasLoop()
    • removeDuplicates()
  • doublylinkedlist: The package containing Doubly Linked List implementation
    • printList()
    • getHead()
    • getTail()
    • getLength()
    • append()
    • removeLast()
    • prepend()
    • removeFirst()
    • get()
    • set()
    • insert()
    • remove()
    • swapFirstAndLast()
    • isPalindrome()
  • stack: The package containing Stack implementation
    • printStack()
    • getTop()
    • getHeight()
    • push()
    • pop()
  • queue: The package containing Queue implementation
    • printQueue()
    • getLength()
    • getHead() (getFirst)
    • getTail() (getLast)
    • enqueue()
    • dequeue()
  • binarysearchtree: The package conatining Binary Search Tree implementation
    • getRootNode()
    • insert()
    • contains()
  • hashtable: The package containing HashMap implementation
    • hash() - hashing function
    • printTable()
    • set()
    • get()
    • remove()

Run locally

• Pull the repository Locally
• Navigate to the respective main class of your required Data Structure
• Update the code as per your needs.
• Click run and you should be able to view the result in your project terminal.