AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Keyloop Lead Developer Interview Questions and Answers
Keyloop Lead Developer Interview Experiences
1 interview found
Anonymous
Selected
I applied via Naukri.com and was interviewed before Jul 2022. There were 5 interview rounds.
. NET CORE design patterns oops and linq queries AWS reactjs
(1 Question)
- Q1. . NET CORE linq queries design patterns object oriented programming
(1 Question)
- Q1. . NET CORE design patterns object oriented programming reactjs aws
(1 Question)
- Q1. Company policies SALARY discussion leave policy insurance and perks
Interview Preparation Tips
And great experience
Lead Developer Jobs at Keyloop
Interview questions from similar companies
Interview Questionnaire
9 Questions
- Q1. Questions related to the work done at my previous company
- Q2. Find if a given directed graph is cyclic or not
- Ans.
To check if a directed graph is cyclic or not
Use Depth First Search (DFS) algorithm to traverse the graph
Maintain a visited set to keep track of visited nodes
Maintain a recursion stack to keep track of nodes in the current DFS traversal
If a node is visited and is already in the recursion stack, then the graph is cyclic
If DFS traversal completes without finding a cycle, then the graph is acyclic
- Q3. You have a stream of bytes from which you can read one byte at a time. You only have enough space to store one byte. After processing those bytes, you have to return a random byte. Note: The probability of...
- Ans.
Return a random byte from a stream of bytes with equal probability.
Create a variable to store the count of bytes read
Create a variable to store the current random byte
For each byte read, generate a random number between 0 and the count of bytes read
If the random number is 0, store the current byte as the random byte
Return the random byte
- Q4. Find if a given Binary Tree is BST or not
- Ans.
Check if a binary tree is a binary search tree or not.
Traverse the tree in-order and check if the values are in ascending order.
For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.
Use recursion to check if all nodes in the tree satisfy the above condition.
- Q5. Devise an algorithm to determine the Nth-to-Last element in a singly linked list of unknown length. If N = 0, then your algorithm must return the last element. You should parse the list only once
- Ans.
Algorithm to find Nth-to-Last element in a singly linked list of unknown length
Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning
Move both pointers simultaneously until the second pointer reaches the end of the list
The first pointer will be pointing to the Nth-to-Last element
If N=0, return the last element
Parse the list only once
- Q6. Given an array of integers, print all possible permutations. Also explain your approach
- Ans.
Print all possible permutations of an array of integers
Use recursion to swap elements and generate permutations
Start with the first element and swap it with each subsequent element
Repeat the process for the remaining elements
Stop when all elements have been swapped with the first element
Print each permutation as it is generated
- Q7. Design a Stack DS that also prints in O(1) the minimum element you pushed in the stack
- Ans.
Design a stack that prints the minimum element pushed in O(1)
Use two stacks, one for storing elements and another for storing minimums
When pushing an element, compare it with the top of minimum stack and push the smaller one
When popping an element, pop from both stacks
To get the minimum element, just return the top of minimum stack
- Q8. Given a linked list with loop, how would you find the starting point of the loop ?
- Ans.
To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.
Use two pointers, one moving at twice the speed of the other.
When they meet, move one pointer to the head of the list and keep the other at the meeting point.
Move both pointers one step at a time until they meet again, which is the starting point of the loop.
- Q9. Find a number a matrix mat[m][n] where all the rows and columns are sorted non-decreasingly. What will be the complexity of the solution
- Ans.
To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.
Use binary search to find the number in each row and column
Start from the top-right corner or bottom-left corner to optimize search
Time complexity: O(m log n) or O(n log m) depending on the starting corner
Interview Preparation Tips
College Name: Na
Skills evaluated in this interview
I applied via Referral
Java internals, coding questions 2sum
(2 Questions)
- Q1. Hld of your previous project
- Ans.
Developed a web-based project management tool for tracking tasks and deadlines.
Used React.js for front-end development
Implemented RESTful APIs for backend using Node.js and Express
Utilized MongoDB for database storage
Incorporated authentication and authorization features for user security
- Q2. Question related to self build projects
(2 Questions)
- Q1. Salary negotiation
- Q2. Location constrain if any
- Ans.
Open to relocation for the right opportunity
Willing to relocate for the right job opportunity
Flexible with location for the right role
Open to considering different locations for the right position
Selected
I appeared for an interview before Feb 2022.
(1 Question)
- Q1. Linked list (detect loop, reverse, delte a node) tree (height, DFS) graph theory concept C++ basic questions
(1 Question)
- Q1. Total 3 round of Technical interviews.
Interview Preparation Tips
(1 Question)
- Q1. Tell me about yourself, availability, visa-related questions
Dynamic programming questions, longg time to complete the 2 questions
Problem solving : a clock with 3 hands, no numbers written, guess what it is
1 hour 3 questions easy to medium leetcode.
Selected
I applied via Campus Placement and was interviewed in Apr 2023. There were 3 interview rounds.
Platform - Mettl
3 Questions of medium level difficulty to do in 2 hours, typically contain concepts like DSA, DP etc.
(3 Questions)
- Q1. What is structure padding?
- Ans.
Structure padding is the insertion of unused bytes between structure members to align them on memory boundaries.
Padding is added to ensure that each member of a structure starts at a memory address that is a multiple of its size.
Padding is compiler-dependent and can vary between different platforms and architectures.
Padding can affect the size of a structure and the performance of the program.
Example: struct example { ...
- Q2. College Project discussion
- Q3. Form a dictionary from name.
- Ans.
Forming a dictionary from name
Create an empty dictionary
Iterate through each character in the name
Add the character as a key and its frequency as value in the dictionary
Skills evaluated in this interview
I applied via Naukri.com and was interviewed in Mar 2023. There were 2 interview rounds.
(2 Questions)
- Q1. Reactive forms in angular
- Ans.
Reactive forms in Angular are a way to build forms in a reactive and scalable way.
Reactive forms use an underlying data model to manage form data.
They allow for dynamic form creation and validation.
They can be used with complex form structures and nested forms.
They provide a more scalable and maintainable approach to form development.
Example: Creating a reactive form with FormBuilder in Angular.
- Q2. Dependency injection
Interview Preparation Tips
Skills evaluated in this interview
MONALI kothari
(1 Question)
- Q1. Copy constructor implementation it was based on
(1 Question)
- Q1. Binary search question on array
(1 Question)
- Q1. Experience and expectations on salary
I applied via Naukri.com and was interviewed in Feb 2022. There were 2 interview rounds.
(1 Question)
- Q1. Basic node.js and javascript.
(1 Question)
- Q1. More discussion towards the existing project.
Interview Preparation Tips
Keyloop Interview FAQs
Some of the top questions asked at the Keyloop Lead Developer interview -
Tell us how to improve this page.
Keyloop Interviews By Designations
- Keyloop Analyst Interview Questions
- Keyloop Softwaretest Engineer Interview Questions
- Keyloop Infrastructure Engineer Interview Questions
- Keyloop Lead Developer Interview Questions
- Keyloop Digital Marketer Interview Questions
- Keyloop Senior Member Technical Interview Questions
- Keyloop Intern Interview Questions
- Keyloop Software Trainee Intern Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Java Developer Interview Questions
- Senior Software Developer Interview Questions
- Full Stack Developer Interview Questions
- Application Developer Interview Questions
- Salesforce Developer Interview Questions
- DOT NET Developer Interview Questions
- Senior Java Developer Interview Questions
- Show more
Keyloop Lead Developer Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
Keyloop Lead Developer Reviews and Ratings
based on 1 review
Rating in categories
|
Consultant
24
salaries
|  ₹13.7 L/yr - ₹25.6 L/yr |
|
Senior Member Technical
22
salaries
| ₹10 L/yr - ₹25 L/yr |
|
Support Analyst
15
salaries
| ₹4 L/yr - ₹5.5 L/yr |
|
Technical Support Analyst
14
salaries
| ₹5.5 L/yr - ₹8.4 L/yr |
|
Senior Software Engineer
12
salaries
| ₹8.2 L/yr - ₹30 L/yr |
Duck Creek Technologies
FinThrive
Mobileum
AgreeYa Solutions
- Home >
- Interviews >
- Keyloop Interview Questions >
- Keyloop Lead Developer Interview Questions
