First round: there is a dictionary of m words and some string start is given. Transform start string by changing one character at a time such that the intermediate word formed is available inside the dictionary. Now after performing some least number of transformations task is to change start inti some end string. Print all such possible transformations ie. write each step of transformation in a single complete way of transforming.
Robber's Problem, Dynamic Programming, Tree, Graph
Algorithm and Data Structure Question: Problem: Given a string s, find the length of the longest substring without repeating characters.
linked list loop detection and where
Check the LinkedList have cycle or not
Given an array of integers, return the length of the longest subarray that has a sum equal to zero
Similar to top k elements
Knowledge in depth for things used in assignment round
First question about the fundamental of CS Like few questions related to RDBMS Then operating system and Software engineering Then they asked OOPs concept and told the difference between deep copy and shallow copy
What is your name ?
Viewing 1191 - 1200 interview questions