Ck It Solutions SDE Interview Questions and Answers

Q1. Cloud computing
Add your answer
Q2. Phising attack , Big data architecture
Add your answer

Q1. Linked list Questions
Add your answer
Q2. DP questions and some others
Add your answer
Q3. Rotating matix by 90 degree
Ans. 
Rotate a matrix by 90 degrees clockwise
• Transpose the matrix

• Reverse each row of the transposed matrix
Answered by AI
Add your answer
Q4. Graphs Questions
Add your answer
Q5. Binary search questions
Add your answer

Q1. How are you doing in life
Ans. 
I'm navigating life's challenges with optimism, focusing on personal growth and professional development while maintaining a healthy work-life balance.
• I recently completed a challenging project at work, which enhanced my skills in software development and teamwork.

• I've been dedicating time to learning new programming languages, such as Python and JavaScript, to stay updated in the tech field.

• In my personal life, I've s...read more
Answered by AI
Add your answer

Q1. Explain the project in detail
Add your answer

Medium-Hard leetcode level question

Linked list questions and DFS problems

Q1. Why do you want to come in Byju's
Add your answer

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

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