Tietoevry C Developer Interview Questions and Answers

Q1. Basic Java Question
Add your answer
Q2. Spring Boot related questions
Add your answer

Q1. Design a rest API and code it.
Ans. 
Design and code a REST API for a software developer interview.
• Define the endpoints and HTTP methods for the API (e.g. GET /users, POST /users)

• Implement authentication and authorization mechanisms (e.g. JWT tokens)

• Use proper status codes for responses (e.g. 200 OK, 401 Unauthorized)

• Include error handling and validation for input data

• Document the API using tools like Swagger or OpenAPI
Answered by AI
Add your answer
Q2. Questions related to JPA HIBERNATE SQL
Add your answer

Q1. Discussion related to Last company Project and architecture level questions
Add your answer
Q2. Write code to calculate frequency of a word using Stream API and lambda expressions
Ans. 
Calculate word frequency using Stream API and lambda expressions
• Use Stream API to convert array of strings to stream

• Use Collectors.groupingBy to group words by their frequency

• Use Collectors.counting to count the occurrences of each word
Answered by AI
Add your answer

Q1. Interceptors, Guards, AOT vs JIT
Add your answer
Q2. Angular Lifecycle hooks, unit tests, lazy loading
Add your answer

Q1. Multithreading, process and performance
Add your answer
Q2. Process handling
Add your answer
Q3. Coding questions
Add your answer

Hackerrank coding round.

Q1. Questions and coding testing your OOPS knowledge
Add your answer

Q1. Every tech stack, SQL, OOPS, JAVA
Add your answer

Q1. OS questions,graph dfs question, geeks for geeks chocolate factory question
Add your answer

Q1. Children sum property trees,height of BT
Ans. 
The question is about implementing a children sum property in trees and finding the height of a binary tree.
• Children sum property in trees means that the value of a node must be equal to the sum of the values of its children nodes.

• To find the height of a binary tree, you can recursively calculate the height of the left and right subtrees and return the maximum height plus one.

• Example: For a binary tree with nodes 1, 2,
Answered by AI
Add your answer

Q1. Tell me about your self
Add your answer
Q2. About technical questions
Add your answer
Q3. About current project
Add your answer

Q1. Kubernetes internals
Add your answer
Q2. Spring boot internals
Add your answer

Q1. Introduce yourself?
Add your answer