Jio Haptik Software Engineer Interview Questions and Answers

Q1. Based on your previous experience
Add your answer

Simple coding questions in your preferred language

Based on concepts and past experience

Q1. Full day exam on saturday
Add your answer
Q2. Coding related, dsa, aptitude etc
Add your answer

Q1. Question on DSA, Trees
Add your answer

Duration: 1hr
Topics: Array, LinkedList,Stack

Q1. Write code for Insertion in a binary tree.
Ans. 
Code for insertion in a binary tree
• Create a new node with the given data

• If the tree is empty, make the new node as root

• Else, traverse the tree to find the appropriate position to insert the new node

• If the data is less than the current node, go to the left subtree

• If the data is greater than the current node, go to the right subtree

• Repeat until an appropriate position is found

• Set the new node as the child of the appropri
Answered by AI
Add your answer
Q2. Write code for quick sort
Ans. 
Quick sort is a divide-and-conquer algorithm that sorts an array by partitioning it into two sub-arrays.
• Choose a pivot element from the array

• Partition the array around the pivot element

• Recursively apply quick sort to the left and right sub-arrays

• Combine the sorted sub-arrays to get the final sorted array
Answered by AI
Add your answer

Q1. Various DBMS related question(JOINS, SORT, LIMIT)
Add your answer

Q1. Tell us about yourself.
Add your answer
Q2. Why do want to join the company
Add your answer

Q1. Reverse a linked list
Ans. 
Reverse a linked list by changing the direction of pointers
• Start with three pointers: current, previous, and next

• Iterate through the linked list, updating pointers to reverse the direction

• Update the head of the linked list to be the last node visited
Answered by AI
Add your answer