40 questions · from 9 interviews · 2 asked more than once
Ukg interview questions
Every question candidates reported from their Ukg interviews, most frequently asked first. Each links to the write-up it came from, so you can see the round and how it went.
Ukg coding and DSA questions
- 01
Valid Parentheses
The third round included a DSA question on validating the syntax of parentheses in a string.
Easy · Asked 2 times · From UKG worst Interview Experience | 3 YOE | Java Developer
- 02
Count Numbers with Unique Digits up to N Digits
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…
From SDE-3 || UKG
- 03
Longest Substring with All Unique Characters
Find the maximum length substring of a given string such that all characters in the substring are distinct.
From SDE-3 || UKG
- 04
Split Array Largest Sum
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.
Hard · From SDE-3 || UKG
- 05
Sliding Window Maximum
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.
Hard · From SDE-3 || UKG
- 06
Maximum Sum Circular Subarray
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.
Medium · From SDE-3 || UKG
- 07
Longest Substring Without Repeating Characters
Find the length of the longest substring in a given string that contains all unique characters. As a follow-up, print the substring itself.
Medium · From UKG On-Campus Interview Experience(SDE Intern - 6 month)| Selected🎉
- 08
Implement LRU Cache
Design and implement a Least Recently Used (LRU) cache. It should support the following operations: get(key) which retrieves the value of the key if it exists in the cache, otherwise returns -1; and put(key, value) which inserts or updates the value if the…
Medium · From UKG On-Campus Interview Experience(SDE Intern - 6 month)| Selected🎉
- 09
Maximize Greatness of an Array
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.
Medium · From UKG SDE OA Question
- 10
Minimum Length of Anagram Concatenation
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] .
Hard · From UKG SDE OA Question
- 11
Find Peak Element
Another DSA question in the third round was to find a peak element in an array.
Medium · From UKG worst Interview Experience | 3 YOE | Java Developer
- 12
Browser Navigation using Doubly Linked List
Design a system for browser navigation (forward/backward) using a doubly linked list.
- 13
Jump to Previous Tab (LRU-style)
Design a system to jump to a previous tab using a map and a doubly linked list, similar to an LRU cache.
- 14
Rotate Linked List
Given the head of a linked list, rotate the list to the right by k places (LeetCode 61).
- 15
Linked List Implementation (Create, Insert, Delete, Search)
Implement the core functionalities of a linked list: creation, insertion, deletion, and searching for elements.
Easy · From UKG Interview Experience | Selected🎉
- 16
NP Problems and Travelling Salesman Problem
Discuss familiarity with NP problems and specifically the Traveling Salesman Problem, focusing on concepts rather than coding.
- 17
Approaches for Dijkstra, DFS, and BFS
Discuss the conceptual approaches for Dijkstra's algorithm, Depth-First Search (DFS), and Breadth-First Search (BFS) without implementation.
- 18
House Robber Problem Variation (DP)
A medium-level Dynamic Programming problem, described as a variation of the House Robber problem.
Medium · From UKG | Lead Software Engineer | SDE 3 | Interview Experience | 2025
- 19
Intersection of Two Linked Lists
Given the heads of two singly linked lists headA and headB, return the node at which the two lists intersect. If the two linked lists have no intersection at all, return null.
Easy · From UKG Interview Experience Full Stack Developer
- 20
Lowest Common Ancestor of a Binary Tree
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes p and q in the tree. The LCA is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).
Medium · From UKG Interview Experience Full Stack Developer
Ukg system design questions
- 01
Design a Parking Lot System
Design a parking lot system. Provide an oral explanation of its structure and consider the application of SOLID principles in its design.
Medium · From UKG On-Campus Interview Experience(SDE Intern - 6 month)| Selected🎉
- 02
Design LinkedIn Database Schema
Design the database schema for a platform like LinkedIn, focusing on identifying the necessary tables, their relationships, and considerations for scalability.
Hard · From UKG On-Campus Interview Experience(SDE Intern - 6 month)| Selected🎉
- 03
Rate Limiting Implementation
I was asked about rate limiting, where I explained its definition, different algorithms like token bucket and sliding window, and a possible implementation using Spring Boot.
From UKG worst Interview Experience | 3 YOE | Java Developer
- 04
JWT-based Authentication and Session Flow
Explain the concepts and workflow of JWT (JSON Web Token) based authentication and session management.
- 05
User Role Identification After Login
Describe the mechanism for identifying and managing user roles (e.g., buyer/seller) after a user successfully logs in.
- 06
RDBMS vs NoSQL Discussion
Engage in a deep discussion comparing RDBMS and NoSQL databases, including scenarios for when to use each.
Ukg behavioural and HR questions
- 01
Opinion on AI (Good or Bad)
What is your perspective on Artificial Intelligence, specifically whether you consider it to be good or bad for society or technology?
From UKG On-Campus Interview Experience(SDE Intern - 6 month)| Selected🎉
- 02
What does UKG do?
Research and explain the core business and services of UKG.
- 03
Preferred Job Location
State your preferred job location and the reasoning behind it.
- 04
Strengths and Weaknesses
What are your strengths and weaknesses?
- 05
Meaning of Money
What does money mean to you?
- 06
Handling Rejection
What if you don’t get selected?
- 07
Tell Me About Yourself
This is a standard behavioral question typically asked at the beginning of an interview to help interviewers understand your background, experience, and career aspirations.
Ukg other questions
- 01
Git Commands
Question(s) related to Git commands.
Asked 2 times · From UKG | Lead Software Engineer | SDE 3 | Interview Experience | 2025
- 02
Find Second Highest Salary
Write an SQL query to find the second highest salary from an employee table.
Easy · From UKG On-Campus Interview Experience(SDE Intern - 6 month)| Selected🎉
- 03
SQL Join Employee and Department with Unassigned Handling
Write an SQL query to join employee and department tables, showing “No Department” for employees not assigned to any department.
- 04
ACID Properties
Discuss the ACID properties (Atomicity, Consistency, Isolation, Durability) in the context of database transactions.
- 05
Java Streams and Their Use
Explain what Java Streams are and how they are used.
- 06
React Stateless Components
Explain the concept of Stateless Components in React.
- 07
SQL Query for 5th Largest Row
Write an SQL query to retrieve the 5th largest row or value from a table. Assume a table with relevant data where the concept of 'largest' is clearly defined (e.g., based on a salary column).
Medium · From UKG Interview Experience Full Stack Developer
Ukg interview questions FAQ
What questions are asked in Ukg interviews?
Candidates reported 40 distinct questions across 9 Ukg interviews. 20 coding and DSA questions, 6 system design questions, 7 behavioural and HR questions, 7 other questions.
Which Ukg interview questions are asked most often?
The most repeated are "Valid Parentheses" (2 times), "Git Commands" (2 times).
How difficult are Ukg interview questions?
Of the questions candidates rated, 24% were easy, 53% medium and 24% hard.