i
Z1 Tech
Filter interviews by
Clear (1)
Top trending discussions
posted on 11 Mar 2015
BST is a binary tree where left child is smaller and right child is greater. Add/delete ops maintain this property.
BST is a data structure used for searching, sorting, and storing data
Add operation: Traverse the tree and find the appropriate position to insert the new node
Delete operation: Find the node to be deleted, replace it with its inorder successor or predecessor, and delete the successor/predecessor node
Time co...
Copy a linked list with random pointers to random nodes in the list.
Create a new node for each node in the original list
Map the original nodes to their corresponding new nodes
Copy the value of the original node to the new node
Copy the random pointer of the original node to the new node using the mapping created earlier
I am a software engineer with experience in developing web applications and a passion for problem-solving.
Experienced in developing web applications using languages such as Java, Python, and JavaScript
Proficient in using frameworks such as Spring, Django, and React
Skilled in problem-solving and troubleshooting
Strong communication and collaboration skills
Passionate about learning new technologies and keeping up with ind
I have experience in software development and have worked on various projects using different technologies.
Started my career as a software developer at XYZ company
Developed web applications using Java and Spring framework
Worked on a project for a client in the healthcare industry, developing a patient management system
Implemented RESTful APIs using Node.js and Express
Contributed to open source projects on GitHub
Current...
I applied via Campus Placement and was interviewed before Jun 2019. There were 4 interview rounds.
posted on 1 Feb 2023
I applied via Recruitment Consulltant and was interviewed in Jan 2023. There were 3 interview rounds.
I was interviewed before Sep 2023.
I applied via Approached by Company and was interviewed before Nov 2023. There was 1 interview round.
I was interviewed before Jan 2021.
Round duration - 60 minutes
Round difficulty - Easy
I had one interview for approx. an hour, it includes both Technical and HR round, well mostly technical. Interview starts with tell me something about yourself. Asked in detailed about algorithms/web based projects mentioned in CV, make sure that whatever you have written you have complete knowledge about it. Asked to code few basic algorithms questions. Do mention about small project if you have done related to web development.
If interviewer says if you want to ask any question, its always better to ask one or two question.
A Binary Search Tree (BST) is a data structure where each node has at most two children, with the left child being less than the parent and the right child being greater.
Nodes in a BST are arranged in a hierarchical order where 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.
BST allows for efficient search...
Given the root node of a binary search tree and a positive integer, you need to insert a new node with the given value into the BST so that the resulting tree maintains the pr...
Insert a new node with a given value into a binary search tree while maintaining the properties of a BST.
Traverse the BST starting from the root node and compare the value to be inserted with each node's value to determine the correct position for insertion.
Insert the new node as a leaf node in the appropriate position to maintain the BST properties.
Ensure that the resulting tree is a valid binary search tree by follow...
You are provided with a Binary Search Tree (BST) containing 'N' nodes with integer data. Your task is to remove a given node from this BST.
A BST is a ...
Delete a given node from a Binary Search Tree (BST) and return the inorder traversal of the modified BST.
Traverse the BST to find the node to be deleted.
Handle different cases like node with no children, one child, or two children.
Update the pointers of the parent node and child nodes accordingly.
Perform inorder traversal after deletion to get the modified BST.
Given a linked list where each node has two pointers: one pointing to the next node and another which can point randomly to any node in the list or ...
Yes, the cloning of a linked list with random pointer can be accomplished without utilizing extra space.
Use a hashmap to store the mapping between original nodes and their corresponding cloned nodes.
Iterate through the original linked list to create the cloned nodes and update the hashmap.
Iterate through the original linked list again to set the next and random pointers of the cloned nodes using the hashmap.
Time comple...
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Must verify your CV from your seniors/batchmates.
Tip 2 : Include all the projects, intern work or hall activities or anything you have done on your own which is related to or interest of company. If you know any back-end/front-end (javascript, php, mysql etc) language do mention. I think the cv shortlist was completely based on previous work and technical skills related to Web Development/Design mentioned in the CV.
Tip 3 : Focus on skills, projects and experiences more.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Front end Developer
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Associate
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Junior Software Developer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Director
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Times Internet
Network 18
Times Group
INDIA TODAY GROUP