Online Assessment Question 1: Find shortest path between given source and target. Input was in the string format. So we need to create a graph first and then do BFS. Question 2: Fibonacci Series. Given array return Fibonacci number greater or equal to sum of array elements. --- Round 1 DSA Question: Given a transcript of meeting, find top k most talkative person in the meeting. No input format was given, we needed to decide this. I could not derive the test cases, interviewer gave some test cases all of them passed. He mentioned you should be able to think of test cases (which is very much obvious). My Solution (rate this code): ``` import java.util.*; import java.io.*; class Node { String personId; int freq; int length; Node(String pId, int length) { this.personId = pId; this.length = length; freq = 1; } @Override public String toString() { return personId; } } /** // key: personId, value: Node // Node: { // String personId, // int freq; // int length; // } */ class Main { public static List topKPersons(String transScript, int k) { String[] entries = transScript.split("\\|"); PriorityQueue pq = new PriorityQueue<>((a, b ) -> a.freq != b.freq ? b.freq -a.freq : b.length - a.length); Map map = new HashMap<>(); for(String entry: entries) { // System.out.print(entry); String[] pair = entry.split(":"); if(pair.length != 2) continue; String pId = pair[0]; String speech = pair[1]; if(!map.containsKey(pId)) { Node node = new Node(pId, speech.length()); map.put(pId, node); } else { Node node = map.get(pId); node.freq++; node.length += speech.length(); } } for(Map.Entry it : map.entrySet()) { // String pId = it.getValue(); Node node = it.getValue(); pq.add(node); // if(pq.size() < k) // pq.add(node); // else { // Node node = pq.remove(); // pq.add(node); // } } List res = new ArrayList<>(); for(int i=0 ; i res = topKPersons(trasnScript, 1); System.out.println(res); } } We left with 5 minutes after test cases and code analysis. I asked what was expectation how many problems were expected to solve, but he did not clarify this.