ukg logo
Ukg路 Software Development Engineer

UKG SDE OA Question

Result
Ongoing
Posted
16 Aug 2025
434 reads

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.

How it went

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.

Questions asked (2)

  1. 01

    Maximize Greatness of an Array

    Data Structures & Algorithms 路 Medium

    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.

    Open the problem
  2. 02

    Minimum Length of Anagram Concatenation

    Data Structures & Algorithms 路 Hard

    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].

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Ukg recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!