Parenthesis Matching Interview Question
“Sometimes (when I nest them (my parentheticals) too much (like this (and this))) they get confusing.” Read More About How to Create Progress Bar using […]
technical interview
How to Create Progress Bar using Javascript
In Web Developer Interview, you may get asked to create some interactive components to test your knowledge with latest APIs. Read: Interview Question to Create […]
Front-End Interview Question to Create TODO List App.
In Front-End Interview, you may get asked to create Drag and Drop Div. HTML5 has introduced very widely used Drag and Drop feature. Many app […]
Interview Question to Make Queue using two stakes.
You have given two stacks and you need to create Queue data Structure. Now we know Stack data structure is “LIFO” access. LIFO = Last […]
Interview Question find nth term in Look and Say Sequence
Find the nth term in Look-and-say (Or Count and Say) Sequence. The look-and-say sequence is the sequence of below integers: 1, 11, 21, 1211, 111221, […]
Front-end Interview Question – Design Navigation Menu
In Front-end developer interview, you may be asked to design navigation bar. Here, We have added detailed article on how you should navigate this interview […]
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 […]
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 – Find maximum in a stack in o(1) time!
Question: Create getMax() function to find maximum in a stack in O(1) time! This is widely asked technical interview for software engineers. You should know […]