Reliance Retail Senior Engineer Interview Questions and Answers

Q1. Do you have any Technical Knowledge?
Ans. I have Technical Knowledge about Server & Computer Troubleshooting.
Answered by Manoj Namdev
Add your answer
Q2. Can you travel for Job
Ans. I can visit any part of India.
Answered by Manoj Namdev
Add your answer

Q1. Design principles for Low Level Architecture
Ans. 
Low level architecture design principles focus on optimizing performance, efficiency, and resource utilization.
• Optimize for performance by minimizing latency and maximizing throughput

• Efficiently utilize resources such as memory, CPU, and network bandwidth

• Design for scalability and flexibility to accommodate future growth

• Use modular and reusable components to promote maintainability and code reusability

• Consider security
Answered by AI
Add your answer
Q2. Mvcc architecture
Add your answer
Q3. Kafka Architecture
Add your answer

Q1. Asked about resume and then some questions on Linkedlist, Stack
Add your answer
Q2. Java garbage collection
Add your answer
Q3. What is Bean in Spring
Ans. 
A bean in Spring is a Java object that is instantiated, assembled, and managed by the Spring IoC container.
• Beans are defined in the Spring configuration file using XML or annotations.

• Beans are singleton by default but can be configured as prototype.

• Beans can have dependencies injected by the container.

• Example: @Component annotation in Spring creates a bean.

• Example:
Answered by AI
Add your answer

Q1. Write design for URL sortner
Ans. 
Design a URL shortener system
• Use a unique identifier for each long URL to generate a short URL

• Store the mapping of short URL to long URL in a database

• Implement a redirect mechanism to redirect short URLs to their corresponding long URLs

• Consider scalability and performance while designing the system
Answered by AI
Add your answer
Q2. Program to detect cycle on linked list
Ans. 
Use Floyd's Tortoise and Hare algorithm to detect cycle in a linked list.
• Initialize two pointers, slow and fast, at the head of the linked list.

• Move slow pointer by one step and fast pointer by two steps.

• If they meet at any point, there is a cycle in the linked list.
Answered by AI
Add your answer

2 coding problems.

One is on Hasmap

second one is on Tree

Q1. Pair programming Round
Add your answer
Q2. One problem step by step solving with unit test cases maintaining time complexity and space complexity.
Add your answer

Q1. High level Design
Add your answer

Q1. Techno - Managerial
Add your answer

Q1. Normal discussion benefits and salary
Add your answer

Mostly dynamic programming and tree based programs

Q1. Coding Coordinate geometry problem
Add your answer
Q2. Coding on trees
Add your answer

Q1. HLD / LLD , Java technical questions
Add your answer
Q2. Pair programming
Add your answer

Q1. Questions around spring boot. Rotate and array k times. Merge two sorted lists.
Add your answer

Q1. Flood fill algorithm, other problems and technical questions
Add your answer
Q2. Flood fill algorithm Other rech questions
Add your answer

Water bill management system
Flood fill algo