Cludo Technology Consultants Software Developer Trainee Interview Questions and Answers

Q1. Tell if a binary tree is BST or not
Ans. 
Check if a binary tree is a Binary Search Tree (BST) or not
• In a BST, the left subtree of a node contains only nodes with keys less than the node's key, and the right subtree contains only nodes with keys greater than the node's key

• Perform an in-order traversal of the binary tree and check if the resulting array is sorted

• Keep track of the minimum and maximum values allowed for each node while traversing the tree
Answered by AI
Add your answer
Q2. Three sum problem
Add your answer

Q1. Concepts of OOPs. Gave a code to read and implement a function with a given input using OOPs concept.
Add your answer
Q2. Reverse a linked list
Ans. 
Reverse a singly linked list and return the reversed list.
• Iterate through the linked list and reverse the pointers

• Use three pointers to keep track of current, previous, and next nodes

• Update the head pointer to the last node as the new head
Answered by AI
Add your answer

Practice standard questions

Q1. Search in rotated sorted array
Ans. 
Search for a target element in a rotated sorted array.
• Use binary search to find the pivot point where the array is rotated.

• Divide the array into two sorted subarrays based on the pivot point.

• Perform binary search on the appropriate subarray to find the target element.
Answered by AI
Add your answer
Q2. Trim a bst in leet code
Ans. 
Trim a binary search tree by removing nodes outside a given range.
• Start by checking if the root node is within the given range.

• If the root node is outside the range, trim it by recursively trimming its left or right subtree.

• If the root node is within the range, recursively trim its left and right subtrees.
Answered by AI
Add your answer

Gave alien dictionary (hard question) from gfg.

Q1. Gave medium questions from graph, basically BFS, DFS questions. Left view of a BST.
Add your answer

Q1. Based on job description
Add your answer

Q1. Some artchitecture questions
Add your answer

3 - 4 DSA questions from GeeksforGeeks

Q1. Describe OOPS concepts in java
Ans. 
OOPS concepts in Java are the principles of Object-Oriented Programming such as Inheritance, Encapsulation, Polymorphism, and Abstraction.
• Inheritance: Allows a class to inherit properties and behavior from another class.

• Encapsulation: Bundling data and methods that operate on the data into a single unit.

• Polymorphism: Ability of a method to do different things based on the object it is acting upon.

• Abstraction: Hiding th...read more
Answered by AI
Add your answer
Q2. DSA questions mostly easy to moderate
Add your answer

Q1. Rotten oranges question can be found on leetcode
Add your answer

Q1. Trie data structure implementation
Ans. 
Trie is a tree data structure used for efficient retrieval of key-value pairs.
• Trie is typically used for storing and searching strings efficiently.

• Each node in a trie represents a single character of a string.

• Trie allows for prefix search, making it useful for autocomplete features.

• Common operations on a trie include insertion, deletion, and search.

• Example: Trie data structure can be used to implement a dictionary with
Answered by AI
Add your answer

Q1. OOPS concepts is must .
Add your answer
Q2. Basic java like super, this keywords etc
Add your answer

Two basic DSA questions

Q1. How to reverse a string
Ans. 
To reverse a string, iterate through the characters and swap the first and last characters until reaching the middle.
• Create a function that takes a string as input

• Initialize two pointers, one at the beginning and one at the end of the string

• Swap the characters at the two pointers and move them towards the center until they meet
Answered by AI
Add your answer
Q2. Oops concept questions
Add your answer

Q1. How to add two numbers which are given as linked lists
Ans. 
To add two numbers given as linked lists, iterate through both lists simultaneously and keep track of carry.
• Iterate through both linked lists simultaneously

• Keep track of carry while adding digits

• Create a new linked list to store the result
Answered by AI
Add your answer
Q2. Project disscussion
Add your answer