Qloron Pvt Ltd interview experience Real time questions & tips from candidates to crack your interview

Java Developer

Qloron Pvt Ltd
upvote
share-icon
1 rounds | 1 Coding problems

Interview preparation journey

expand-icon
Journey
I started my preparation by building a strong foundation in Core Java, focusing on OOP concepts, collections, multithreading, and exception handling. Alongside, I practiced DSA consistently on platforms like Coding Ninjas and Code360, revising topics such as arrays, strings, hashmaps, linked lists, and trees every week. To strengthen my backend development skills, I learned JDBC, Servlets, and later moved to Spring Boot and Hibernate/JPA, where I built projects like an Employee Management System and an E-commerce backend using Java, MySQL, and Spring Security. I also revised CS fundamentals like DBMS, Operating Systems, Computer Networks, and OOPs, which are often asked in interviews. For practice, I used YouTube, Coding Ninjas resources, and mock interviews to improve problem-solving and communication. With this, I feel confident in Java, DSA, backend frameworks, and databases, and well-prepared for interview challenges.
Application process
Where: Coding Ninjas Placement Cell
Eligibility: B.Tech (CS/IT)

Interview rounds

01
Round
Easy
Video Call
Duration
Interview date19 Mar 2025
Coding problem1

1. Find the unique numbers in an array

Given an array of integers, find and return all the unique numbers (numbers that appear exactly once in the array).

Problem approach

Naive Solution (Implemented):

  • I first explained the brute-force method using two nested loops.
  • For each element in the array, I checked if it appears again in the array.
  • If it was unique, I stored it in a result ArrayList.
  • Since the interviewer asked me to run the code, I implemented this approach and printed the output on the console using Online GDB.

Optimized Solution (Explained):

  • Due to time constraints (15-minute interview), I only explained the better approach verbally.
  • The optimized method uses a HashMap (or HashSet) to keep track of the frequency of each number.
  • After traversing the array, any element with frequency 1 can be identified as unique.
  • This improves the time complexity from O(n²) (naive) to O(n) (optimized).

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
3320 views
0 comments
0 upvotes
MERN Stack Developer
1 rounds | 1 problems
Interviewed by Qloron Pvt Ltd
103 views
0 comments
0 upvotes
Java Developer
1 rounds | 1 problems
Interviewed by Qloron Pvt Ltd
155 views
0 comments
0 upvotes
MERN Stack Developer
1 rounds | 1 problems
Interviewed by Qloron Pvt Ltd
103 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Java Developer
3 rounds | 20 problems
Interviewed by Ernst & Young (EY)
9061 views
2 comments
0 upvotes
company logo
Java Developer
3 rounds | 4 problems
Interviewed by SAP Labs
3149 views
0 comments
0 upvotes
company logo
Java Developer
2 rounds | 2 problems
Interviewed by HCL Technologies
7166 views
0 comments
0 upvotes