AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
CogniAIm Software Developer Interview Questions, Process, and Tips
CogniAIm Software Developer Interview Experiences
1 interview found
Anonymous
Selected
I applied via Referral and was interviewed before Dec 2021. There were 2 interview rounds.
An assignment was given to complete it.
(6 Questions)
- Q1. Concepts of React, Firebase and Redux.
- Q2. Difference between class and Functional components
- Ans.
Class components are ES6 classes that extend React.Component while functional components are functions that return JSX.
Class components have state and lifecycle methods while functional components don't.
Functional components are simpler and easier to read and test.
Class components are used when we need to manage state or use lifecycle methods while functional components are used for simple UI components.
Example of clas...
- Q3. How firebase works and how redux works ?
- Ans.
Firebase is a backend platform for building web and mobile applications, while Redux is a state management library for JavaScript applications.
Firebase provides a real-time database, authentication, hosting, and other services for web and mobile apps.
Redux is used to manage the state of an application in a predictable way, making it easier to debug and test.
Firebase can be used with Redux to store and retrieve data fro...
- Q4. Why Redux is used more ?
- Ans.
Redux is used more due to its ability to manage complex state and simplify data flow in large applications.
Redux provides a centralized store for application state
It allows for predictable state management through actions and reducers
Redux can be used with various front-end frameworks such as React, Angular, and Vue
It simplifies data flow in large applications by providing a clear separation of concerns
Redux also enabl...
- Q5. Basic questions on Firebase.
- Q6. Why Functional components is preferred over class components ?
- Ans.
Functional components are preferred over class components due to their simplicity and better performance.
Functional components are simpler and easier to read and write.
They do not require the use of 'this' keyword, which can be confusing.
Functional components are faster and have better performance than class components.
They are easier to test and debug.
Functional components can be used with React Hooks, which provide a...
Interview Preparation Tips
Skills evaluated in this interview
Interview questions from similar companies
I appeared for an interview before Sep 2020.
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.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked me some Computer Science 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'.
Interview Preparation Tips
Do lot of hard work and practice of Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.
Application resume tips for other job seekersMake your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.
Final outcome of the interviewSelectedSkills evaluated in this interview
I applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 interview rounds.
(1 Question)
- Q1. Basic questions of java.
(1 Question)
- Q1. Intro and other hr related questions.
Interview Preparation Tips
SAMKIT JAIN
I appeared for an interview in Aug 2017.
Interview Questionnaire
7 Questions
- Q1. Implement Merge Sort.
- Ans.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
- Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
- Ans.
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
- Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
- Ans.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
- Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
- Ans.
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
- Q5. Implement AVL Tree.
- Ans.
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
- Q6. Minimum number of squares whose sum equals to given number n.
- Ans.
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
- Q7. Insertion sort for a singly linked list.
- Ans.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
Interview Preparation Tips
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22
Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.
Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.
College Name: The LNM Institute Of Information Technology, Jaipur
Skills evaluated in this interview
I appeared for an interview before May 2021.
Round duration - 90 minutes
Round difficulty - Medium
Around 65-70 people sat for the test. 15 people were shortlisted. It consisted of the following to be done in 90 minutes.
- 28 MCQs based on core CS
- 2 Coding questions – everyone had different and random questions. Most questions were custom logic based (easy level) including some standard questions – LCS, LIS, topological sort.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Interviewer was very friendly. It started with the standard – tell me about yourself / introduce yourself type of question. Then he proceeded and asked two coding questions
- Q1.
Remove Duplicates from a Sorted Linked List
Your friend has homework to complete. Help him by removing duplicates from a sorted linked list.
You are given the 'Head' of a sorted linked list. Modify the l...
- Ans.
Remove duplicates from a sorted linked list without adjacent duplicates.
Traverse the linked list while comparing current and next nodes.
If they are equal, skip the next node by updating the current node's next pointer.
Repeat until the end of the list is reached.
- Q2.
Course Schedule Problem Statement
You are enrolled as a student and must complete
Ncourses, numbered from 1 to N, to earn your degree.Some courses have prerequisites, which means that to take course
i,... - Ans.
Check if it is feasible to complete all courses with prerequisites.
Create a graph representing the prerequisites with courses as nodes and edges as prerequisites.
Perform a topological sort on the graph to check if there is a cycle (if there is, then it's not feasible to complete all courses).
If there is no cycle, then it is feasible to complete all courses.
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
This round had only 1 question. The interviewer introduced himself. And he advised me to clearly understand the problem before proceeding.
- Q1.
LCA of Binary Tree Problem Statement
You are given a binary tree of distinct integers, along with two nodes, ‘X’ and ‘Y’. Your task is to determine the Lowest Common Ancestor (LCA) of ‘X’ and ‘Y’.
The LC...
- Ans.
Find the Lowest Common Ancestor of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the Lowest Common Ancestor.
Implement a recursive function to efficiently find the LCA.
Handle cases where one node is an ancestor of the other.
Consider edge cases like when X or Y is the root node.
(4 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Pretty Good Round. Fast Paced. We covered a lot of ground.
- Q1.
Binary Search Tree Iterator Problem Statement
Design and implement a class
BSTIteratorto perform an in-order traversal over a Binary Search Tree (BST). Your implementation should include the following me... - Ans.
Design and implement a class BSTIterator to perform in-order traversal over a Binary Search Tree (BST).
Implement a parameterized constructor to initialize the iterator with the root of the BST.
Implement a method 'next()' to return the next smallest element in in-order traversal.
Implement a method 'hasNext()' to check if there exists a next smallest element in traversal.
Ensure the output is the in-order traversal of the
- Q2.
Maximum Consecutive Ones Problem Statement
Given a binary array 'ARR' of size 'N', your task is to determine the maximum length of a sequence consisting solely of 1’s that can be obtained by converting at...
- Ans.
Find the maximum length of a sequence of 1's by converting at most K zeroes into ones in a binary array.
Iterate through the array and keep track of the current window of 1's and zeroes.
Use a sliding window approach to find the maximum length of consecutive 1's by flipping at most K zeroes.
Update the window based on the number of zeroes flipped and keep track of the maximum length found so far.
Return the maximum length ...
- Q3.
BFS in Graph Problem Statement
You are given an undirected and disconnected graph
G(V, E)havingVvertices numbered from0toV-1andEedges. Your task is to print its BFS traversal starting from the 0t... - Ans.
BFS traversal of an undirected and disconnected graph starting from vertex 0.
Start BFS traversal from vertex 0 and visit all connected nodes in sorted order.
Use a queue to keep track of nodes to visit next.
Keep a visited array to avoid revisiting nodes.
Print the BFS traversal path as the nodes are visited.
Example: For input V=5, E=4 and edges 0-1, 0-2, 1-3, 2-4, the BFS traversal will be [0, 1, 2, 3, 4].
- Q4.
Dijkstra's Shortest Path Problem Statement
Given an undirected graph with
Vvertices (labeled 0, 1, ..., V-1) andEedges, each edge connects two nodesXandYwith a specified weight representing the dis... - Ans.
Dijkstra's algorithm is used to find the shortest path distance from a source node to all other nodes in an undirected graph.
Implement Dijkstra's algorithm to find the shortest path distance from node 0 to all other nodes in the graph.
Use a priority queue to efficiently select the next node with the shortest distance.
Initialize distances to all nodes as infinity, except for the source node which is 0.
Update distances t...
(1 Question)
Round duration - 60 minutes
Round difficulty - Hard
Bar Raised Round. Definitely felt the difficulty.
- Q1.
First Non-Repeating Character Problem Statement
You are given a string consisting of English alphabet characters. Your task is to identify and return the first character in the string that does not repeat...
- Ans.
Identify and return the first non-repeating character in a string, or the first character if all characters repeat.
Iterate through the string to count the frequency of each character
Iterate through the string again to find the first character with frequency 1
If no such character is found, return the first character of the string
Interview Preparation Tips
Tip 1 : Practice at least 250 Questions, Give yourself enough time for preparation. Cramming won't take you very far. In books, I really liked Elements of Programming Interviews.
Tip 2 : Make sure to brush up your basics - coding style, OOPs, Language features. They help in making an impression.
Tip 3 : Don't worry about solving the question in the interview. Learn to tackle any random problem with the best of your ability. More often than not, that'd be enough.
Tip 1 : Keep your resume clean - no graphics, no multiple fonts. Keep it one page.
Tip 2 : Don't go over board in mentioning skills, only mention the things you are truly confident about.
Skills evaluated in this interview
I appeared for an interview before Jun 2016.
Interview Questionnaire
4 Questions
- Q1. Tell me something about yourself
- Ans.
I am a passionate software developer with 5 years of experience in web development and a strong background in computer science.
5 years of experience in web development
Strong background in computer science
Passionate about software development
- Q2. Questions related to project I have worked on during college days
- Q3. Core Java concepts
- Q4. Why do you use two mobile numbers
- Ans.
To separate personal and professional calls, and to ensure availability and accessibility.
Separate personal and professional calls
Ensure availability and accessibility
Maintain work-life balance
Avoid mixing personal and work-related contacts
Interview Preparation Tips
Total Questions: 60
College Name: Watumull Institute Of Electronics Engineering And Computer Technology ( WIEECT )
Interview Questionnaire
15 Questions
- Q1. Reverse a binary search tree in such a manner so that parent child relationship maintained and left child become right child and vice versa
- Ans.
Reverse a binary search tree while maintaining parent-child relationship.
Start by swapping the left and right child of each node recursively.
Use a depth-first search approach to traverse the tree.
Make sure to update the parent-child relationships accordingly.
- Q2. Find the minimum and maximum element in stack in O(1)
- Ans.
To find min and max element in stack in O(1), we can use an auxiliary stack.
Create an auxiliary stack to keep track of the minimum and maximum elements.
Push the first element to both the main and auxiliary stack.
For each subsequent element, compare it with the top element of the auxiliary stack and push the smaller element to the auxiliary stack.
To get the minimum element, simply return the top element of the auxiliary...
- Q3. Given an array find the next minimum element in array for each element. for example if give array is 4,2,1,5,3 resultant array would be 2,1,-1,3,-1
- Ans.
Given an array, find the next minimum element for each element.
Iterate through the array
For each element, compare it with the elements on its right
Find the minimum element greater than the current element
If no such element exists, assign -1
Build the resultant array
- Q4. Given two string A and B . remove each character from string A which occur in B. if a occur 2 times in B remove 2 a from A
- Q5. Find the median of input stream in minimum time complexcity.(Online algo)
- Ans.
Find median of input stream in minimum time complexity using online algorithm.
Use two heaps, one max heap for elements smaller than current median and one min heap for elements greater than current median.
Maintain balance between the two heaps by ensuring that the size difference is at most 1.
If the size of both heaps is equal, median is the average of the top elements of both heaps. Else, median is the top element of ...
- Q6. Make copy of a linked list which has two pointer one point to next node and other one point to arbitrary node in linked list
- Ans.
To make a copy of a linked list with two pointers, iterate through the original list and create a new node for each element.
Iterate through the original linked list
Create a new node for each element
Set the 'next' pointer of each new node
Set the 'arbitrary' pointer of each new node
- Q7. If u will access data from a social networking site such as Facebook . suggest some method to remove latency to access data
- Q8. Given a cordinate system in which there are n points. you have to calculate the m minimum points from some origin point. Suggest a data structure for this
- Q9. Some question on hash data structure
- Q10. Given a linked list and some no n . you have to reverse the node of linked list in pair of n. consider all test cases for this
- Ans.
Reverse the nodes of a linked list in pairs of n
Iterate through the linked list in pairs of n
Reverse the nodes within each pair
Connect the reversed pairs together
Handle cases where the number of nodes is not a multiple of n
- Q11. Given a array where the difference between two consecutive element is one. Given a no find that no in array in minimum time complexity
- Q12. How to check singly linked list is palindrome or not
- Ans.
To check if a singly linked list is a palindrome, reverse the second half and compare it with the first half.
Traverse the linked list to find the middle node
Reverse the second half of the linked list
Compare the reversed second half with the first half to check for palindrome
- Q13. Given a preorder of binary tree such that in tree each node have either 0 or no childern. and each leaf node is represented by N. construct a tree from this
- Ans.
Given a preorder of binary tree with leaf nodes represented by N, construct the tree.
Start by creating an empty stack.
Iterate through the preorder list.
If the current element is N, create a leaf node and push it onto the stack.
If the current element is not N, create a new node and set its left child to the top of the stack.
Pop the top of the stack and set it as the right child of the new node.
Push the new node onto the...
- Q14. 14. you have given a string of multiline. you have to print the maximum occupancy word in each line and if there is some capital letter in each line then print each capital letter occupancy and then smal...
- Ans.
The question asks to find the maximum occupancy word in each line of a given multiline string and also count the occupancy of capital and small letters separately.
Split the multiline string into individual lines
For each line, split it into words
Initialize variables to store the maximum occupancy word and its count
Iterate through each word and count the occupancy of each letter
If the current word has a higher occupancy ...
- Q15. One question related to password matching you have given some precondition for password then user input some password then you will validate the password with each condition if any one condition failed th...
Interview Preparation Tips
Skills evaluated in this interview
I appeared for an interview in Sep 2016.
Interview Questionnaire
3 Questions
- Q1. Tell me about yourself
- Ans.
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java, Python, and web development technologies
Strong problem-solving skills and ability to work in a team
Completed multiple projects including a web-based inventory management system
- Q2. Simple coding questions..Basically pattern.
- Q3. And also they will ask about your projects.
Interview Preparation Tips
Experience: 60 multiple choice questions so have to manage time carefully.
Tips: Have to give equal importance to all the sections..So try to do well in all section.
Duration: 1 hour 30 minutes
Total Questions: 60
Round: Technical + HR Interview
Experience: Don't panic...Only write those things that you know in your resume.
Skills: Smart Coding
College Name: Jaypee Institute Of Information Technology, Noida
I appeared for an interview in May 2017.
Interview Preparation Tips
Total Questions: 20
Round: Group Discussion
Duration: 1 hour
Skills: Coding Skills And Knowledge On Data Structures
I appeared for an interview in Jun 2017.
Interview Preparation Tips
Duration: 1 hour 30 minutes
Skills: Engineering Basics
CogniAIm Interview FAQs
Tell us how to improve this page.
Interview Questions for Popular Designations
- Senior Software Developer Interview Questions
- Associate Software Developer Interview Questions
- Lead Software Engineer Interview Questions
- Software Development Engineer II Interview Questions
- Software Engineer Interview Questions
- Software Development Engineer 1 Interview Questions
- Software Engineer Level 1 Interview Questions
- Senior Software Engineer Interview Questions
- Show more
CogniAIm Software Developer Interview Process
based on 1 interview
Interview experience
Software Developer Interview Questions from Similar Companies
CogniAIm Software Developer Reviews and Ratings
based on 1 review
Rating in categories
|
Full Stack Developer
7
salaries
|  ₹1.8 L/yr - ₹4.5 L/yr |
|
Web Developer
3
salaries
| ₹3 L/yr - ₹4 L/yr |
TCS
Accenture
Wipro
Cognizant
- Home >
- Interviews >
- CogniAIm Interview Questions >
- CogniAIm Software Developer Interview Questions
