**My Profile** - 5 years of experience from India and Abu dhabi , pursuing Masters in Software Engineering from ASU. I have good amount of experience in Distributed services, Kafka, zookeeper. I feel confident in speaking about LP questions. Good Experiences with both SQL and NoSQL DB\'s.\n\n\n**Status**: Experienced Software Engineer and pursuing Master\'s in Software Engineering at ASU\n**Location**: CA\n**Date**: Feb , 2022\n\n* **Round1** Interview with HR (generallly includes information about going over resume, salary expectation, background experience, location, sponsorship, tech stack you know\n \n* **Round2** 1 hr Interview with Director of Engineering\n\n```\nAsked about project and solved one coding challenge together\nCoding question - Create stack data structure from scratch without using any of the collections classes\n stack push , pop , unlimited size,\n```\n\n**Result** Successfully completed it.\n\n*  **Round2**\n```\n    /*\n\tFind the number of occurance of String s2 in string s1 and letters of s1 do not need to be consecutive. \n      Complete the \'getSubsequenceCount\' function below.\n      The function is expected to return a LONG_INTEGER.\n      The function accepts following parameters:\n       1. STRING s1\n       2. STRING s2\n     // s1 - AB,  s2 -  A B A B A B A B A B A B A B A B A B A B A B A B A B A B A B A B A B A B A B A B A B A B C\n     */\n```\n\n**Result** - Solved using backtracking (I can add solution too if needed , please let me know in the comments\n\n* **Round 3** \n```\nImplement Hashmap right from the scratch \nImplement - get, put, delete, hash function, collision resolution if two value yields to same hash code.\n```\n**Result** completed using LinkedList\n\n*  **Round 4** It consist of coding and a system design round in one hour. \n```\nCoding question - \nConstruct a comparator that can be used to sort an array of version number strings in ascending order\n  e.g. versionSort(new String[]{"4.5.1","10","0.99","4.5","1.0.0.1"} => ["0.99","1.0.0.1","4.5","4.5.1","10"]\n```\n\n```\nSystem design question - \n\nWe need a system to receive and re-distribute transaction events, at a rate of approximately \n3000 messages per minute. Each message is approximately 2kb in size. This system must \nincorporate the following:\n\n- Reliability: any event that we claim to have successfully received cannot be lost\n- Auditability: we need to have a historical record of every event retained for 7 years, for regulatory purposes\n- Multi-Distribution: we need to be able to forward these events to multiple consumers, via either push or pull\n- Security: only authorized producers can insert events, only authorized consumers can receive events\n\nDesign something capable of handling the above requirements. Any and all tools/technologies are available to you.\n\nFeel free to make use of the whiteboard to the diagram.\n\n```\n\n* **Round 5** Coding round\n```\n/* \n    Construct a method that when given a string finds all possible unique permutations of that string\n    e.g. permute("abc") => ["abc", "acb", "bac", "bca", "cab", "cba"]\n         permute("aba") => ["aba", "aab", "baa"]\n*/\n```\n\n\n**Result** Rejected :( \n

My Profile - 5 years of experience from India and Abu dhabi , pursuing Masters in Software Engineering from ASU. I have good amount of experience in Distributed