Basic problems

Repo to maintain solved "basic problems" to signify used of particular Data Structure which are commonly used in SE.

Prerequisites

Need Java 8 installed

Running the examples

I used a makefile to compile and run the required java files to solve the particular problem.

Example solves

• prob1.java - Finding a maximum in a given window : Arrays.
• prob2.java - Search in a rotated array : Arrays.
• prob3.java - Reverse a linked list : ::.
• prob4.java - Remove a node with the given key : LL.
• prob5.java - Remove duplicates in a linked list : LL.
• prob6.java - Reverse a word, Reverse a sentence : String.
• prob7.java - String segmentation : String
• prob8.java - XML to Tree : String, N-ary Tree
• prob9.java - check if two binary trees are identical : Tree

Authors

• Ketan Kokane

License

This project is licensed under the MIT License - see the LICENSE.md file for details

Acknowledgments

• Hat tip to anyone whose code was used
• Inspiration
• etc