Planview Interview Questions, Process, and Tips

Karet Interview :
5 back to back System design question, we don't need to explain each component but more like list as many as points. Need to finish all the question in 15min

1-2 problem solving question : It's not fency algorithm round with tough question. But true problem solving round using basic knowledge such as hashmap, heap

Q1. Design File System : You have given file size and collection in input 1 : get total size 2 : find top k collections in size
Ans. 
Design a file system to calculate total size and find top k collections in size.
• Create a file system class with methods to add files and calculate total size.

• Maintain a data structure to store the collections and their sizes.

• Implement a method to find the top k collections based on size.

• Consider using a priority queue or sorting the collections based on size.

• Handle edge cases like empty collections or invalid input siz
Answered by AI
Add your answer
Q2. Find total size
Ans. 
Calculate the total size of an array of strings.
• Iterate through the array and sum the length of each string.

• Use the `length` property of each string to get its size.

• Handle edge cases such as empty strings or null values.
Answered by AI
Add your answer
Q3. Find Top k collections
Ans. 
The question is asking to find the top k collections.
• Use a sorting algorithm to sort the collections in descending order based on a specific criteria.

• Select the top k collections from the sorted list.

• Return the selected collections as an array of strings.
Answered by AI
Add your answer

Q1. Write code to find count of characters in string.
Ans. 
Count characters in a string using array of strings.
• Iterate through each string in the array

• For each string, iterate through each character and increment count

• Return the total count of characters
Answered by AI
Add your answer

Q1. Coding related questions
Add your answer

Q1. Atlassian Values
Add your answer