www.techiedelight.com
Open in
urlscan Pro
2a06:98c1:3121::3
Public Scan
URL:
https://www.techiedelight.com/
Submission: On May 31 via manual from HU — Scanned from DE
Submission: On May 31 via manual from HU — Scanned from DE
Form analysis 4 forms found in the DOM
<form class="search-form">
<a href="#search-menu" class="search-toggle"></a>
<input id="search-menu" type="search" class="search-field" placeholder="Search…">
<button id="search-submit" class="search-submit"></button>
</form>POST #
<form action="#" method="post" accept-charset="utf-8" id="subscribe-blog-blog_subscription-7">
<div id="subscribe-text">
<p>Enter your email address to subscribe to new posts.</p>
</div>
<p id="subscribe-email">
<label id="jetpack-subscribe-label" class="screen-reader-text" for="subscribe-field-blog_subscription-7"> Email Address </label>
<input type="email" name="email" required="required" value="" id="subscribe-field-blog_subscription-7" placeholder="Email Address">
</p>
<p id="subscribe-submit">
<input type="hidden" name="action" value="subscribe">
<input type="hidden" name="source" value="https://www.techiedelight.com/">
<input type="hidden" name="sub-type" value="widget">
<input type="hidden" name="redirect_fragment" value="subscribe-blog-blog_subscription-7">
<button type="submit" class="wp-block-button__link" name="jetpack_subscriptions_widget"> Subscribe </button>
</p>
</form><form class="gsc-search-box gsc-search-box-tools" accept-charset="utf-8">
<table cellspacing="0" cellpadding="0" class="gsc-search-box">
<tbody>
<tr>
<td class="gsc-input">
<div class="gsc-input-box" id="gsc-iw-id1">
<table cellspacing="0" cellpadding="0" id="gs_id50" class="gstl_50 gsc-input" style="width: 100%; padding: 0px;">
<tbody>
<tr>
<td id="gs_tti50" class="gsib_a"><input autocomplete="off" type="text" size="10" class="gsc-input" name="search" title="search" id="gsc-i-id1" dir="ltr" spellcheck="false" placeholder="Search Techie Delight..."
style="width: 100%; padding: 0px; border: none; margin: 0px; height: auto; background: url("https://www.google.com/cse/static/images/1x/en/branding.png") left center no-repeat rgb(255, 255, 255); outline: none;"></td>
<td class="gsib_b">
<div class="gsst_b" id="gs_st50" dir="ltr"><a class="gsst_a" href="javascript:void(0)" title="Clear search box" role="button" style="display: none;"><span class="gscb_a" id="gs_cb50" aria-hidden="true">×</span></a></div>
</td>
</tr>
</tbody>
</table>
</div>
</td>
<td class="gsc-search-button"><button class="gsc-search-button gsc-search-button-v2"><svg width="13" height="13" viewBox="0 0 13 13">
<title>search</title>
<path
d="m4.8495 7.8226c0.82666 0 1.5262-0.29146 2.0985-0.87438 0.57232-0.58292 0.86378-1.2877 0.87438-2.1144 0.010599-0.82666-0.28086-1.5262-0.87438-2.0985-0.59352-0.57232-1.293-0.86378-2.0985-0.87438-0.8055-0.010599-1.5103 0.28086-2.1144 0.87438-0.60414 0.59352-0.8956 1.293-0.87438 2.0985 0.021197 0.8055 0.31266 1.5103 0.87438 2.1144 0.56172 0.60414 1.2665 0.8956 2.1144 0.87438zm4.4695 0.2115 3.681 3.6819-1.259 1.284-3.6817-3.7 0.0019784-0.69479-0.090043-0.098846c-0.87973 0.76087-1.92 1.1413-3.1207 1.1413-1.3553 0-2.5025-0.46363-3.4417-1.3909s-1.4088-2.0686-1.4088-3.4239c0-1.3553 0.4696-2.4966 1.4088-3.4239 0.9392-0.92727 2.0864-1.3969 3.4417-1.4088 1.3553-0.011889 2.4906 0.45771 3.406 1.4088 0.9154 0.95107 1.379 2.0924 1.3909 3.4239 0 1.2126-0.38043 2.2588-1.1413 3.1385l0.098834 0.090049z">
</path>
</svg></button></td>
<td class="gsc-clear-button">
<div class="gsc-clear-button" title="clear results"> </div>
</td>
</tr>
</tbody>
</table>
</form>POST
<form method="post">
<input type="submit" value="Accept and Close" class="accept">
</form>Text Content
TECHIE DELIGHT </> Ace your Coding Interview FAANG Interview Prep Practice Hot Data Structures and Algorithms Array Binary Tree Binary Search Tree Dynamic Programming Divide and Conquer Backtracking Linked List Matrix Heap Stack Queue String Graph Sorting Primary Primary * All Problems * Practice * Array * Binary Tree * Binary Search Tree * Linked List * Dynamic Programming * Backtracking * Matrix * Graph * Divide and Conquer * Heap * String * Sorting * Stack * Queue * Trie * Bit Manipulation * Programming Puzzles * IDE Skip to content CHECK CHILDREN-SUM PROPERTY IN A BINARY TREE Binary Tree, Tree Easy 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. SHRINK AN ARRAY BY REMOVING TRIPLETS THAT SATISFY GIVEN CONSTRAINTS Array, Dynamic Programming Hard 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. COUNT NODES IN A BST THAT LIES WITHIN A GIVEN RANGE BST Easy Given a BST, count the total number of nodes that lie within a given range. CHECK WHETHER A DIRECTED GRAPH IS EULERIAN Graph Medium 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. FIND THE MINIMUM NUMBER OF MERGE OPERATIONS TO MAKE AN ARRAY PALINDROME Array Medium 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 and replace them with their sum. CONSTRUCT A COMPLETE BINARY TREE FROM ITS LINKED LIST REPRESENTATION Binary Tree, Linked List, Queue Easy 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. FIND READ-WRITE CONFLICTS AMONG GIVEN DATABASE TRANSACTIONS Array, Sorting Medium 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. CHECK IF REMOVING AN EDGE CAN SPLIT A BINARY TREE INTO TWO EQUAL SIZE TREES Binary Tree Easy Given a binary tree, check if removing an edge can split it into two binary trees of equal size. IN-PLACE MERGE TWO HEIGHT-BALANCED BSTS BST, Linked List Hard 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. FIND HEIGHT OF A BINARY TREE REPRESENTED BY THE PARENT ARRAY Array, Binary Tree, Dynamic Programming Medium Given an array representing the parent-child relationship in a binary tree, find the tree’s height without building it. The parent-child relationship is defined by (A[i], i) for every index i in array A. DETERMINE WHETHER TWO NODES LIE ON THE SAME PATH IN A BINARY TREE Binary Tree Medium Given a binary tree and two tree pointers, x and y, write an efficient algorithm to check if they lie on the same root-to-leaf path in the binary tree. In other words, determine whether x is an ancestor of y, or x is a descendant of y. DETERMINE WHETHER A BST IS SKEWED FROM ITS PREORDER TRAVERSAL Array, BST Easy Given an array representing the preorder traversal of a BST, determine whether it represents a skewed BST or not. In a skewed BST, each node’s descendants are either smaller or larger than the node itself. POSTS NAVIGATION 1 2 3 4 … 62 Next -------------------------------------------------------------------------------- Browse Algorithm Amazon Beginner Binary Search Bit Hacks Bottom-up Breadth-first search Depth-first search Easy FIFO Greedy Hard Hashing LIFO Maze Medium Microsoft Must Know Priority Queue Recursive Sliding Window Top-down Trie -------------------------------------------------------------------------------- Subscribe to new posts Enter your email address to subscribe to new posts. Email Address Subscribe × search Custom Search Techie Delight © 2022 All Rights Reserved. | Privacy Policy | Terms of Service | Send feedback Do NOT follow this link or you will be banned from the site! This website uses cookies. By using this site you agree to the use of cookies, our policies, copyright terms and other conditions. Read our Privacy Policy.