Kohinoor Asiana Hotel Full Stack Developer Interview Questions and Answers

Q1. What is gcd? And explain it
Ans. 
gcd stands for greatest common divisor, the largest positive integer that divides two or more numbers without leaving a remainder.
• gcd is used to find the largest integer that can evenly divide two or more numbers.

• It is commonly used in mathematics and computer science algorithms.

• For example, the gcd of 12 and 18 is 6, as 6 is the largest number that can divide both 12 and 18 without leaving a remainder.
Answered by AI
Add your answer
Q2. What is arc and explain it
Ans. 
ARC stands for Automatic Reference Counting, a memory management technique used in programming languages like Objective-C and Swift.
• ARC automatically tracks and manages the memory used by objects in a program

• It increases the retain count of an object when it is referenced and decreases it when it is no longer needed

• ARC helps prevent memory leaks and retain cycles in iOS and macOS development
Answered by AI
Add your answer

Q1. Solid principles and multithreading
Add your answer

Q1. Past work experience and salary expectations
Ans. 
I have 5 years of experience in software development, focusing on web applications and agile methodologies, seeking a competitive salary.
• Worked at XYZ Corp for 3 years, developing a customer management system that improved client interactions by 30%.

• Led a team of 4 developers in creating a mobile app that increased user engagement by 50%.

• Implemented CI/CD pipelines that reduced deployment time by 40%, enhancing overall...read more
Answered by AI
Add your answer

Basic aptitude questions, length of test varies from time 2 time

Q1. Basic questions covering topics from java oops, collections, and exception handling, few more questions about spring core concepts and springboot internal working one coding problem about java strings
Add your answer

Q1. Just some casual questions about past experiences
Add your answer

It was good and nice to talk

Q1. Introduction about yourself
Add your answer
Q2. Oops concept question
Ans. 
Object-Oriented Programming (OOP) is a programming paradigm based on the concept of objects, which can contain data and code.
• Encapsulation: Bundling data and methods that operate on the data within one unit (e.g., a class).

• Inheritance: Mechanism to create a new class using properties and methods of an existing class (e.g., a 'Dog' class inheriting from an 'Animal' class).

• Polymorphism: Ability to present the same interf...read more
Answered by AI
Add your answer

Q1. About youself job profile
Add your answer
Q2. Salary negotations
Add your answer

Q1. String immutable
Add your answer
Q2. Concurrent hashMap working
Ans. 
ConcurrentHashMap is a thread-safe implementation of the Map interface in Java.
• ConcurrentHashMap allows multiple threads to access and modify the map concurrently.

• It achieves thread-safety by dividing the map into segments, allowing concurrent access to different segments.

• Each segment acts as an independent hash table, reducing contention between threads.

• ConcurrentHashMap provides atomic operations like putIfAbsent(), ...read more
Answered by AI
Add your answer

Q1. There were two technical and one HR round. Question were scenario based on sql and .net applications.
Add your answer
Q2. Replication of Databases
Ans. 
Replication of databases involves copying and maintaining multiple copies of the same database for redundancy and fault tolerance.
• Replication helps in ensuring high availability and fault tolerance by having multiple copies of the same data.

• There are different types of replication such as master-slave replication, master-master replication, and multi-master replication.

• Replication can be synchronous or asynchronous, wi...read more
Answered by AI
Add your answer

Q1. I was not selected for round two
Add your answer
Q2. I am not aware of question in 2nd technical
Add your answer

Q1. I was not selected for HR round
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

Q1. 
Word Break Problem Statement
You are given a list of N strings called A. Your task is to determine whether you can form a given target string by combining one or more strings from A.
The strings from A c...read more
Ans. 
Given a list of strings, determine if a target string can be formed by combining one or more strings from the list.
• Iterate through all possible combinations of strings from the list to form the target string.

• Use recursion to try different combinations of strings.

• Check if the current combination forms the target string.

• Return true if a valid combination is found, otherwise return false.
Answered by AI
Add your answer
Q2. 
All Paths From Source Lead To Destination Problem Statement
In a directed graph with 'N' nodes numbered from 0 to N-1, determine whether every possible path starting from a given source node (SRC) eventua...read more
Ans. 
Determine if all paths from a source node lead to a destination node in a directed graph.
• Check if there is at least one path from source to destination.

• If a node has no outgoing edges, it should be the destination.

• Ensure the number of paths from source to destination is finite.

• Traverse the graph to validate all paths lead to the destination.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

Q1. 
Maximum Non-Adjacent Subsequence Sum
Given an array of integers, determine the maximum sum of a subsequence without choosing adjacent elements in the original array.
Input:
The first line consists of an...read more
Ans. 
Find the maximum sum of a subsequence without choosing adjacent elements in an array.
• Use dynamic programming to keep track of the maximum sum at each index, considering whether to include or exclude the current element.

• At each index, the maximum sum can be either the sum of the current element and the element two positions back, or the sum at the previous index.

• Iterate through the array and update the maximum sum accor...read more
Answered by AI
Add your answer
Q2. 
Find All Anagrams Problem Statement
Given a string STR and a non-empty string PTR, identify all the starting indices of anagrams of PTR within STR.
Explanation:
An anagram of a string is another string ...read more
Ans. 
Given a string STR and a non-empty string PTR, find all starting indices of anagrams of PTR within STR.
• Create a frequency map of characters in PTR.

• Use sliding window technique to check anagrams in STR.

• Return the starting indices of anagrams found.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

First half of the interview was based on DBMS, OS and some puzzles. Second half was dedicated to projects related questions.

Round duration - 20 Minutes
Round difficulty - Easy