Gazon Communications Full Stack Developer Interview Questions and Answers

Mathematics and patterns

Data structures and Algorithms

Q1. Round 1 is about basic questions on technology
Add your answer

Q1. Round is about high level design and data structure questions
Add your answer

It involves 2 problem solving logical questions

Q1. Sql related ques mege into, rank,dense rank,queries of joins etc.
Add your answer
Q2. Java 8 related ques optional and stream
Add your answer

2 coding question 1 hr

Topic on environment issue

Q1. Normal discussion
Add your answer
Q2. Where are u from
Add your answer

It is very easy. Practice daily on Indiabix

I was given 2-3mins yo speak on the topic. It was is Indian Education system needs modification. Be confident while speaking.

Q1. How to optimise fetching 1 lakh entries from db
Ans. 
Use pagination, indexing, caching, and query optimization to fetch 1 lakh entries efficiently from the database.
• Implement pagination to fetch data in smaller chunks

• Create indexes on columns frequently used in queries

• Use caching to store frequently accessed data

• Optimize queries by avoiding unnecessary joins and using appropriate indexes

• Consider using database-specific optimizations like query hints or stored procedures
Answered by AI
Add your answer

Round duration - 70 minutes
Round difficulty - Medium

Link was active for 24 hours, I took the test at night.
Difficulty was medium.
There were some MCQs on Springboot/Java along with 2 DSA questions.

Q1. 
Zigzag Binary Tree Traversal Problem
Given a binary tree, compute the zigzag level order traversal of the node values in the tree. The zigzag traversal requires traversing levels from left to right, then ...read more
Ans. 
Zigzag level order traversal of a binary tree is computed by alternating between left to right and right to left traversal at each level.
• Use a queue to perform level order traversal of the binary tree.

• Maintain a flag to switch between left to right and right to left traversal at each level.

• Store the node values in a list while traversing and alternate the order based on the flag.

• Example: For input 1 2 3 4 -1 5 6 -1 7 -...read more
Answered by AI
Add your answer
Q2. 
K Closest Points to Origin Problem Statement
Your house is located at the origin (0,0) of a 2-D plane. There are N neighbors living at different points on the plane. Your goal is to visit exactly K neighb...read more
Ans. 
Find the K closest points to the origin in a 2-D plane using Euclidean Distance.
• Calculate the Euclidean Distance of each point from the origin

• Sort the points based on their distances from the origin

• Return the first K points as the closest neighbors
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Technical round (Questions on Java, Spring Boot, Microservices, Rest APIs, OOPs and Solid principals).

Round duration - 45 minutes
Round difficulty - Easy