Ukg Sde Oa Question

Summary

I recently participated in the UKG SDE Online Assessment where I encountered a specific coding problem along with multiple-choice questions on CS fundamentals. My friend also received a different but identifiable LeetCode problem.

Full Experience

I recently took the Online Assessment for a Software Development Engineer role at UKG. The coding section presented me with a problem directly from LeetCode, specifically 'Maximize Greatness of an Array'. In addition to this, there were 19 multiple-choice questions covering Computer Science Fundamentals, including SQL, time complexities, and various data structures. I found the assessment to be crackable. Interestingly, one of my friends received a different coding problem, 'Minimum Length of Anagram Concatenation', which also appears to be a LeetCode problem. This suggests that questions can indeed repeat if you identify common patterns.

Interview Questions (2)

Maximize Greatness of an Array

Data Structures & AlgorithmsMedium

You are given a 0-indexed integer array nums of length n. The greatness of a permutation of nums is the number of indices i such that perm[i] > nums[i]. We want to maximize the greatness. Return the maximum possible greatness.

Minimum Length of Anagram Concatenation

Data Structures & AlgorithmsHard

Given a string s, find the minimum positive integer k such that s can be formed by concatenating k copies of some string t where t is an anagram of s[0...k-1].

Help the Community

Summary

Full Experience

Interview Questions (2)

Join the Discussion

No comments yet