I recently appeared in the Atlassian Online Test for the University Developer position for the Sydney location.

Platform: HackerRank Time: 90 Minutes Questions: 5

1. Ashley Love Numbers: Given a range of numbers, find the numbers with no digits repeated (both numbers inclusive).
2. LIS: Longest Increasing Subsequence Length.
3. Wendy and Bob: A question on simple string manipulation. (Also appeared in the Volkswagen Online Test).
4. Modify an Array: Given an array, find the minimum cost to sort it ascendingly or descendingly along its length. Cost is defined as: MOD(New Value - Original Value) of the element.
5. Largest Subgrid Size With Given Maximum Sum Value.

My Experience: I solved 4 questions completely and 1 partially (10/11 test cases passed).

I received a call from the recruiter.

Telephonic Interview: Simple Linked List questions, my projects, resume probe, and internship experiences.

Given a graph (number of edges, number of nodes, and from and to node pairs), you need to find the minimum weighted path from the first node (1) to the last node (N) and return its weight. If there is no edge between any two vertices required to complete the path from the first to the last node, then an edge can be created between them with a weight of 1.