AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Evergent UI Developer Interview Questions and Answers
Evergent UI Developer Interview Experiences
1 interview found
Quant,reasoning questions are came
(1 Question)
- Q1. Mcq thet given,cpde readng questions
Interview Preparation Tips
Top trending discussions
Interview questions from similar companies
I applied via Naukri.com and was interviewed before Jul 2019. There were 4 interview rounds.
Interview Questionnaire
3 Questions
- Q1. Questions about the projects you worked with. About how specific coding challenges were solved. How it could have been done other ways. etc.
- Q2. About Python versions and differences. Impact on frameworks.
- Q3. About module design, apis.
Interview Preparation Tips
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 Company Website and was interviewed before May 2018. There were 3 interview rounds.
Interview Questionnaire
2 Questions
- Q1. Questions about Oops, data structures based on the projects I had done, and my resume
- Q2. Questions about classes and abstraction
Interview Preparation Tips
I applied via Campus Placement and was interviewed in Sep 2021. There was 1 interview round.
Interview Preparation Tips
Software Developer Interview Questions & Answers
RxLogix Corporation
Anonymous
posted on 15 Jun 2024
Selected
I applied via Campus Placement and was interviewed before Jun 2023. There were 3 interview rounds.
Logical reasoning and general aptitude
Data structures and algorythm questions
(2 Questions)
- Q1. Previous company culture and challenges
- Ans.
My previous company fostered a collaborative culture but faced challenges with communication and project management.
Emphasis on teamwork: Regular brainstorming sessions encouraged idea sharing.
Open-door policy: Management was approachable, fostering a sense of trust.
Challenges with remote work: Miscommunication often occurred due to time zone differences.
Project management issues: We struggled with scope creep, leading...
- Q2. Expectations from this company.
Interview Preparation Tips
I applied via Campus Placement
Aptitude questions with 2-3 coding questions
(2 Questions)
- Q1. Input-wwwrrrrttttuu Output - w3r4t4u2
- Q2. Interpreter vs compiler
- Ans.
Interpreter executes code line by line, compiler translates code into machine code before execution.
Interpreter translates code into machine code line by line during runtime
Compiler translates code into machine code before execution
Interpreted languages include Python, JavaScript
Compiled languages include C, C++
I applied via Campus Placement and was interviewed in Mar 2024. There was 1 interview round.
There were 5 question out of which 2 were coding Data Structure problems , 1 was SQL based , 1 was AI based Problem ( Machine Learning ) and 1 was to create UML Diagram.
First Coding question was pretty easy , other one was kinda tough , UML Diagram was also easy and SQL query was of moderate level.
Interview Preparation Tips
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
It was combination of mcqs and 2 coding questions
(3 Questions)
- Q1. What is oops concepts
- Ans.
Object-oriented programming concepts that focus on objects and classes for better code organization and reusability.
Encapsulation: Bundling data and methods that operate on the data into a single unit (class).
Inheritance: Ability of a class to inherit properties and behavior from another class.
Polymorphism: Ability to present the same interface for different data types.
Abstraction: Hiding the complex implementation det...
- Q2. Difference between java nd putjon
- Ans.
Java is a programming language while Putjon is not a recognized term in software development.
Java is a widely used programming language for developing applications.
Putjon is not a recognized term in software development, it may be a typo or a specific term not commonly used.
There is no direct comparison between Java and Putjon as they are not related.
- Q3. Tell about ur project
(2 Questions)
- Q1. What are your strengths
- Q2. What is ur greatest comeback
Skills evaluated in this interview
Evergent Interview FAQs
Tell us how to improve this page.
Evergent Interviews By Designations
- Evergent UI Developer Interview Questions
- Evergent Manager Talent Acquisition Interview Questions
- Evergent Senior Software Developer Interview Questions
- Evergent Director Interview Questions
- Evergent Software Developer Interview Questions
- Evergent Test Engineer Interview Questions
- Evergent Confidential Interview Questions
- Evergent Application Support Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
Overall Interview Experience Rating
based on 1 interview experience
Interview Questions from Similar Companies
|
Senior Software Engineer
30
salaries
|  ₹9.3 L/yr - ₹22 L/yr |
|
Software Engineer
29
salaries
| ₹4.8 L/yr - ₹14.1 L/yr |
|
Lead Engineer
19
salaries
| ₹15 L/yr - ₹30 L/yr |
|
Application Support Engineer
18
salaries
| ₹3.5 L/yr - ₹10.2 L/yr |
|
QA Engineer
17
salaries
| ₹4.1 L/yr - ₹10.8 L/yr |
Yodlee
Fingent
Bravura Solutions
CloudMoyo
- Home >
- Interviews >
- Evergent Interview Questions
