Welcome to my collection of Java DSA and OOPs problem solutions! Here, Iβve solved various challenging problems, implemented efficient algorithms, and demonstrated key object-oriented programming concepts. π
- π‘ Data Structures: Arrays, Linked Lists, Stacks, Queues, Trees, Graphs.
- π’ Algorithms: Sorting, Searching, Dynamic Programming, Backtracking.
- π OOP Concepts: Classes, Inheritance, Polymorphism, Encapsulation, Abstraction.
- π€ LeetCode Problems: Solutions to frequently asked coding interview problems.
- π Question Patterns
-
π Search in Rotated Sorted Array
Problem: Search for a target element in a rotated sorted array.
Solution: Binary Search for O(log n) time complexity.
-
π Merge Two Sorted Linked Lists
Problem: Merge two sorted linked lists into one sorted linked list.
Solution: Use two pointers for optimal merging.
-
π Permutations of an Array
Problem: Generate all permutations of an array of integers.
Solution: Recursive backtracking with base and recursive cases.
-
π³ Binary Tree Level Order Traversal
Problem: Return the level order traversal of a binary tree.
Solution: Use BFS and a queue.
-
π Student Management System
Implemented Features: Add, remove, and view student records.
-
π’ Employee Management System
Implemented Features: Hierarchical structure using inheritance (Manager, Engineer).
-
π Shapes Area Calculator
Implemented Features: Overriding calculateArea() for different shapes like Circle and Rectangle.
git clone https://github.com/KhushiPandey8/JAVA
- π§ Email: xingxing8601@example.com
- π GitHub: https://github.com/KhushiPandey8/
- π₯οΈ LeetCode for amazing problem sets.
- π Java Programming Community for support and resources.