Daikin Software Developer Interview Questions and Answers

Q1. What is your weakness
Add your answer
Q2. What is pn junction diode
Ans. 
A pn junction diode is a semiconductor device that allows current to flow in one direction only.
• Consists of p-type and n-type semiconductor materials

• When forward biased, allows current to flow easily

• When reverse biased, blocks current flow
Answered by AI
Add your answer

Java and Data Strcuture

Q1. Matrix to find the nearest word
Ans. 
Find the nearest word in a matrix of strings
• Create a matrix of strings

• Calculate the distance between the input word and each word in the matrix

• Return the word in the matrix with the smallest distance to the input word
Answered by AI
Add your answer
Q2. Finding smallest subset in string
Ans. 
Find the smallest subset of strings in an array
• Iterate through the array and compare the length of each string to find the smallest subset

• Use a variable to keep track of the smallest subset found so far

• Return the smallest subset at the end
Answered by AI
Add your answer

Logical reasoning, quantitative

Q1. Java basics and intermediate
Add your answer
Q2. What is recursion
Ans. 
Recursion is a programming technique where a function calls itself in order to solve a problem.
• Recursion involves breaking down a problem into smaller subproblems and solving them recursively.

• It requires a base case to stop the recursive calls.

• Examples include factorial calculation, Fibonacci sequence generation, and tree traversal.
Answered by AI
Add your answer

DSA Based - Graph, Trees

Q1. Trie Implementation
Ans. 
Trie is a tree data structure used for efficient retrieval of key-value pairs.
• Trie is also known as prefix tree.

• Each node in a trie represents a single character of a key.

• Trie is commonly used in autocomplete and spell checking algorithms.

• Example: Inserting 'apple' and 'app' into a trie would result in a structure where 'app' is a prefix of 'apple'.
Answered by AI
Add your answer
Q2. LRU Implementation
Ans. 
LRU (Least Recently Used) is a cache eviction policy that removes the least recently used items first.
• LRU cache stores key-value pairs with a maximum capacity.

• When the cache is full, the least recently used item is removed to make space for new items.

• Each time a key is accessed, it is moved to the front of the cache to indicate it was recently used.
Answered by AI
Add your answer

Basic aptitude train, time and work distance

Q1. Basics about my project and 3 eazy level coding question
Add your answer

Q1. Discuss about salary and work cultrue
Add your answer

Easy to write with simole loetters to

Very easy to manipulate with this code

Aptitude duration One hours
Level moderate

Coding Test Duration 3 hours
Level moderate to hard