DOM Tree Traversal through Breadth-first Search (BFS)
First We will learn about What is BFS? Breadth-first search (BFS) is an algorithm for traversing tree structures. The algorithm starts at the root node and […]
interview questions and answers
DOM Tree Traversal through Depth-first Search (DFS)
First We will learn about What is DFS? Depth–first search (DFS) is an algorithm for traversing tree structures. The algorithm starts at the root node and […]
Coding Challenge: Given an unsorted array A of size N of non-negative integers, find a continuous sub-array which adds to a given number S.
Input: [1, 2, 4, 6, 7, 5], 12 Output: [7,5] Logic Implementation: We can keep adding numbers from array. We can check conditions, if it […]
Coding Challenge – Three Sum Target. Find a triplet that sum to a given target value
Common Interview Coding question and answer. Coding challenge is very frequent in big tech companies interview such as Amazon, Facebook or Google. Take a look […]