There were 2 questions in the PS round:\n\n**Q1:** https://leetcode.com/problems/largest-submatrix-with-rearrangements/\nI was able to think about the prefix height at every row but was confused about how to maximize by rearranging. However, with some help, I was able to complete it. After the interview, I checked my code/logic, and it was perfect.\nTime taken: 30 min\n\n**Q2:** https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/description/\nI solved this in 2 minutes using hashmaps, and the interviewer was shocked. He even tried some edge cases, but it worked flawlessly. After the interview, I checked my code again, and it was still flawless.\nTime taken: 5 min\n\nThe interview literally ended 10 minutes early, but 15 minutes later, I got an automated response that I was rejected. So, if I get stuck and ask for a hint, it means straight rejection. I called HR and asked for feedback to which she read the interviewer\'s words "the candidate was not able to complete the solution even after multiple hints? gap in knowledge for problem solving" lol nice\nSo if i have such shallow understanding why tf was Mr. prefect was shocked when i wrote the 2 sol under 5 mins \n\nThe Indian tech industry is doomed. All those who have jobs are lucky, but trust karma\u2014these stupid DSA-memorizing Indian devs will meet their fate later. \nHe asked me what tech stacks and technologies i am proficient with that discussion went for 5 mins \n\nframeworks : nestjs, nodejs, django, springboot. \ndb                 : mysql, postgres, mongodb (exploring cassandra and vitess.io)\ntimeseries optmised : mongo ts, timescale, influx \nsearch optmised       : elastic (open search), algolia(fully managed service)\n\n

There were 2 questions in the PS round:\n\nQ1: https://leetcode.com/problems/largest-submatrix-with-rearrangements/\nI was able to think about the prefix height