Find the smallest 3 integers in an array in O(n) time.
Internship Interview Questions
104,913 internship interview questions shared by candidates
Check if a String is a palindrome with complexity lesser or equal to O(n) and memory O(1). String could contain special characters and integers.
Convert aaabbbcccc -> 4a3b4c
Tell me about yourself? Tell me something about your project
//password_arr1 = ['polo', 'neal', 'nodl’] # Array Indexes representing the time when the password was last used //password_arr2 = ['lean', 'ldon', 'loop'] We were supposed to give the index in arr1 where the same frequency of each alphabet is present as elements in arr2.
I will focus on the final round since the first 2 steps are the same as before. Non techincal: 1. Tell me about yourself 2. What you have learnt from other students 3. What you have taught other students 4. What is your favorite project and what is the biggest obstacle
How would you add more functionality to the strategy board game you built? (forgot what exactly the functionality was)
How to find the middle element of a LinkedList in O(n)?
Leetcode 17
Given array of integers like sorted arrays for example: [6,7,8,3,4,5,1,2,10,11] need to return sorted array in place (efficient is important)
Viewing 561 - 570 interview questions