tejas-rane / dsa_in_java

This is practice problems to learn various data structures.

DSA_in_Java

This is practice problems to learn various data structures and algorithms.

Link list functions implemented:

1. void printlist
2. void push(int data)
3. void insertAfter(int data, int pos)
4. void insertAfter(int data, Node prev)
5. void append(int data)
6. void delete(int pos)
7. boolean searchRecursive(int i, Node node)
8. boolean searchIterative(int i)
9. int lengthIterative()
10. int lengthRecursive(Node node)
11. void swapNodes(int x, int y)
12. Node reverseIterative()
13. Node reverseRecursively(Node node)
14. Node reverseKNodesInGroups(Node head, int k)
15. void printMiddleElement()
16. void getNthElement(int index)
17. void getNthElementFromEnd()
18. void countOccurences(int num)
19. void deleteList()
20. detectLoop()
21. void swapInpairsIterative()
22. void checkPalindrome()
23. void isCircular()

Stack functions implemented:

1. boolean isEmpty()
2. boolean push(int el)
3. int pop()
4. void printStack()

SmallProgramPractice.java

1. checkArmstrong(int num)
2. sumOfAllDigits(int num)
3. isAnagram(String s1, String s2)
4. countOfUniqChars(String in)
5. printOfUniqChars(String in)

BinaryTree.java Basic implemenation of tree BST.java

1. BSTNode insert(BSTNode rootNode, int data)
2. boolean search(BSTNode rootNode, int data)
3. void inOrder(BSTNode rootNode)
4. void preOrder(BSTNode rootNode)
5. void postOrder(BSTNode rootNode)
6. int maxDepth(BSTNode root)

Sorting.java

1. Bubble Sort
2. Insertion Sort
3. Selection Sort
4. Merge Sort
5. Quick Sort
   1. with pivot last element