IMC Trading Associate Developer Interview Question 2025 January | BFS on Graph | off-campus

Question 1: Word Ladder Problem Statement A word transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence beginWord -> s1 -> s2 -> ... -> sk such that every adjacent pair of words differs by exactly one letter, and every word in the sequence (except beginWord) is in wordList. Given beginWord, endWord, and wordList, return the number of words in the shortest transformation sequence, or 0 if no such sequence exists. Constraints 1 <= ...