Round 1 (Telephonic)
- What is LRU. How to Implement it.
- Find kth smallest element in an array. Solution: GeeksforGeeks Link
- In a file, there are two columns, first column has some word (String) and 2nd column has some value (Double).
Example :- ABC 23.4 ERF 34.89 WERT 122.9 Now user wants some arithmetic operations like 1) ABC + ERF = 23.4 + 34.89 = 58.29 2) ABC - WERT = 23.4 - 122.9 = -99.5
- Design an efficient DS for these kind of operations.
- Asked about current Project.
- Given a string str. You have to make this string to square string with maximum length. A square string is of the following format:
str = x + x; where x is any string. Return length of this square string.
Example str = ababa Max length square string = 4; str = abcd Max length square string = 1;
- Asked about current project. Asked to draw architecture of my project. Then Asked to design a new feature that is currently not there in my project.
- Design undo and redo operation in Microsoft Word like text editor.
- Design Hit Counter. (Design Hit Counter)
- Asked about current project.
- You are given a text file. You have to return the list of starting index of the given word in text file. Design an efficient DS for that.
Example :- Text file content : "geeks for geeks" word : "geeks" List : {0,10}