6D Technologies Junior Java Developer Interview Questions and Answers

Q1. Reverse a string
Ans. 
Reverse a given string
• Create an empty string to store the reversed string

• Iterate through the original string from end to start and append each character to the new string

• Return the reversed string
Answered by AI
Add your answer
Q2. Database mysql join
Add your answer

Q1. Reverse a linked list.
Add your answer
Q2. Merge sort on a array/
Ans. 
Merge sort is a divide-and-conquer algorithm that sorts an array by recursively splitting and merging sorted subarrays.
• 1. Divide the array into two halves until each subarray contains a single element. Example: [38, 27, 43, 3, 9, 82, 10] becomes [38, 27, 43] and [3, 9, 82, 10].

• 2. Recursively sort each half. Example: [38, 27, 43] becomes [27, 38, 43] and [3, 9, 82, 10] becomes [3, 9, 10, 82].

• 3. Merge the sorted halves b...read more
Answered by AI
Add your answer

No too easy tests c++ oops concepts

Q1. Be thorough with data structures
Add your answer

Be thorough with oops and core cs subjects

Q1. Hashmap working Sql joins Java 8 features
Add your answer

Q1. Roles and responsibilities
Add your answer

1st round some apt qns,some prgramming qns are they asked

Q1. C depth concepts and some prgram
Add your answer

Q1. Some DSA questions they asked
Add your answer

Q1. Could you provide details about the projects listed in your resume?
Ans. 
I worked on various projects, including a web app for task management and a mobile app for fitness tracking.
• Developed a task management web app using React and Node.js, enabling users to create, update, and delete tasks.

• Implemented RESTful APIs for seamless data interaction between the front-end and back-end.

• Created a mobile fitness tracking app using Flutter, allowing users to log workouts and track progress.

• Integrate...read more
Answered by AI
Add your answer
Q2. How do you convert a linked list to a circular linked list using pointers in C language?
Ans. 
Convert a linked list to a circular linked list by linking the last node to the head node using pointers in C.
• 1. Define a structure for the linked list node.

• 2. Traverse to the last node of the linked list.

• 3. Set the next pointer of the last node to the head node.
Answered by AI
Add your answer
Q3. Which stack you know
Ans. 
I am proficient in the MERN stack, which includes MongoDB, Express.js, React, and Node.js for full-stack web development.
• MongoDB: A NoSQL database that stores data in flexible, JSON-like documents.

• Express.js: A web application framework for Node.js, simplifying server-side development.

• React: A JavaScript library for building user interfaces, particularly single-page applications.

• Node.js: A runtime environment that allo...read more
Answered by AI
Add your answer
Q4. What is time complexity and how we measure
Ans. 
Time complexity measures the amount of time an algorithm takes to complete as a function of the input size.
• Time complexity is expressed using Big O notation (e.g., O(n), O(log n)).

• It helps in comparing the efficiency of different algorithms.

• For example, a linear search has O(n) time complexity, while a binary search has O(log n).

• Best, average, and worst-case scenarios can be analyzed for more insights.

• Time complexity i...read more
Answered by AI
Add your answer
Q5. Data structures
Add your answer

Q1. Tell me about yourself
Ans. 
I'm a passionate software developer with a strong background in full-stack development and a love for problem-solving.
• Over 5 years of experience in software development, specializing in JavaScript and Python.

• Worked on a project that improved application performance by 30% through code optimization.

• Collaborated with cross-functional teams to deliver high-quality software solutions on time.

• Strong understanding of Agile m...read more
Answered by AI
Add your answer