#Dsa 2

Given a string, find the length of the longest substring without repeating characters.

Given the head of a singly linked list, reverse the list and return its new head.

Given a DSA problem, explain the brute-force approach, its time and space complexity, and then optimize it and write the code.

How would you find the top-k elements in an array? Explain the hash map problem related to this.

Solve a Data Structures and Algorithms problem related to the N-Queens challenge.