it was on campus drive held in my college on 28 october 2025, the selection is based on two rounds, oa and one technical interview, oa includes 4 questions, 2 are simples from array, and two was dp questions. i cleared oa, technical interview was a good experiences, a dsa question of dynamic programming(frog jumps in k islands) was asked, i tell him approach.

2 medium (string, arrays) and 1 dictionary (hard problem). all leetcode level questions. Interview was in hacker rank with camera on. The Challenge: Design a data structure to store the strings' count with the ability to return the strings with minimum and maximum counts. Implement a class that increments a string's count, decrements a string's count, gets the key with the maximum count, and gets the key with the minimum count—all in \(O(1)\) time complexity.