| A | B | C | D | E | F | G | H | I | J | K | L | M | N | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | Timestamp | Your Interview Duration | Type of Interview | Your Interviewer Name | What type of questions you were asked (related to project, DSA, any other core subjects) | What are the questions asked in your interview? | Any Non-technical questions you were asked? | Share your overall experience | ||||||
2 | 6/29/2022 11:02:48 | 9:00am | Technical | Sudhakar Reddy Kamazala Muni Venkata | Array, strings | If Sum of pair in an array equal to given value, return true else false. Check if given string is valid or not. Valid conditions are given | Tell me about yourself. Array Q Asked about my previous project(Not engage). String Q Do you have any questions? Asked for feedback. | |||||||
3 | 6/29/2022 11:06:55 | 40-45 mins | AA | Jagadish Yhanishetty | All the questions related to my previous projects and previous internships . Nothing related to DSA or core subject. Not even a single coding question. | Only about previous projects and internships | About my intro and the hardest problem I have solved | Loved it! | ||||||
4 | 6/29/2022 12:33:45 | 45 mins | Technical | Vamshi Krishna | String program | One coding question on string manipulation, it was hard. I was only able to solve for base case not for boundary conditions | About engage project | The interviewer was nice but the coding question was difficult | ||||||
5 | 6/29/2022 15:11:50 | 2pm (1 hour) | AA | Ravi | DSA | Create a link list then Reverse the link list. | introduce yourself | interviewer was chilled and made me comfortable ...... but when if i was writing code and made some error . he would ask to search the errors and rectify it before writing further code. | ||||||
6 | 6/29/2022 16:25:28 | ~50 minutes | AA | Niladri Ghosh | Intro, Engage Project, DSA | Project - why used particular techstack/api, challenges faced during project, overview of implementation. Coding - https://leetcode.com/problems/sum-root-to-leaf-numbers/ Asked to write full code on codility (not just function) and run it for 2 test cases. | No. | The project discussion went really well and captured his interest. The coding part did not go smoothly but somehow did it. Advice - Do not assume that AA round will be HR questions. | ||||||
7 | 6/30/2022 19:31:30 | 1 pm | Don't know | Dont know | Dsa | Given a sorted array find the number of times a given element appears | No | - | ||||||
8 | 6/30/2022 20:16:10 | 2 pm (30 min approx) | Technical | Jain something | Related to projects on resume | Sorted array was given,and count of distinct values were to be found | No | It was a very friendly interview | ||||||
9 | 7/1/2022 10:15:18 | ~50 min | Technical | Vijay something something | Pure DSA | Merge two sorted arrays Check if a string is a palindrome or not | No | It was nice. Interviewer was friendly. Worked on the problems with me. Debugged together. Felt like it was a discussion more than an interview. | ||||||
10 | 7/1/2022 11:04:38 | 50mins | Don't know | Ashish jain | Project, knowledge on DSA, array | Sort an array and find number repeated in array | No | It was good. Interviewer was a bit strict. | ||||||
11 | 7/1/2022 11:21:33 | 50 mins | Technical | Srinivasa rao nalluri | DSA | Find kth last element of given linked list. Implement from scratch | No . Just self intro | It was good . But i was unable to run the code . | ||||||
12 | 7/1/2022 12:29:29 | 45 min | Technical | SV | Programming question | 1. Given a 4*4 matrix and asked how would y find the maximum submatrix with 0 as all elements. 2. Describe the toughest platform u've ever solved. | How do u manage both electronics department and Coding and what made u to switch in this domain. Do u want to ask anything from us. | It was chill like he was overall comforting the candidate and cool | ||||||
13 | 7/1/2022 12:55:59 | 45 mins | AA | charles | DSA only without intro or project | positive | ||||||||
14 | 7/1/2022 13:10:57 | Around 45 minutes | Technical | Srikant something | DSA (Linked List) OS (paging) | Delete a node from linked list when node is given and head is not given them implement linked list and show that your function works | None apart from introduce yourself | Overall experience was nice. The interviewer was really friendly. Do not hesitate to ask him if have any doubt and always be verbal about whatever is going on your mind, because the interviewer will then only be able to help if your thought process is wrong or a better solution is possible. The first approach I came up with did not have a nice time complexity so the interviewer pointed out the area I should consider and I was able to figure out a better approach. Then I implemented linked list, createLinkedList and printLinkedList function to show that my function works. But codility does not support user input apparently. So I would suggest create your linked list/tree etc in the main function and feed that to your function. That's all I guess βΊοΈ | ||||||
15 | 7/1/2022 13:46:22 | more than 1 hr | Technical | Kavita Garg | Two question on strings, both were medium level | https://leetcode.com/problems/permutation-in-string/ https://leetcode.com/problems/string-compression/ | no | -- | ||||||
16 | 7/1/2022 15:08:19 | 25 mins | Technical | Abhinav | DSA only (Easy String) | Find anagram of second string in the substring of first string. | no | Interviewer was cool and supportive. Overall a good Experience | ||||||
17 | 7/1/2022 15:26:50 | 1 hour | AA | VB | Past projects, Operating system | 1. Coding based projects 2. Validate email syntax 3. Diff in process and thread 4. Paging | Couldn't get through all the test cases | |||||||
18 | 7/1/2022 15:43:40 | 20 min approx. | Technical | Priyanka | DSA | Asked me to implement linked list and add at head and make it double linked list and print it in reverse | No. | It was very cool, and she told me about Microsoft | ||||||
19 | 7/1/2022 15:54:15 | 40 mins | Technical | Ankur kalra or smth | Asked about my past project which was a website creation. Then asked me questions on cloud | Level order a tree | Introduction | - | ||||||
20 | 7/1/2022 16:44:51 | 1 hour | Don't know | No idea | Engage Interview - 01/07/2022 (3:00 PM) Interviewer - introduce himself Me - π₯°π₯°π₯°π₯° Interviewer - introduce your self Me - I had prepare answer as many of youβ¦.(almost 3 min ..) Interviewer - > I want to know about your project Me - answer according, as per project demand (2 ml project & 3 game , 1 website )β¦. Interviewer - Tell me about your favorite project Me - website one (made during engage program) Interviewer - > Explain project idea & tech stack you have used Me - explain well , as I have designed this site from scratchβ¦.according to me Interviewer -> some more question Me - π₯°π₯°π₯°π₯° Interviewer -> lets come to coding question Me -> why not .. Lets startβ¦β¦ not in such wayβ¦. Interviewer - > Question to replace spaces by something Me - > I had did similer question so brute force and one more aproach known to me Then using notepad I have explained Then Interviewer - Its good , now put constraint of no extra spaces & no built in fxn Me - > Tryingβ¦β¦..π€£π€£π€£β¦β¦.got a approach of two pointer But array was going modified Then finally he gave a hint then I got solution -> Traverse from end and dynamically change array Interviewer -> Ok thatβs fine & goodβ¦ Me -> ππππβ¦..Nice..niceβ¦..nice Interviewer -> Ok that all . If you have any question let me know Me - > I had asked 1 question Note - 1) For me Interviewer has taken some screen shot of note pad on which I had explain proejct & recommendation algorithm basicβ¦β¦diagrameticalyβ¦.. 2) Also screen-shot of pseudo code & explaination of question solution on notepad 3) Code I have shared in chats The END.. So that about my interview.. | |||||||||
21 | 7/1/2022 17:32:01 | ~40 mins | AA | Anup smthg | Two DSA questions | 1) To check if two strings are anagrams(is anagrams of Leetcode) 2) Given a list of strings print the group of atleast 3 anagrams (group anagrams leetcode) | Intro | It was nice. Interviewer was pretty chill. | ||||||
22 | 7/1/2022 17:42:05 | 1 hour | Technical | Mr. Saxena | Regarding my current Internship and DSA | It was a easy question on Array | It was nice | |||||||
23 | 7/1/2022 17:42:29 | 1hr | Technical | Abhijit... | DSA+engage project | He started asking about my engage project,asked me to show my website,asked about specifications,what is the use case in real life.Then shifted to DSA question,asking about finding triplets from the array having sum 0.Went on to asking time complexity,optimized version and different test cases. | No | It was okay because interviewer was not too strict. | ||||||
24 | 7/1/2022 19:24:34 | 50 min | AA | Don't remember | Intro and dsa question | Intro, a question to find the anagrams present in a string array | No | - | ||||||
25 | 7/1/2022 20:08:45 | 45-50 mins | Technical | Durgashini | DSA | Longest pallindrome in a string, How can we implement hashmap, linked list | what was the most difficult part for you in interview | . | ||||||
26 | 7/2/2022 10:47:52 | 1 hr | AA | Not Remember | DSA | Question was related to Election (if candidate ID and voter ID is given, so find the top 3 candidates and particular voter is fraud or not) | Introduction only | It was a good discussion. It was like, I'm solving que with my friend. | ||||||
27 | 7/2/2022 12:50:00 | 35-40 mins | AA | Don't remember | Only related to engage project and previous projects | Intro then previous projects then engage project discussion then learnings and challenges from engage then why I want to join microsoft then just normal stuff | Everything was non technical only | It was a pretty chill interview. Interviewer was very nice and friendly | ||||||
28 | 7/2/2022 22:30:50 | 30 35 mins | Technical | Dont remember | Dsa and oops | Implement queue using two array | What ever you know about oops | Actually in interview we should discuss whatever we think | ||||||
29 | 7/4/2022 13:23:09 | 1 hour | Technical | Dont remember now | DSA and qs on one of the projects that I gave on my resume | intro , project , and dsa | intro | it was okayish. The interviewer was harsh , but asked easy dsa qs . wasnt tough | ||||||
30 | 7/4/2022 21:48:27 | 45-50 min | Technical | Don't remember | 2 DSA questions | One was to find the elements which sum up to a given target value. - Two Sum on Leetcode And one was to find the duplicates in an array | No | It was good | ||||||
31 | 7/5/2022 18:41:10 | 45-50 mins | AA | Don't know | Coding Question, OS & Android development | Code: To write the code for the move in snake and ladder OS: What is system call, its examples, Virtual Memory Android Development: onClick method, text verification, what is firebase and its connectivity with android studio. | No | It was good. My interviewer made me feel very comfortable. Incase I did not know answer to any question he helped me to reach to the answer. | ||||||
32 | 7/6/2022 0:39:00 | 45 min | Don't know | Don't remember (Azeem ig) | Project i mentioned in resume. DSA (graph) | What is socket.io? Is it bidirectional? What is express.js? DSA - interviewbit (graph- valid path(dfs section)) | No | Interviewer was very nice. Although he didn't even ask for intro. Started with projects first, then moved to DSA. I was trying to check if I'm doing right or wrong, he was guiding as well. I also tried to explain making grid and path in ide. Overall he was very genuine and i felt confident to speak whatever came to my mind. | ||||||
33 | 7/6/2022 10:47:08 | 40min | Technical | Kartik Moorthy | Dsa | https://www.geeksforgeeks.org/check-for-identical-bsts-without-building-the-trees/ | Introduction Big clients of Microsoft | On the average side Interviewer was good But Not able to come up with working solution | ||||||
34 | 7/6/2022 11:15:40 | 45 Mins | Technical | Suresh Inavolu | Asked on what i was learning and DSA questions. | Q1. gvn 2 sorted array, merge them in ascending order and asked about time and space complexity . q2. given 2 binary trees, check if the are the same tree and asked about the corner cases . both the questions were to be done from scratch in codility. | Asked about what i'm currently learning and the project i did. | the overall experience was good. the qns were easy but since i was doing CP in leetcode, the implementation of the program from scratch was kinda out of my scope...Overall good experience. Also before coding, I gave him 2 kinds of approach and asked him how he wants me to go with it. | ||||||
35 | 7/6/2022 13:19:28 | 50 min | Don't know | Arpit Aggarwal | DSA - tree ke 2 questions | 1)Tree node ke 2 ke jagah 3 pointer , rightsiblings name ki and issko fix karna ha 2)print boundary nodes of tree | Time hi nahi tha | I screwed in interview, approach sahi thi but code me f ho gya . Most probably I will get rejected, πππππ , his last word was like this - see u in next year ππππππ | ||||||
36 | 7/6/2022 13:21:56 | 1 hr 10 min | AA | Raj something..( senior engineer) | Projects were asked about engage.then he jumped into some qs on ML as I mentioned it in my intro. Then he asked question on graph and string I have to code graph one in notepad | Check whether a path exists between two nodes And in a string what is the time complexity of finding a word in it and then optimise it such that tc is less than O(n) | Intro What are my hobbies Background What ms should hire me What do you think about this interview Any question you want to ask | He was really very nice and was very supportive. The qs he asked was easy but about the tc of string less than o(n) which i was unable to ans. And the ML qs were a bit tricky He was very interactive | ||||||
37 | 7/6/2022 13:34:50 | 45 mins | Technical | Don't remember | Qns related to prev project, not engage related. Few general questions. | DSA - Given a list of strings return the second most occuring string | - | It was okay-ish. Couldn't read the interviewer's emotions so wasn't sure if i was doing well or not. Code didn't run but he said the approach is kinda correct. | ||||||
38 | 7/6/2022 14:19:04 | 45 min | Technical | Jayprakash | DSA | Longest consecutive sequence array | No | It was good experience. | ||||||
39 | 7/6/2022 14:50:01 | 1 hour | Technical | Prashant something | Intro and 1 DSA question | https://www.geeksforgeeks.org/find-the-maximum-element-in-an-array-which-is-first-increasing-and-then-decreasing/ | Nope | Keep your presence of mind and avoid silly syntax errors | ||||||
40 | 7/6/2022 18:01:41 | 1 hour | AA | Dont know | How was ur engage experience?how did u manage core and cs? And later DSA | 1. Merge 3 sorted arays 2. Find an element in a very large sorted array(binary search) | Nothing | It was fine..he didnt give a hint until i asked him..he was quiet.. | ||||||
41 | 7/6/2022 18:27:19 | 30 mins | Technical | Swapnil Sharma | Dsa | Some theoretical question on data structure An array question on circular queue | Intro | It was good. | ||||||
42 | 7/6/2022 19:20:26 | 55 min | Technical | Uday (I'm not sure) | DSA | https://www.geeksforgeeks.org/find-three-closest-elements-from-given-three-sorted-arrays/ | Only Intro | Interviewer was good. He was expecting from me to code it and run it on the codility platform after explaining the approach and dryrun. | ||||||
43 | 7/6/2022 19:45:37 | 1 hour | AA | don't remember | Only DSA | 1. Find mirror image of given tree and print that in preOrder 2. Two trees are given, verify if they are mirror image or not | No | He was silent throughout. No hints were given. He also got confused between inorder and preorder traversal. I don't know if he did it on purpose or he actually got confused. | ||||||
44 | 7/6/2022 21:05:41 | 45 mins | AA | Mohan | project, DSA | 4 tasks were given each task was dependent on another task which was in turn dependent on another task. we had to print the currect execution order such that all the tasks were done correctly. (Topological sort was to be used) | High Level Design of Project and general project related discussion | Interviewer was nice but it took me time to completely understand his question. He didn't guide though in the solution. He said tell me when you are done. | ||||||
45 | 7/6/2022 22:20:42 | 45 mins | Technical | Shambhu singh | Explain wat u did for engage project, DSA questions | Dsa question 1 - heap based question, I told sir that I didn't know much about implementing heap, wasn't fluent enough to code it. He gave another question Given strings str1, str2 check if str2 is an anagram of substrings of str1 | Interviewer made me feel comfortable, we discussed how we could solve before starting to code and only when I came to optimal solution we coded it | |||||||
46 | 7/6/2022 22:26:35 | 45 min | Technical | Ravi verma | DSA | ADD ELEMENTS IN LINKED LIST ,PRINT THEN REVERSE IT AND PRINT GIVEN 10BILLION NUMBERS FIND MAXIUM 10NUMBERS | INTRODUCTION | IT WAS GOOD , JUST BE CONFIDENT ! | ||||||
47 | 7/7/2022 21:28:59 | 1 hr | AA | Manish Kansal | DSA | What are the projects you made (gave a one liner for every project) Then was asked to find longest common ancestor of two nodes in a binary tree and I wrote a recursive solution for that and then he asked me to do a dry run of it and was again asked to the same question without recursion by introducing a new parent pointer | No | Loved It. Interviewer was very nice and made me feel very comfortable within a couple of minutes | ||||||
48 | 7/8/2022 11:16:35 | 1 hour | Technical | Don't remember | In detailed project explaination. Html, css questions related to inline, block, inline block and float. | Given an array of integars, and an integar k. Find pairs in the array which square sum to k square. (Pythagoras formula) b^2 + p^2 = k^2. print (b,p). Array can have negatives too. If there are negative integars, print the pair with its positive value too. Ex- input: [1, 2,-3 ,-4,5] k=5 Output : (3,4), (-3,-4), (-3,4), (3,-4) | How did you work on the project? | It was good. Codality was used for the code. | ||||||
49 | 7/8/2022 11:37:05 | 1hrs | Don't know | Don't remember π₯² | 1.Array ka tha ki hume n numbers diye hue hai and hume every 2 numbers delete krne hai and jab wo delete ho gya toh..wapas se every 2nd element delete lrne haiand so on uske baad hme lucky numbers return krana hai jo delete nhi ho paya wp lucky number hoga. 2. Factorial find using Recursion 3. Real world applications of data structure till binary tree. | It was good..and interviewer were supportive. | ||||||||
50 | 7/8/2022 12:07:25 | 45 mins | Technical | Prashanth menon | Only dsa | Given an array of natural numbers of whose range<=size find the first duplicate element and return that | Introduce yourself | It was overall a good experience | ||||||
51 | 7/8/2022 12:24:16 | 30 min | Technical | Some saxena type ig | Dsa | Phythagorian triplets in an array use hash in this and lowest common ancestor in tree | No | Interviewer was cool ππ we talked about his microsoft experience and literally he was awesome. | ||||||
52 | 7/8/2022 14:26:10 | 45 min | Technical | Don't remember | Project + DSA | Explain your project then a DSA question Question : give a sentence return the string in the reverse order (whole sentence should be reversed ) without extra space | No | It was good, when ever I was stuck anywhere she was also giving me hints to solve the problem | ||||||
53 | 7/8/2022 14:43:41 | Around 25mins | AA | Sourabh | Engage project and previous projects | 1. My introduction 2. Engage project introduction, tech stack used He asked me to show the project by sharing my screen 3. Low level design of project 4. About previous projects like what I had made | It was good Interviewer was very nice to me He only asked questions related to project and I showed my project to him by sharing my screen (Yaa , he also asked me to show the code and I Opened and explained my code to him ) | |||||||
54 | 7/8/2022 14:56:16 | 2:00 PM, 40 mins | Don't know | Pankaj Goyal | related to previous project which you have worked in team, 2 dsa question | Find duplicates from sorted list i gave an optimised time complexity but he was focused more on optimised space complexity and also asked me to code on codility and 2nd question was top 5 hash tags from stream of data coming in | yes why sde like why not core, instances of working in a team and situations u had to face and how to overcome them | It was good the interviewer was friendly | ||||||
55 | 7/8/2022 14:58:35 | 45min | Technical | Shraddha Srivastava | DSA, engage project | 1) Suppose there is a quiz game where you are given some characters, you should give input all the valid words formed using the characters given, you are not and you have to win the game, write a program to give all the valid words formed using the characters (you cannot miss a word or you cannot input an invalid word) | Introduction, about my engage project and how I can improve it if I was given 2 more months. | Interviewer seemed a bit strict. Overall, it's ok. | ||||||
56 | 7/8/2022 15:47:50 | 40 minutes | Technical | Ashish Prasad | He asked me to merge n number of linked list | He asked me about time complexity,space complexity, asked me to explain the code | No | Yeah it's good | ||||||
57 | 7/8/2022 15:51:32 | 1 hr | Don't know | Shraddha not sure! | Intro, Engage project, resume project, dsa | scientific Calculator func like for x^y and so and string permutation | Just intro, at last do you have any questions | Supportive interviewer , overall experience good | ||||||
58 | 7/8/2022 16:01:49 | 1hr | Don't know | Mudhumitha | Only DSA | Basically I was asked to design a backend for the web application. The question goes like this , since the online classes are happening widely the teacher needs to know who is active in the class and who is not and she needs the sorted list of the students according to their activity points. | She asked whether I have any questions for which I asked what keeps her driving each and every day towards technology and what are the challenges che face as a women in tech | Interviewer was really sweet , made me chill , I felt very comfortable, But the question which I got was not a normal kind , yea it was new to me. | ||||||
59 | 7/8/2022 16:07:25 | 45 min or 1 hr don't remember | Don't know | Dont remember | Dsa only -cold interviewer no happiness | Find missing positive no | πΆβπ«οΈπ₯²yr hr round me bhut mhnt ki h poori imandari se, aur kitte rounds lenge | |||||||
60 | 7/8/2022 16:24:06 | 45 min | Technical | Amit Singh | Dsa | Product two large numbers that can't fit into int | No | NA | ||||||
61 | 7/8/2022 17:58:54 | 45 minutes | Technical | Subham | DSA only | 1 coding question "Recover BST" from trees | No | Interviewer's name is Subham. Microphone and Camera should be turned on. Full screen should be shared. I was allowed to use pen and paper for my rough work purpose. I received a mail from Srija Nagam, I think she is the recruiter. My interviewer is cool guy and friendly , he made me comfortable first. My interview lasted for 45 minutes and it has only coding part , nothing related to my project or CS fundamentals .First he asked me to introduce myself. Then we went to coding part. He asked me to open any of the compiler I like to. I used Online GDB compiler, he told me to use any language that I want to code. My question was " RECOVER BINARY SEARCH TREE " question . Here is the question link: https://leetcode.com/problems/recover-binary-search-tree/ He just asked me to write a function that solves the function . No Tree building or no main function. First , he asked me my approach to solve the question. After I told my approach , he asked me to code for that. Then, interviewer pointed out some mistakes in my code regarding edge cases. He explained me some edge cases and asked me to rectify them in my code. After I wrote the code, interviewer asked me to dry run the code and explain my code. I was not asked to run my code. Then I explained the code and made dry run of it. Done with my coding part with this single question. Then he asked me weather I have any questions for him. I asked some questions to him. After he answered my questions, he said we are out of time now. Have a great day. That's all with my interview. | ||||||
62 | 7/8/2022 18:06:27 | 40mins | Don't know | Nitin Bajaj | Only two array questions | 1. Find peak element in the array. 2. given an array of size n. In the array n-1 elements are same and one element bigger than other. Find bigger element in minimum comparisons | Nope | It's was nice | ||||||
63 | 7/8/2022 23:08:54 | 45 mins | Technical | Don't remember | DSA | Reverse the sentence without reversing the letters of the actual word. Cannot use extra space or memory. Not allowed to use extra string. | Introduce yourself. How was your experience in Engage. What did you learn from the whole program. | It was decent. I did the code correctly with correct output but I guess the interviewer was not satisfied with the approach. Kept on asking for other approaches. | ||||||
64 | 7/9/2022 11:38:08 | 45 | Don't know | NA | DSA | Write program on notepad...to check given tree is BST ? | No | Good | ||||||
65 | 7/9/2022 19:04:55 | 30-35 mins | Don't know | Can't remember | Related to engage project, challenges I faced and changes in future. | Three sorted arrays of equal size and a target X are given. You need to check if by taking one element from each array, the sum can be equal to X. If yes then return those three elements. | Nope | Interviewer was pretty chill, my question could be done in O(n^2) using map, but he insisted on using binary search and I wrote the code of binary search approach and TC was O(n^2logn). | ||||||
66 | 7/11/2022 19:10:01 | 45-50mins | Technical | Mahesh | Dsa only | You are given arrival and departure times of n trains and you have to tell minimum number of platforms required. | No | It was okay. Interviewer was helping throughout. | ||||||
67 | 7/12/2022 11:22:24 | 25 | Technical | Manvendra something | Project discussion, tech stack, how uu approached, how uu planned, interaction with mentor ( I didn't get any mail from mentor so started complaing that π) | Given three arrays find the smallest common element A = {2,6,8,69,74} B = {1,3,6,45,65} C = {2,6,8,75,46,78} O/P - 6 | About Project, what you love to explore the most, frontend, backend , DSA | Interviewer was very good, Great discussion and happy ended | ||||||
68 | 7/12/2022 11:36:50 | 1 hour | Technical | dont remembered | DSA and based on projects i mentioned in resume and engage project | first quick intro of resume projects and then what i have builted in engage and how i implemented it Then question related to array and linkedlist 1 st. K reverse linked list https://www.interviewbit.com/problems/k-reverse-linked-list/ and asked me for implement it for array too 2nd. print all permutations of a given string with take care of same strings also | first quick intro of resume projects and then what i have builted in engage and how i implemented it | overall the interview was good the interviwer was amazing | ||||||
69 | 7/12/2022 11:55:59 | 35-40 mins | AA | Don't know | About engage project and one DSA ques | Implement Circular queue, then implement it using a counter variable | About yourself | Great experience | ||||||
70 | 7/12/2022 13:15:19 | 50min | Technical | Arpit Rastogi | Arrays | Asked 3 coding questions 1.magical index 2.Find if x is present in almost sorted array or not 3.print Spiral of matrix All questions optimized approach was asked | Tell me briefly about ur profile | The interviewer was great I asked him many questions about his work at Microsoft,he told me the parts were I could improve,I couldnβt complete the code but gave him correct approach | ||||||
71 | 7/12/2022 15:12:38 | 30 minutes | Technical | Joshna | Only one Dsa question | Dsa que- Given a string which is like a directory syntax in linux. You need to return the original directory output string of the input directory string. For ex :- Input - "/user///abcd///xyz/../xyz/ghe///..//home " Output - "/user/abcd/xyz/home " ".." means to go back to parent directory. ( I also don't know it initially). | No | Went well. | ||||||
72 | 7/12/2022 16:18:21 | 1hr | Technical | Harsh | code | Using any programming language remove the commented lines from c program and then return it back without using regular expressions | none | Sir was pretty chill and helped me throughout. he wanted to see my approach for the question given, using basic programming just to see what kind of logic i use. in between we only discussed about what all testcases my code will work for and which it wont, for which i would make the changes accordingly. it was a decent interview though i cant really predict what the result can be | ||||||
73 | 7/12/2022 17:21:39 | 45 min | Technical | Sandesh smth | pure DSA | he had asked me 1 leetcode medium type and 1 easy question (to be solved in codility platform) 1) reverse the words in string (no extra space,not recursion,no stack) 2) check whether the given array contains fixed point or not( fixed point condition --> A[i] ==i) ( binary search to be used) | Intro and at last any questions do you have | Interviewer was very cool, giving hints but stick to code, he wants my code be run perfectly. | ||||||
74 | 7/12/2022 17:32:40 | 1 hr | AA | Don't remember | DSA, engage project | Circular queue enqueuing and dequeuing | Tell me about yourself | Interviewer is so supportive and he encouraged to think more and more | ||||||
75 | 7/12/2022 18:25:45 | 45-50 min | Technical | Don't know | DSA medium level leetcode | Medium level leetcode Question of array using prefix and suffix technique | It was a nice experience | |||||||
76 | 7/12/2022 19:18:01 | 50 mins | Technical | Rahul Sharma | DSA | Palindrome Linked List Odd Even Linked List | - | It was okay I think. The interviewer didn't respond much | ||||||
77 | 7/12/2022 20:47:34 | 40 minutes | Technical | Atishay Jain | Dsa | 1)Search for an element in 2D matrix 2)Find 0 in 2D matrix and replace corresponding row and column as 0 | Tell me about yourself | Fine | ||||||
78 | 7/13/2022 11:10:49 | 45min | Don't know | Forgorπ | DSA | engage project detailed explanation counter questions about my engage project given 3 array find common smallest element was able to explain it partially the he asked what i know in dsa i said DP, array string etc the he asked .e the searching techniques i said linear.. binary with their complexity then he asked me to explain binary i did that then he asked me can i implement it? i said yes i implemented almost half of it on an online compiler and he said, he got it and it's enough and said now time is less do you have any questions for me? thats it | engage project detailed explanation | interviewer was an awesome and cool person and experience was good and it's ok if you can't answer everything he asks. | ||||||
79 | 7/13/2022 12:08:02 | 1 hr approx | AA | Vijay Manian | Rate the effectiveness of your project and how will u rate, what new thing you learnt in engage in technical aspect, what will u do if given 6 more weeks | Given two arrays, return an array after removing the common numbers | Introduction, Experience of Engage | Awesome, better than expected | ||||||
80 | 7/13/2022 21:26:40 | 35 minutes | AA | Mr. Subramaniam | I had detailed discussion on my engage project with the interviewer about my project's built to future scope and scaling of the project. I was asked about static and dynamic memory allocations, about time and space optimization, how it works and how it is connected with the performance of the system etc. I was also asked about my favourite day to day app and what i would like to improve in that app if given a chance to work in the team building that app. | No DSA question was being asked in my interview. All questions were based to test the analytical capability of the student. | Same as mentioned before. | The interviewer was really sweet and it went smooth overall. | ||||||
81 | 7/14/2022 11:21:56 | 45 | AA(Second Round) | Lalit Vohra | DSA, other projects I have done | 1. Efficient approach for a^b 2. Efficient approach for finding squares of numbers of sorted array in sorted form | Other projects I have done | The interviewer kept giving hints but I didn't get it until he almost spoonfed the solution. He was a nice interviewer, but my interview didn't go too well | ||||||
82 | 7/14/2022 12:02:48 | 40 minutes | Technical | Mayank Vyas | Dsa only | Add Bold tags to string (Leetcode medium level question) | Biggest technical challenge that I had ever faced | Nice . Interviewer is really nice and helping, just have regret that I am not able to perform well in Interview | ||||||
83 | 7/14/2022 12:36:23 | 50mins | Technical | Vignesh | https://www.google.com/amp/s/www.geeksforgeeks.org/add-two-numbers-represented-by-two-arrays/amp/ | https://www.google.com/amp/s/www.geeksforgeeks.org/add-two-numbers-represented-by-two-arrays/amp/ With some extra conditions And test cases | I prepared "introduce yourself" speech etc .. But interviewer went directly to technical part with out taking introduction. He said question in codility platform and I gave him 2approaches for solving the question He is expecting another approach He gave clue and I got that approach. I solved for test cases ..then slowly he Is adding the testcases and I got stucked in one test case and I told him approach but not haven't coded completely due to time factor.. He gave another sample input and me to check if Your code works in these type of inputs...yes my code is working.. Then time up He said bye ..All the best for future I asked for feedback. He told me to practice more since you are in 3rd year it's ok.. | |||||||
84 | 7/14/2022 12:45:28 | 1 hr 10 min | Technical | Harsh something | DSA | 1. given unsorted array find binary searchable elements. 2. Modification of flood fill algorithm | No...Not even intro | It was a very good experience he was very supportive and cooperative also... because I have some network issues. | ||||||
85 | 7/14/2022 14:04:44 | 1hr | AA(Second Round) | Don't remember | DSA and other projects | Given an array of stock prices, find the max profit that can be made when infinite number of transactions (buying and selling) are allowed | Other projects I have worked on and basic HR questions | My initial approaches were incorrect as it took me a lot of time to understand various unsaid constraints in the question. Interviewer guided me throughout and basically told me how to solve it,, so not expecting much :/ | ||||||
86 | 7/14/2022 15:44:06 | 45-50min | Technical | Tarun | DSA Questions, some concepts of OOPS, and question related to projects | Two DSA Questions one was from tree i.e Postorder Traversal and another question was from queue i.e. how we can implement queue using stack. | Some questions related to projects | Overally it was good the interviewer was very friendly firstly he asked me about what are the subject that i know till now like Data structures, DBMS, Operating system etc. I told him about the subjects that i know till know then he asked me the question on oops and gave two questions on DSA which I have to code in the codility platform and I coded it completely. At last he asked me if I have any questions and I asked some questions and the interview got over. | ||||||
87 | 7/14/2022 16:52:33 | 50 mins | AA(Second Round) | dont know | bit about project + 1 dsa question | given a url, replace the spaces with %20 | No | first asked introduction, explain engage project - cut me off in between and went to coding question. Asked me to code using c/c++ even though i said I'm more comfortable with python. Got syntax errors, but he said overall logic seems fine. Asked a few questions about projects on my resume and asked if i had any questions for him. | ||||||
88 | 7/14/2022 17:43:26 | 1 hr | Don't know | Sundeep Mishra | Intro, about resume projects, and challenges faced and dsa | Find nth node from end in linked list Next greater element in array | About projects | Interviewer was really great and helped me throughout and gave me more than enough hints | ||||||
89 | 7/14/2022 18:09:22 | 1 hour 15 min | Technical | Don't remember | Interview Experience: Microsoft Time: 1 hour 10 min It started with an introduction and brief discussions on the projects mentioned in my resume, engage project as well as other projects too Some questions related to responsiveness, CSS flexboxes and grids Realtime databases, MongoDB about authentication, caching + some more tech related to projects Two Coding questions: 1) Given an absolute path for a file (Unix-style), simplify it. Note that absolute path always begin with β/β ( root directory ), a dot in path represent current directory and double dot represents parent directory. "/a/./" --> means stay at the current directory 'a' "/a/b/.." --> means jump to the parent directory from 'b' to 'a' "////" --> consecutive multiple '/' are a valid path, they are equivalent to single "/". Input : /home/ Output : /home 2.) Print leafNodes in binary tree right to left, implement whole binary tree, create tree, print tree, everything from scratch + cross questions on every line you write | |||||||||
90 | 7/14/2022 23:35:24 | 45 mins | AA(Second Round) | Anju mayank | Project asked and asked the challenges faced | Anagrams of strings | Os data structures asked | Nice | ||||||
91 | 7/15/2022 13:34:01 | 45min | Technical | Don't know but he was engineering manager | I was asked behavioural qn in start regarding my prior internship experience. | I was asked level order traversal of the tree. both bfs and dfs approach explanation & code. | intro, difficult task you faced, moment you're proud of. | It was nice experience. interviewer made me comfortable. | ||||||
92 | 7/15/2022 15:13:51 | 40 min | AA | Don't remember | Only project | Explain all your projects. Future plan Tech stack used in project Use case of your project Challenges faced during engage project How are you debugging your project | Introduction Where do you see yourself after completing graduation Do you have any questions | Nice Interviewer was very cool and supportive | ||||||
93 | 7/15/2022 21:15:53 | 1:15hr | Technical | Don't Know | DSA Intro | 1. Implement BST using stack? 2. Detect cycle in Linked List? | Intro | Interviewer was chill and interview was pretty smooth. | ||||||
94 | 7/16/2022 22:30:47 | 1hr 15 mins on 14 July | Technical | Amit Saxena [Engg Manager at Microsoft, working on voice recognizer] | ML+ DSA+ DBMS | ML ques: what is K-Means?(as my engage project was based on it) DSA ques: Q1. Check if the given IPv4 address is valid or not. IPv4 is valid if it is of "___.___.___.___" this form, which have 4 octants seperated by 3 dots and the number in each octant is between 0-255(both inclusive)[to be coded in codelity] Q2. Convert decimal number to binary number.(by division method)[to be coded in codelity] DBMS ques: what have you learnt in DBMS? Which software did you used? Try to explain DML and DDL | What are your subjects in 4th Sem? Which one was your favourite? Some discussion about projects | Overall experience was good. The interviewer was very sweet and trying to help me throughout. There was some mic issue on MS Teams, it took about 25-30 mins to resolve that, till then I got very tensed, I felt like aaj to nhi hona mera interview - ab to gyi mai π’, but the interviewer was very supportive and the voice was connected through phone call. π The interview ended with a follow up question. | ||||||
95 | 7/18/2022 0:16:01 | 45-50 minutes | Technical | Ankit kumar | Intro, DSA | I was asked to implement a traverser class in a 2d Matrix, where the traverser should move in the way it is asked(up, down, left, right). Edge cases were to be covered | none | the discussion was pretty smooth, he gave hints and leads to work upon and made the whole process comfortable | ||||||
96 | 7/18/2022 21:45:59 | 45 min | Technical | don't know | DSA only | snake & ladder .......... | Intro | it went good. at first i took some time to understand the problem statement,then i told him my approach then code the problem. he was also giving some hints. | ||||||
97 | 7/19/2022 14:44:35 | 1hr | Technical | Dont remember | Pure DSA | GIven a array of integers both positive and negative, print the subarrays with sum 0. ( GFG HARD) | No | I solved the problem, but at the end interviewer said a corner case is missing. I quickly identified it and gave my solution. But still he was expecting some other edge case. My solution even matches with that on GFG. I hope I don't get rejected. | ||||||
98 | 7/19/2022 16:56:35 | 45 mins | Technical | Pooja sharma | Everything oops dsa dbms | Write partitions of given string with no value repeated in a partition. | Introduce yourself | Not so good as everything was asked | ||||||
99 | 7/19/2022 18:01:51 | 45 min approx | Don't know | Kalki raj something | Project, DBMS(in depth), OS(in depth) and DSA | Symmetrical Binary Tree | Database related counter questions | Overall experience is good. | ||||||
100 | 7/19/2022 21:59:58 | 1 hour | Don't know | Mohd Amanullah | A coding question is asked(given link in next ques) and some hr type questions | https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/description/ | Yes Asked to explain previous projects What you would develop if you are given all the resources? What motivated you to join engage programme? What should I take you for internship? Question like why Microsoft? Explain a situation where you used your troubleshooting skills? | Cool!! |