Data Structures And Algorithms Code Challenges & Tips

1. Implement a function to find the longest substring without repeating characters in a given string.

2. Write a function that merges two sorted linked lists into a single sorted linked list.

3. Given an array of integers, write a function to find the two numbers such that they add up to a specific target.

4. Implement an algorithm to perform a depth-first search (DFS) traversal of a binary tree.

5. Create a function that checks if a given string is a valid palindrome, considering only alphanumeric characters and ignoring case sensitivity.

6. Write a function to find the kth largest element in an unsorted array.

7. Implement a function that returns the minimum depth of a binary tree.

8. Given a sorted array of integers, write a function to search for a target value and return its index, or -1 if the target is not found (implement binary search).

9. Write a function to compute the intersection of two arrays, returning the elements that are common to both.

10. Implement a function to rotate an NxN matrix by 90 degrees clockwise.