Formulated and discussed key Data Structures and Algorithms (DSA) problems related to Graphs and Linked Lists, focusing on algorithmic logic, optimization techniques, and real-world problem-solving strategies. Explored concepts such as BFS, DFS, cycle detection, shortest path algorithms (like Dijkstra and Bellman-Ford), and advanced linked list operations including reversal, merging, and cycle detection using Floyd’s algorithm.

interview process at Visa typically takes 3 to 5 weeks and consists of 3 main stages: an Online Assessment (OA), a recruiter phone screen, and one or two rounds of technical/behavioral interviews