Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Java Data Structures and Algorithms
·
Module 2
Arrays, Searching, and Basic Sorting
1
Searching Sorted Arrays: Linear vs. Binary
Implement linear search and binary search on sorted arrays.
2
Binary Search on the Answer Space
Apply binary search on the answer space for optimization problems.
3
Rotated Sorted Arrays: Binary Search Modification
Solve problems on rotated sorted arrays using a modified binary search.
4
Prefix/Suffix Sums for Range Queries
Apply prefix/suffix sum techniques to solve range query problems.
5
Kadane's Algorithm: Maximum Subarray Sum
Apply Kadane's algorithm to find the maximum subarray sum.
6
Dutch National Flag Algorithm for Three-Way Partitioning
Apply the Dutch National Flag algorithm for three-way partitioning.
7
Boyer-Moore Voting Algorithm for Majority Element
Apply the Boyer-Moore Voting Algorithm to find majority elements in an array.
8
Sorting Algorithms: Implementations and Analysis
Implement and analyze bubble sort, selection sort, and insertion sort.
Previous module
Foundations: Java Tools & Complexity Analysis
Next module
Recursion, Advanced Sorting, and Strings