Scribd
Upload
12 views2 pages

Advanced Data Structures Questions

The document lists advanced data structure questions using Java, categorized into five sections: Arrays and Strings, Linked Lists, Trees and Graphs, Stacks and Queues, and Hashing. Each section includes various algorithmic problems such as Maximum Subarray Sum, Merge Two Sorted Lists, and Longest Increasing Subsequence. The questions are designed to test and enhance understanding of data structures and algorithms.

Uploaded by

yashwardhan6031
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
12 views2 pages

Advanced Data Structures Questions

The document lists advanced data structure questions using Java, categorized into five sections: Arrays and Strings, Linked Lists, Trees and Graphs, Stacks and Queues, and Hashing. Each section includes various algorithmic problems such as Maximum Subarray Sum, Merge Two Sorted Lists, and Longest Increasing Subsequence. The questions are designed to test and enhance understanding of data structures and algorithms.

Uploaded by

yashwardhan6031
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Advanced Data Structure Questions Using Java (Questions Only)

Array and Strings


 Maximum Subarray Sum (Kadane’s Algorithm)
 Rotate Array
 First Unique Character in a String
 Valid Anagram
 Longest Palindromic Substring

Linked Lists
 Merge Two Sorted Lists
 Reverse a Linked List
 Detect Cycle in a Linked List
 Remove Nth Node From End of List
 Add Two Numbers

Trees and Graphs


 Binary Tree Inorder Traversal
 Binary Tree Level Order Traversal
 Lowest Common Ancestor of a Binary Tree
 Validate Binary Search Tree
 Serialize and Deserialize Binary Tree

Stacks and Queues


 Implement Queue using Stacks
 Min Stack
 Valid Parentheses
 Evaluate Reverse Polish Notation
 Sliding Window Maximum

Hashing
 Two Sum
 Group Anagrams
 Subarray Sum Equals K
 Longest Consecutive Sequence
 Top K Frequent Elements

Dynamic Programming
 Climbing Stairs
 Longest Increasing Subsequence
 House Robber
 Coin Change
 Longest Common Subsequence

You might also like