- Find a pair with the given sum in an array.
- Find maximum product of two integers in an array.
- Find largest number possible from set of given numbers.
- Print all possible solutions to N Queens problem.
- Check if a number is even or odd without using any conditional statement.
- All-Pairs Shortest Paths – Floyd Warshall Algorithm.
- Check if a graph is strongly connected or not.
- Print complete Binary Search Tree (BST) in increasing order.
- Find the minimum and maximum element in an array using Divide and Conquer
- Calculate the height of a binary tree.
- Find the path between given vertices in a directed graph.
- Find the maximum occurring word in a given set of strings.
- Find number of customers who could not get any computer.
- Check if removing an edge can split a binary tree into two equal size trees.
- Combinations of words formed by replacing given numbers with corresponding alphabets.
-
Notifications
You must be signed in to change notification settings - Fork 0
Harshalrathore007/DSA-LAB-Practicals
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Contains Practicals done during DSA-LAB.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published