instruction
stringclasses 6
values | input
float64 | output
stringlengths 10
563
|
|---|---|---|
Web development interview question | null | What is the purpose of closures in JavaScript? |
Web development interview question | null | What is an event loop in Node JS? |
Web development interview question | null | What is a Blocking Code? |
Web development interview question | null | What is the CSS Grid System? |
Web development interview question | null | What are Angular Route Guards? |
Web development interview question | null | Can you compare MongoDB and SQL Databases? |
Web development interview question | null | Are all the Object-Oriented Programming Principles supported in Typescript? |
Web development interview question | null | What is the difference between client-side and server-side programming? |
Web development interview question | null | What is the use of HTTP cookies? |
Web development interview question | null | Explain the concept of responsive web design |
Web development interview question | null | What is a content delivery network (CDN)? |
Web development interview question | null | What are some common performance optimization techniques for web applications? |
Web development interview question | null | What is cross-origin resource sharing (CORS)? |
Web development interview question | null | What is the purpose of HTML, CSS, and JavaScript in web development? |
Web development interview question | null | What does the box model in CSS represent? |
Web development interview question | null | What is event propagation in JavaScript? |
Web development interview question | null | What is the document object model (DOM)? |
Web development interview question | null | How can you achieve progressive rendering in web applications? |
Web development interview question | null | What are the benefits of using CSS pre- and post-processors? |
Web development interview question | null | How do you handle issues with browser compatibility? |
Web development interview question | null | What are the different ways to implement secure authentication in web applications? |
Web development interview question | null | Explain web components and their benefits |
Web development interview question | null | What is the difference between React and Angular? |
Web development interview question | null | What is XSS, and how can you prevent it? |
Web development interview question | null | Explain the concept of server-side rendering (SSR) vs. client-side rendering (CSR) |
Web development interview question | null | What is asset bundling, and why is it important? |
Web development interview question | null | Explain the concept of server push in HTTP/2 |
Web development interview question | null | What is the role of state managers? |
Web development interview question | null | What are the benefits of using CSS Grid and Flexbox layouts? |
Web development interview question | null | What is the role of TypeScript? |
Web development interview question | null | What is a single-page application (SPA), and how does it differ from a traditional multi-page application (MPA)? |
Web development interview question | null | Explain JavaScript Promises and their advantages over callbacks |
Web development interview question | null | How do you measure the performance of a web application? |
Web development interview question | null | What are Service Workers, and how do they benefit web applications? |
Web development interview question | null | Explain the differences between a RESTful API and a GraphQL API |
software development interview question | null | Given an array n integers, are there elements a, b, c in array such that sum of (a,b,c) equals to a particular target X?
This Problem can easily be solved in naive O(n³) time complexity. But how do you Solve it in O(n²). With follow up questions like How will you Solve if you want unique Triplets? |
software development interview question | null | Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. |
software development interview question | null | Given a paragraph and a list of banned words, return the most frequent word that is not in the list of banned words. This Problem will aid you in learning and implementing Hash Maps and Sets together. |
software development interview question | null | What is caching? explain in detail. |
software development interview question | null | Given a matrix if an element in the matrix is 0 then you will have to set its entire column and row to 0 and then return the matrix. |
software development interview question | null | Given row number r and column number c. Print the element at position (r, c) in Pascal’s triangle. |
software development interview question | null | Given the row number n. Print the n-th row of Pascal’s triangle. |
software development interview question | null | Given an array Arr[] of integers, rearrange the numbers of the given array into the lexicographically next greater permutation of numbers. If such an arrangement is not possible, it must rearrange to the lowest possible order (i.e., sorted in ascending order). |
software development interview question | null | Given an integer array arr, find the contiguous subarray (containing at least one number) which has the largest sum and returns its sum and prints the subarray. |
software development interview question | null | Given an array consisting of only 0s, 1s, and 2s. Write a program to in-place sort the array without using inbuilt sort functions. ( Expected: Single pass-O(N) and constant space) |
software development interview question | null | You are given an array of prices where prices[i] is the price of a given stock on an ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0. |
software development interview question | null | Given a matrix, your task is to rotate the matrix 90 degrees clockwise. |
software development interview question | null | Given an array of intervals, merge all the overlapping intervals and return an array of non-overlapping intervals. |
software development interview question | null | Given two sorted arrays arr1[] and arr2[] of sizes n and m in non-decreasing order. Merge them in sorted order. Modify arr1 so that it contains the first N elements and modify arr2 so that it contains the last M elements. |
software development interview question | null | Given an array of N + 1 size, where each element is between 1 and N. Assuming there is only one duplicate number, your task is to find the duplicate number. |
software development interview question | null | You are given a read-only array of N integers with values also in the range [1, N] both inclusive. Each integer appears exactly once except A which appears twice and B which is missing. The task is to find the repeating and missing numbers A and B where A repeats twice and B is missing. |
software development interview question | null | You are given a read-only array of N integers with values also in the range [1, N] both inclusive. Each integer appears exactly once except A which appears twice and B which is missing. The task is to find the repeating and missing numbers A and B where A repeats twice and B is missing. |
software development interview question | null | Given an array of N integers, count the inversion of the array What is an inversion of an array? Definition: for all i & j < size of array, if i < j then you have to find pair (A[i],A[j]) such that A[j] < A[i]. |
software development interview question | null | You have been given a 2-D array 'mat' of size 'N x M' where 'N' and 'M' denote the number of rows and columns, respectively. The elements of each row are sorted in non-decreasing order. Moreover, the first element of a row is greater than the last element of the previous row (if it exists). You are given an integer ‘target’, and your task is to find if it exists in the given 'mat' or not. |
software development interview question | null | Given a double x and integer n, calculate x raised to power n. Basically Implement pow(x, n). |
software development interview question | null | Given an array of N integers, write a program to return an element that occurs more than N/2 times in the given array. You may consider that such an element always exists in the array. |
software development interview question | null | Given an array of N integers. Find the elements that appear more than N/3 times in the array. If no such element exists, return an empty vector. |
software development interview question | null | Given a matrix m X n, count paths from left-top to the right bottom of a matrix with the constraints that from each cell you can either only move to the rightward direction or the downward direction. |
software development interview question | null | Given an array of numbers, you need to return the count of reverse pairs. Reverse Pairs are those pairs where i<j and arr[i]>2*arr[j]. |
software development interview question | null | You have been given a 2-D array 'mat' of size 'N x M' where 'N' and 'M' denote the number of rows and columns, respectively. The elements of each row are sorted in non-decreasing order. Moreover, the first element of a row is greater than the last element of the previous row (if it exists). You are given an integer ‘target’, and your task is to find if it exists in the given 'mat' or not. |
software development interview question | null | Given a double x and integer n, calculate x raised to power n. Basically Implement pow(x, n). |
software development interview question | null | Given an array of N integers, your task is to find unique quads that add up to give a target value. In short, you need to return an array of all the unique quadruplets [arr[a], arr[b], arr[c], arr[d]] such that their sum is equal to a given target. |
software development interview question | null | Given an array containing both positive and negative integers, we have to find the length of the longest subarray with the sum of all elements equal to zero. |
software development interview question | null | Given an array of integers A and an integer B. Find the total number of subarrays having bitwise XOR of all elements equal to k. |
software development interview question | null | Given the head of a singly linked list, write a program to reverse the linked list, and return the head pointer to the reversed list. |
software development interview question | null | Given the head of a singly linked list, return the middle node of the linked list. If there are two middle nodes, return the second middle node. |
software development interview question | null | Given a linked list and an integer N, the task is to delete the Nth node from the end of the linked list and print the updated linked list. |
software development interview question | null | Write a function to delete a node in a singly-linked list. You will not be given access to the head of the list instead, you will be given access to the node to be deleted directly. It is guaranteed that the node to be deleted is not a tail node in the list. |
software development interview question | null | Given the heads of two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list. |
software development interview question | null | Write a function to delete a node in a singly-linked list. You will not be given access to the head of the list instead, you will be given access to the node to be deleted directly. It is guaranteed that the node to be deleted is not a tail node in the list. |
software development interview question | null | Given the head of a singly linked list of `n` nodes and an integer `k`, where k is less than or equal to `n`. Your task is to reverse the order of each group of `k` consecutive nodes, if `n` is not divisible by `k`, then the last group of remaining nodes should remain unchanged. |
software development interview question | null | Given a Linked list that has two pointers in each node and one of which points to the first node and the other points to any random node. Write a program to clone the LinkedList. |
software development interview question | null | Given an array print all the sum of the subset generated from it, in the increasing order. |
software development interview question | null | Given an array of integers that may contain duplicates the task is to return all possible subsets. Return only unique subsets and they can be in any order. |
software development interview question | null | Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sum to target. Each number in candidates may only be used once in the combination. |
software development interview question | null | Given an array arr of distinct integers, print all permutations of String/Array. |
software development interview question | null | The n-queens is the problem of placing n queens on n × n chessboard such that no two queens can attack each other. Given an integer n, return all distinct solutions to the n -queens puzzle. Each solution contains a distinct boards configuration of the queen's placement, where ‘Q’ and ‘.’ indicate queen and empty space respectively. |
software development interview question | null | Given an undirected graph and a number m, determine if the graph can be colored with at most m colors such that no two adjacent vertices of the graph are colored with the same color. |
software development interview question | null | Given two numbers N and M, find the Nth root of M. The nth root of a number M is defined as a number X when raised to the power N equals M. If the 'nth root is not an integer, return -1. |
software development interview question | null | Given a row-wise sorted matrix of size r*c, where r is no. of rows and c is no. of columns, find the median in the given matrix. |
software development interview question | null | Given an array of N integers. Every number in the array except one appears twice. Find the single number in the array. |
software development interview question | null | Given two sorted arrays of size m and n respectively, you are tasked with finding the element that would be at the kth position of the final sorted array. |
software development interview question | null | You are given an array 'arr' of size 'n' which denotes the position of stalls. You are also given an integer 'k' which denotes the number of aggressive cows. You are given the task of assigning stalls to 'k' cows such that the minimum distance between any two of them is the maximum possible. Find the maximum possible minimum distance. |
software development interview question | null | Given an unsorted array, print Kth Largest and Smallest Element from an unsorted array. |
software development interview question | null | Implement a stack using an array. |
software development interview question | null | Implement Queue Data Structure using Array with all functions like pop, push, top, size, etc. |
software development interview question | null | Implement Queue Data Structure using Array with all functions like pop, push, top, size, etc. |
software development interview question | null | Check Balanced Parentheses. Given string str containing just the characters '(', ')', '{', '}', '[' and ']', check if the input string is valid and return true if the string is balanced otherwise return false. |
software development interview question | null | Given a circular integer array A, return the next greater element for every element in A. The next greater element for an element x is the first element greater than x that we come across while traversing the array in a clockwise manner. If it doesn't exist, return -1 for this element. |
software development interview question | null | A Queue is a linear data structure that works on the basis of FIFO(First in First out). This means the element added at first will be removed first from the Queue. |
software development interview question | null | Given a circular integer array A, return the next greater element for every element in A. The next greater element for an element x is the first element greater than x that we come across while traversing the array in a clockwise manner. If it doesn't exist, return -1 for this element. |
software development interview question | null | Given an array of integers heights representing the histogram's bar height where the width of each bar is 1 return the area of the largest rectangle in histogram. |
software development interview question | null | Given an array of integers arr, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position. Return the max sliding window. |
software development interview question | null | Implement Min Stack | O(2N) and O(N) Space Complexity. Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. |
software development interview question | null | Given a string s, reverse the words of the string. |
software development interview question | null | Given the root of a Binary Tree, write a recursive function that returns an array containing the inorder traversal of the tree. |
software development interview question | null | Given the root of a Binary Tree, write a recursive function that returns an array containing the postorder traversal of the tree. |
software development interview question | null | Write a program for Morris Inorder Traversal of a Binary Tree. |
software development interview question | null | Given a Binary Tree, find the Morris preorder traversal of Binary Tree |
software development interview question | null | Given a Binary Tree, find the Right/Left view of it. The right view of a Binary Tree is a set of nodes visible when the tree is viewed from the right side. The left view of a Binary Tree is a set of nodes visible when the tree is viewed from the left side. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.