Hare Krishna Movement Interview Questions and Answers

Aptitude round consists Logical reasoning, General Aptitude, Grammar related questions etc. All are moderate level questions.

Q1. Explain OOPs w.r.t Java
Ans. 
OOPs is a programming paradigm that uses objects to represent real-world entities. Java is an OOPs language.
• OOPs stands for Object-Oriented Programming System

• Java is a class-based OOPs language

• Encapsulation, Inheritance, Polymorphism, and Abstraction are the four pillars of OOPs

• Objects have state and behavior

• Java supports interfaces, which allow for multiple inheritance

• Example: A car can be represented as an object wit...read more
Answered by AI
Add your answer
Q2. Explain about the projects that you have worked on
Add your answer
Q3. Explain how Java solves machine dependency of code execution
Ans. 
Java solves machine dependency by using bytecode and virtual machine.
• Java code is compiled into bytecode which is platform-independent

• The bytecode is executed by the Java Virtual Machine (JVM) which is platform-specific

• JVM translates bytecode into machine code for the specific platform

• This allows Java code to run on any platform with a JVM installed

• Example: A Java program compiled on Windows can run on Linux or Mac as
Answered by AI
Add your answer

Q1. Why should we hire you?
Add your answer
Q2. Tell me about yourself.
Add your answer

Aptitude, reasoning, English, cloud sections

2 questions in which , one has to complete within an 50 minutes

Q1. Tell me about t Yourself
Add your answer
Q2. What are the previous experiences
Add your answer

Numerical ability and logical reasoning followed by some coding mcqs

Q1. Print 1 to 100 without for loop
Ans. 
Printing 1 to 100 without for loop
• Use recursion to print numbers from 1 to 99

• Print 100 outside the recursion

• Use a base case to stop recursion at 100
Answered by AI
Add your answer

Simple aptitude test

Q1. General questions as per your cv
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Round duration - 50 minutes
Round difficulty - Easy

Round duration - 60 minutes
Round difficulty - Easy

At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.

Round duration - 40 minutes
Round difficulty - Easy

The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked me some Com­puter Sci­ence‍ fundamentals in this round as well as some behavioural questions.

Q1. Implement a Trie data structure and write functions to insert and search for a few words in it.
Ans. 
Implement a Trie data structure with insert and search functions.
• Create a TrieNode class with children and isEndOfWord attributes.

• Implement insert function to add words by iterating through characters.

• Implement search function to check if a word exists by traversing the Trie.

• Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.
Answered by AI
Add your answer