Juno Interview Questions and Answers

Q1. DSA on Arrays Buy and Sell stock
Ans. 
The Buy and Sell stock problem involves finding the maximum profit that can be made by buying and selling stocks in an array.
• Iterate through the array and keep track of the minimum price to buy and maximum profit to sell.

• Calculate the difference between each element and the minimum price, update maximum profit if a higher profit is found.

• Return the maximum profit at the end.
Answered by AI
Add your answer

Q1. Rotten Orange problem
Add your answer

Asked to automate company's webpage. To buy sell crypto

Q1. Solve a 2 pointer DSA Question
Ans. 
The two-pointer technique efficiently solves problems involving arrays or lists by using two indices to traverse data.
• 1. Initialize two pointers at the start and end of the array.

• 2. Move pointers based on conditions (e.g., sum, comparison).

• 3. Example: Find pairs in an array that sum to a target value.

• 4. Example: Reverse a string by swapping characters at two pointers.
Answered by AI
Add your answer
Q2. Explain Hashmap and Hashset
Ans. 
Hashmap and Hashset are data structures used in Java to store key-value pairs and unique elements respectively.
• Hashmap is used to store key-value pairs where keys are unique and values can be duplicated.

• Hashset is used to store unique elements only, no duplicates are allowed.

• Hashmap uses hashing to store and retrieve elements efficiently.

• Hashset internally uses Hashmap to store elements as keys with a dummy value.
Answered by AI
Add your answer

Q1. 1 Hour of Technical Discussion. 1. Basics Components of Android. 2. Launch Modes in Android 3. Lifecycle of Activity, fragment. 4. What is service in Details? 5. What is the difference between Runnable, H...read more
Add your answer