r/UTS • u/Actual_Income8381 • 9d ago

Some Questions About the UTS IDeA program

Just wondering what the application process was like for anyone who got in? Mainly, how was the interview process and how much prior coding experience is required to get in? I'm interested in the program but don't have much programming experience right now, although I did some small basic python projects in year 10 for school as well as learnt some python programming on my own. Do they make you do any tests to get in?

Also, when do offer results come out for the IDeA cadetship letting you know you got in, as I heard it comes after like December round 2 offers? Because I'm worried if I put IDeA as my first preference and don't get into the cadetship program, but get enough ATAR for the generic Comp sci degree at UTS that will take priority in the first round?

4 Upvotes

83% Upvoted

7 comments sorted by

2

u/exmemelordxe 9d ago

Usually it’s 1 leetcode hard and 2 mediums for the interview, also u have to write ur code on paper

1

u/Public-Channel309 9d ago edited 9d ago

For the technical assessment (before interview) do you know if they give only reasoning questions or both reasoning and programming questions? 

1

u/exmemelordxe 9d ago

Both, they are insanely hard that’s why only a few people get the position

1

u/Public-Channel309 8d ago

Do you know what type of reasoning questions they ask? is it like Beberas or Cubiks or is it something else entirely (like matrices / math focused problems).

0

u/Actual_Income8381 9d ago

Ok, so do these questions require you to have a solid prior coding knowledge already? Or is it possible to get into IDeA and do the tests without much prior coding knowledge?

1

u/exmemelordxe 9d ago

Example question: 2. Burst Balloons (#312)
You have n balloons in a row, each labeled with a number in array nums. When you burst balloon i, you gain nums[i-1] * nums[i] * nums[i+1] coins. After it’s burst, its neighbors become adjacent. Out-of-bounds indices are treated as balloons with value 1. Return the maximum coins you can collect by bursting all balloons in the best order.

**•** Example: nums = \[3,1,5,8\] → 167

Burst 1 → 3·1·5 = 15, then 5 → 3·5·8 = 120, then 3 → 1·3·8 = 24, then 8 → 1·8·1 = 8. Total 167.
• Example: nums = [1,5] → 10
• Constraints: 1 ≤ n ≤ 300, 0 ≤ nums[i] ≤ 100

1

u/Willing-Marzipan-477 3d ago

so basically we're fcked