nCircle Tech C Developer Interview Questions and Answers

Code Snept question with 3-4 Reasoning question. Google form

Pen paper coding round. String , Array . Linkedlist , graph, questions

Q1. Maximum Spaning
Add your answer
Q2. Nearest Prime number
Ans. 
To find the nearest prime number, iterate from the given number in both directions until a prime number is found.
• Start iterating from the given number in both directions to find the nearest prime number.

• Check if a number is prime by dividing it by all numbers less than its square root.

• Keep track of the closest prime number found during the iteration.
Answered by AI
Add your answer
Q3. Second Maximum Number in Array
Ans. 
Find the second maximum number in an array of strings.
• Convert the array of strings to an array of integers.

• Sort the array in descending order.

• Return the second element in the sorted array.
Answered by AI
Add your answer

Q1. Project Question
Add your answer
Q2. Robot question of DSA
Add your answer
Q3. Stock Buy and sell - VI . Leetcode Hard
Add your answer
Q4. Leetcode Medium
Add your answer

Medium level questions asked

Simple easy to medium 2 questions asked of string and array

Q1. Tell me about yourself
Add your answer
Q2. JavaScript like fetch axios and others
Add your answer

Q1. How make a queue using a stack
Ans. 
To implement a queue using a stack, use two stacks and simulate the queue operations.
• Use two stacks, one for enqueue operation and one for dequeue operation.

• For enqueue operation, simply push elements onto the stack used for enqueueing.

• For dequeue operation, if the dequeue stack is empty, pop all elements from enqueue stack and push onto dequeue stack.

• Then pop from the dequeue stack to simulate dequeue operation.
Answered by AI
Add your answer
Q2. Create a linked list
Ans. 
A linked list is a data structure consisting of nodes where each node points to the next node in the sequence.
• Create a Node class with data and next pointer

• Initialize a head pointer to null

• Add nodes by updating next pointers

• Traverse the list by following next pointers
Answered by AI
Add your answer

MCQ round with few apti, 2 coding too.

Q1. Into, projects,
Add your answer
Q2. Print node with no edge in a unidirectional graph
Ans. 
To print nodes with no edges in a unidirectional graph, iterate through all nodes and print those without any outgoing edges.
• Iterate through all nodes in the graph

• For each node, check if it has any outgoing edges

• If a node has no outgoing edges, print it
Answered by AI
Add your answer

Q1. Intro, projects, dsa
Add your answer
Q2. Prime number code
Add your answer

The interviewer asked about javascript basics and DSA questions and some typescript questions