Pergunta de entrevista da empresa Nayan

Arrays & Strings Find the missing number in an array of 1 to N. Find the largest subarray sum (Kadane’s Algorithm). Reverse a string without using extra space. Find the longest palindrome substring. Linked Lists Detect a cycle in a linked list (Floyd’s Cycle Detection). Reverse a linked list iteratively and recursively. Find the middle node of a linked list. Trees & Graphs Find the lowest common ancestor (LCA) of two nodes in a binary tree. Implement Depth First Search (DFS) & Breadth First Search (BFS). Check if a given graph is a valid tree. Dynamic Programming (DP) Solve the 0/1 Knapsack problem. Find the longest increasing subsequence. Solve the Coin Change problem.