Techie Delight - Coding made easy

1000 FOLLOWERS

Huge collection of data structure articles on various topics which are useful for technical interview preparation to crack interviews of top IT companies.

Techie Delight - Coding made easy

1y ago

This post will discuss how to convert a hex string to an integer in Java.
The post Convert a hex String to an integer in Java appeared first on Techie Delight ..read more

Techie Delight - Coding made easy

1y ago

Given the root of a binary tree, determine if the binary tree holds children-sum property. For a tree to satisfy the children-sum property, each node's value should be equal to the sum of values at its left and right subtree.
The post Check children-sum property in a binary tree appeared first on Techie Delight ..read more

Techie Delight - Coding made easy

1y ago

Given an integer array, shrink it by removing adjacent triplets that satisfy the given constraints and return the total number of elements in the resultant array.
The post Shrink an array by removing triplets that satisfy given constraints appeared first on Techie Delight ..read more

Techie Delight - Coding made easy

1y ago

Given a BST, count the total number of nodes that lie within a given range.
The post Count nodes in a BST that lies within a given range appeared first on Techie Delight ..read more

Techie Delight - Coding made easy

1y ago

An Eulerian trail (or Eulerian path) is a path in a graph that visits every edge exactly once. Given a directed graph, check whether it has an Eulerian path or not.
The post Check whether a directed graph is Eulerian appeared first on Techie Delight ..read more

Techie Delight - Coding made easy

1y ago

Given a list of non-negative integers, find the minimum number of merge operations to make it a palindrome. A merge operation can only be performed on two adjacent elements. The result of a merge operation is that the two adjacent elements are replaced with their sum.
The post Find the minimum number of merge operations to make an array palindrome appeared first on Techie Delight ..read more

Techie Delight - Coding made easy

1y ago

Given a linked list, construct a complete binary tree from it. Assume that the order of elements present in the linked list is the same as that in the complete tree's array representation.
The post Construct a complete binary tree from its linked list representation appeared first on Techie Delight ..read more

Techie Delight - Coding made easy

1y ago

Given a list of database transactions, find all read-write conflicts among them. Assume that there is no strict two-phase locking (Strict 2PL) protocol to prevent read-write conflicts.
The post Find read-write conflicts among given database transactions appeared first on Techie Delight ..read more

Techie Delight - Coding made easy

1y ago

Given a binary tree, check if removing an edge can split it into two binary trees of equal size.
The post Check if removing an edge can split a binary tree into two equal size trees appeared first on Techie Delight ..read more

Techie Delight - Coding made easy

1y ago

Given two height-balanced binary search trees, in-place merge them into a single balanced binary search tree. For each node of a height-balanced tree, the difference between its left and right subtree height is at most 1.
The post In-place merge two height-balanced BSTs appeared first on Techie Delight ..read more