1. Design an application similar to MakeMyTrip.
2. In a 2D plane where every point is assigned a color (blue or red), prove that there exists a rectangle with all corners of the same color.
3. Given k and a DFS traversal string for a k-ary tree, construct the tree. The string contains 'P' (if a parent) and 'L' (if a leaf). For example, k=3, str="PPLLLLL". All the strings are arranged in the following order: A, B, ..., Z, AA, ..., AZ, BA, ..., BZ.
4. Word Ladder Problem Statement Given two strings, BEGIN and END, along with an array of strings DICT, determine the length of the shortest transformation sequence from BEGIN to END. Each transformation involves changing exactly one alphabet, and the resulting word after each transformation must be present in DICT. Input: Integer T representing number of test cases.For each test case: A string BEGIN. A string END. An integer N representing the length of the DICT array. N space-separated strings denoting words in DICT. Output: For each test case, the output is a single integer indicating the length of the shortest transformation sequence from BEGIN to END. Output each test case result on a separate line. Example: # Example 1 Input:2hitcog5hot dot dog lot loghithot2hot cog Output: # Example 1 Output:52 Constraints: 1 ≤ T ≤ 5 1 ≤ N ≤ 102 1 ≤ |S| ≤ 102 All words have the same length. All transformations involve only lowercase English letters. BEGIN will not equal END. Note: Return -1 if no transformation sequence from BEGIN to END is possible. Implement the function, as printing is handled separately.
5. What counter questions do you have, and what is your reasoning for selecting this approach?
Browse through a variety of job opportunities tailored to your skills and preferences. Filter by location, experience, salary, and more to find your perfect fit.
We have sent an OTP to your contact. Please enter it below to verify.
Instantly access job listings, apply easily, and track applications.
