Cognic Systems SDE Interview Questions and Answers

Basic aptitude questions, you can find on internet.

Q1. Question from trees and link list.
Add your answer
Q2. How you can optimise reversal process in a tree
Ans. 
To optimize reversal process in a tree, use iterative post-order traversal with a stack.
• Implement iterative post-order traversal using a stack to efficiently reverse the tree.

• Start by pushing the root node onto the stack.

• While the stack is not empty, pop a node, push its children onto the stack in reverse order, and then push the node itself.

• Repeat this process until all nodes have been visited and reversed.

• This method...read more
Answered by AI
Add your answer

60 minutes of coding round with medium level of question asked

Coding and Aptitude MCQ questions

Q1. How i can design a login system for client?
Ans. 
Designing a login system for clients involves creating secure authentication methods and user management.
• Implement secure password hashing algorithms like bcrypt to store passwords securely.

• Use HTTPS to encrypt data transmission between client and server.

• Implement multi-factor authentication for added security.

• Utilize session management to keep track of user login status.

• Consider implementing account lockout mechanisms
Answered by AI
Add your answer
Q2. What is foreign key and how you can you can use foreign key in your DBMS system?
Ans. 
Foreign key is a key used to link two tables in a database, enforcing referential integrity.
• Foreign key is a column or a set of columns in one table that references the primary key in another table.

• It ensures that the values in the foreign key column(s) match the values in the primary key column of the referenced table.

• Foreign key constraints help maintain data integrity by preventing actions that would destroy links b...read more
Answered by AI
Add your answer

45 minutes phone interview. Asked me basic java knowledge: 1, s1 = "a" + "b", s2 = "ab", s1 == s2?
2, What's Singleton design pattern?
3, Maximum CPU load

Q1. I can't pass the phone call
Add your answer

Q1. What is the shortest distance between two farthest vertices in a cubical room
Ans. 
The shortest distance between two farthest vertices in a cubical room is the length of the diagonal of the cube.
• The diagonal of a cube can be calculated using the formula: sqrt(3) * side length

• In a cube with side length 1 unit, the diagonal length is sqrt(3) units

• Therefore, the shortest distance between two farthest vertices in a cubical room is sqrt(3) times the side length of the cube
Answered by AI
Add your answer
Q2. A root 5 is the ans
Add your answer

Lit bit tougher as a beginner for quants like aptitude, verbal, and reasoning.

They given 40 min for coding and , topics are below linked list , stacks

They given 30 min for coding in topics of linked list , stacks

Q1. Find minimum no. of increment operations to make array unique
Ans. 
To make an array of strings unique, count the number of duplicate elements and increment them accordingly.
• Iterate through the array and keep track of the frequency of each element.

• For each duplicate element, increment it to make the array unique.

• Return the total number of increment operations needed.
Answered by AI
Add your answer
Q2. Given a binary tree whose every node value is a number. find the sum of all the numbers that are formed from root to leaf paths
Ans. 
Sum all numbers formed from root to leaf paths in a binary tree
• Traverse the tree from root to leaf nodes, keeping track of the current number formed

• Add the current number to the sum when reaching a leaf node

• Recursively explore left and right subtrees
Answered by AI
Add your answer

Dp , recursion , graphs and trees are must