The Company of Others Software Engineer III Interview Questions, Process, and Tips

1. How to make an api call in java and count the number of items in the response?
2. Longest Incresing subsequence (leetcode)

with some MCQs in Java and microservices

Q1. What is java8. its features and uses
Ans. 
Java 8 is a major release of the Java programming language with new features like lambda expressions, streams, and default methods.
• Lambda expressions allow functional programming in Java.

• Streams provide a new way to work with collections in a more concise and efficient manner.

• Default methods allow interfaces to have method implementations.

• Java 8 also introduced the new Date and Time API for better handling of date and ...read more
Answered by AI
Add your answer
Q2. Use of microsevices in java. and its implmenatation
Ans. 
Microservices in Java are a way to design software applications as a collection of small, loosely coupled services.
• Microservices architecture breaks down a large application into smaller, independent services that can be developed, deployed, and scaled independently.

• Each microservice typically focuses on a specific business function and communicates with other services through APIs.

• Java is a popular language for implem...read more
Answered by AI
Add your answer
Q3. Design patterns in java.
Ans. 
Design patterns in Java are reusable solutions to common problems in software design.
• Design patterns help in creating maintainable and scalable code.

• Examples include Singleton, Factory, Observer, Strategy, and Decorator patterns.

• Each design pattern has its own purpose and implementation details.

• Design patterns promote code reusability and flexibility in software development.
Answered by AI
Add your answer
Q4. Find the height of binary tree using recursion?
Ans. 
Recursively find the height of a binary tree by comparing the heights of left and right subtrees.
• Start by checking if the root is null, return -1 if so.

• Recursively find the height of the left subtree and right subtree.

• Return the maximum of the heights of the left and right subtrees, plus 1 for the current node.
Answered by AI
Add your answer

Q1. Discussion about carrer summery. what is your roles and responsibilities in projects done by you. challanges faced in the developmenet area. how to identifty problems in code.
Add your answer
Q2. Find the longest substring in string without repeating characters
Ans. 
Find the longest substring in a string without repeating characters.
• Use a sliding window approach to iterate through the string.

• Keep track of the characters seen so far in a set.

• Update the start of the window when a repeating character is encountered.

• Calculate the length of the current substring and update the longest substring found.

• Repeat until the end of the string is reached.
Answered by AI
Add your answer