Experience: 6 months\n\n**Interview process:**\nRound1- DSA(1 hour)\nRound2- Logical Thinking and Algorithm(1 hour)\nRound3- Low Level Design(1 hour)\nRound4- Hiring Manager (45 mins)\n\n**Round-1**\n\nEasy and Medium level DSA questions\n\nhttps://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times/\n\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/\n\nIn both the question you have to provide the most optimized approach.\n\n**Round - 2**\n\nJust one question\n\nYou are given a graph with undirected edges . Retrive  subgraphs containing the nodes with atleast n number of neighbour nodes and these neighbours should also be present in the subgraph of the provided solution.\nAlso if a node is not included in the subgraph then it also won\'t be counted as neighbour and count of other nodes which is sharing its edges with that node is reduced by 1.\uD83E\uDD72\uD83E\uDD72\nSo get all the subgraphs which is having atleast n neighbours at real time present int he graph.\n\nFirstly i gave a brute force appraoch with exponential time complexity and then come up with the linear time appraoch.\uD83D\uDE0E\n\n**Round - 3**\n\nDiscussion about projects on which i worked , how task i assigned and the work flow execution of the project.\n\n\nGot the call from HR for offer discussion in just 2 hours\uD83D\uDE0E\uD83D\uDE0E.\nThey are really amazing people and a very smooth interview process.\nThe work quality is also very good.\n

Experience: 6 months\n\nInterview process:\nRound1- DSA(1 hour)\nRound2- Logical Thinking and Algorithm(1 hour)\nRound3- Low Level Design(1 hour)\nRound4- Hirin