ukg logo
Ukg· SDE-3

SDE-3 || UKG

Posted
11 Jul 2026
68 reads

Summary

I interviewed for an SDE-3 position at UKG and completed three rounds covering concurrency, algorithms, system design, and SQL topics.

How it went

Directly applied using career portal and got a call for further process.

R1

  • intro
  • hashmap vs concurrenthashmap
  • functioial interface
  • runnable
  • threads
  • static vs volatile
  • question using stream (sort map with keys/value)
  • given n find unique number count till digits(n)
    • ex -> n = 2
    • then numbers will be 1,2,3,4,5,...,99
    • excluding 11,22,33,44,...,99
    • so we have to return count for unique digits numbers
  • max length substring in string with unique chars
  • docker/kube

R2

  • intro
  • 410. Split Array Largest Sum
  • 239. Sliding Window

R3

  • intro
  • current project
  • architecture
  • microservice patters
  • SAGA Pattern
  • Circuit breaker pattern
  • 918. Maximum Sum Circular Subarray
  • sort map with values-keys
  • sql 3rd highest salary
  • sql some complex query

Questions asked (5)

  1. 01

    Count Numbers with Unique Digits up to N Digits

    Data Structures & Algorithms

    Given an integer n, count how many numbers from 1 up to the largest number with n digits have all unique digits.

    Example:

    • n = 2 → consider numbers 1,2,3,...,99
    • Exclude numbers with repeated digits such as 11, 22, 33, ..., 99
    • Return the count of numbers that have only unique digits.
  2. 02

    Longest Substring with All Unique Characters

    Data Structures & Algorithms

    Find the maximum length substring of a given string such that all characters in the substring are distinct.

  3. 03

    Split Array Largest Sum

    Data Structures & Algorithms · Hard

    Given an array of non‑negative integers and an integer m, split the array into m non‑empty continuous subarrays. Minimize the largest sum among these subarrays and return that minimum possible largest sum.

  4. 04

    Sliding Window Maximum

    Data Structures & Algorithms · Hard

    Given an integer array nums and a sliding window size k, return an array containing the maximum value in each sliding window of size k as the window moves from left to right.

  5. 05

    Maximum Sum Circular Subarray

    Data Structures & Algorithms · Medium

    Given a circular integer array nums (the end of the array connects to the beginning), find the maximum possible sum of a non‑empty subarray of nums. The subarray may wrap around the end of the array.

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!