Johnson & Johnson Software Developer Interview Questions and Answers

Q1. Oops related insharitance encapsulation
Add your answer

They asked easy to medium DSA . It includes arrays, strings, recursion.

Q1. Self introduction
Add your answer

Q1. React hooks, Explain using code
Ans. 
React hooks are functions that let you use state and other React features without writing a class.
• Hooks are functions that let you use state and other React features in functional components

• useState() is a hook that allows you to add state to functional components

• useEffect() is a hook that allows you to perform side effects in functional components

• useContext() is a hook that allows you to use the context API in functio
Answered by AI
Add your answer
Q2. Factory Patterns?
Add your answer
Q3. Liskov Substitution Principle
Ans. 
Liskov Substitution Principle states that objects of a superclass should be replaceable with objects of its subclasses without affecting the program's correctness.
• Subtypes must be substitutable for their base types.

• Derived classes must be able to replace their base classes without affecting the program's behavior.

• Violating this principle can lead to unexpected behavior and errors in the code.

• Example: If a program expec...read more
Answered by AI
Add your answer
Q4. Oops Concept and give examples
Ans. 
Oops concept is a programming paradigm that focuses on objects and classes.
• Oops stands for Object-Oriented Programming

• Key concepts include inheritance, encapsulation, polymorphism, and abstraction

• Examples: Class Car with properties like make, model, and methods like start(), stop()

• Example: Inheritance - Class SUV extends Car and adds property numSeats
Answered by AI
Add your answer
Q5. JQuery - Ajax mechanisms
Add your answer
Q6. Docker and Kubernetes - Azure concepts
Add your answer

Computer fundamentals

Q1. Technical questions of projects ,dsa
Add your answer

Q1. What is ur background
Add your answer
Q2. Manegarial and behavioral questions
Add your answer

IT was basic question from string and array

Q1. Data structure question find all leaf node from tree.
Ans. 
Use depth-first search to traverse the tree and identify leaf nodes.
• Implement depth-first search algorithm to traverse the tree.

• Identify nodes with no children as leaf nodes.

• Store leaf nodes in an array for retrieval.
Answered by AI
Add your answer
Q2. Print sentence word in reverse order without using default function. eg: input:-> I live in New York. output:-> I evil ni weN kroY.
Ans. 
Reverse each word in a sentence without using default function.
• Split the sentence into words

• Iterate through each word and reverse it

• Join the reversed words back into a sentence
Answered by AI
Add your answer

Q1. Programming question :Fibonacci series using recursion.
Ans. 
Fibonacci series using recursion is a classic programming problem where each number is the sum of the two preceding ones.
• Define a recursive function that takes an integer n as input

• Base case: if n is 0 or 1, return n

• Recursive case: return the sum of the previous two Fibonacci numbers

• Call the function recursively with n-1 and n-2 until base case is reached
Answered by AI
Add your answer
Q2. Programming question: Find 1st 2nd and 3rd highest from array of integer.
Ans. 
Find 1st, 2nd, and 3rd highest integers from an array.
• Sort the array in descending order.

• Retrieve the first three elements from the sorted array.

• Handle cases where array length is less than 3.
Answered by AI
Add your answer

Q1. They asked Puzzle
Add your answer

Q1. Salary Discussion
Add your answer