Browse All Exercises

# Find First and Last Position in Sorted Array Implement a function that finds the first and last position of a target...

Implement a function that finds the kth largest element in an unsorted array without sorting the entire array. Your fun...

Implement a function that searches for a target value in a rotated sorted array in O(log n) time complexity. A rotated...

Write a function `merge_sorted_arrays(arr1, arr2)` that merges two sorted arrays into one sorted array. **Examples:** `...

Implement a solution to the classic 0/1 knapsack problem using dynamic programming. Given a knapsack with a weight capa...

Implement a binary search function that finds the index of a target value in a sorted array. **Function signature:** `b...

Build a function that determines if a string can be segmented into words from a given dictionary. ## Function Signature...

# Longest Increasing Subsequence Implement a function that finds the length of the longest increasing subsequence (LIS)...

Write a function that returns the nth Fibonacci number using O(1) space complexity (no arrays or additional data structu...

Implement functions to serialize a binary tree to a string representation and deserialize it back to the original tree s...

Build a function that computes how many distinct ways you can climb n stairs, taking 1 or 2 steps at a time. For exampl...