Detailed insights from real candidates who interviewed at top tech companies
Given an integer n, calculate the total sum of all combinations C(i,j), where (1Function: int solve(int n)Example:int n = 3C(3,3) = 3 mod 3 + 3 mod 3 = 0 + 0 = 0C(3,2) = 3 mod 2 + 2 mod 3 = 1 + 1 = 2C(3,1) = 3 mod 1 + 1 mod 3 = 2 + 2 = 4C(2,3) = 2 mod 3 + 3 mod 2 = 1 + 1 = 2C(2,2) = 2 mod 2 + 2 mod ...
Had a first round interview with Citadel for their NXT program. Applied as a Senior Software Engineer with 3 years of experience in backend and infrastructure development. The interview focused on a d...
Just had my first round interview with Citadel for their NXT program. I’m a Senior Software Engineer with 3 years of experience in backend and infrastructure development, and this was my first step in their process.Question:Design a data structure that supports two APIs:insert(num: int)findMedian():...
Implement Trie and it's supporting functions -* insert(word) - Insert a word in the trie,* search(word) - search if the word exists in the trie, and* startsWith(prefix) - search if there exist any word which starts with .Clarified if we are only dealing with lowercase alphabets. Yes.I implemented Tr...
3K+ Downloads
One of its unique features is an automated coding contest reminder, which sets alarms for upcoming coding contests on popular platforms like CodeChef, CodeForces, and LeetCode, without the need for user input. This feature ensures that users never miss a coding contest and can stay updated with the latest coding challenges.
