Persistent Systems Interview Question

Data Structures & Algorithms Explain Big-O notation and analyze the time complexity of common sorting algorithms. Given an array of integers, find the two numbers that sum to a given target. (Two Sum Problem) Implement a binary search algorithm in JavaScript. Reverse a linked list iteratively and recursively. Find the longest substring without repeating characters in a string. What is memoization, and how can it be used in dynamic programming? Implement a LRU (Least Recently Used) Cache. Explain the difference between BFS and DFS with real-world use cases.