Write a Java program to solve the following problem: You are given a list of words and a pattern. Return a list of all words that match the given pattern. A word matches the pattern if there exists a permutation of letters p so that after replacing every letter x in the pattern with p(x), we get the desired word. Example: Input: words = ["abc","deq","mee","aqq","dkd","ccc"], pattern = "abb" Output: ["mee","aqq"]
Online HackerRank coding assessment, later interview with follow up and discussing my experience.
Mostly it was JD based questions
3. Code Signal, total 3 problems
2. Stack based versioning question.
1. Describe your older project in detail.
Payments & Testing related stuff.
Describe how you would design monitoring of a system
1. Add two binary numbers in a linked list 2. Find element in an array which doesn't appear twice
Signed NDA so won't disclose anything
Viewing 4701 - 4710 interview questions