Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedThe arrival time is the time at which the vertex was explored for the first time in the DFS, and departure time is the time at which we have explored all the neighbors of the vertex, and we are ready to backtrack.
Depth–first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary node as the root for a graph) and explore as far as possible along each branch before backtracking.
Breadth–first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a ‘search key’) and explores the neighbor nodes first before moving to the next-level neighbors.
Dynamic programming is a method for solving a complex problem by breaking it down into a collection of simpler subproblems, solving each of those subproblems just once, and storing their solutions using a memory-based data structure (array, map, etc.).
Write a recursive program to efficiently reverse a given string in C, C++, and Java.
Write a recursive C/C++, Java, and Python program to calculate the factorial of a given positive number.
Write a recursive program to find all factorial numbers less than or equal to n. The factorial n! of a non-negative integer n is the product of all positive integers less than or equal to n.
Write a program to determine if a given number is a palindrome or not. A palindromic number is a number that remains the same when its digits are reversed.
Given two numbers, calculate the maximum number without using a conditional statement or ternary operator.
Write a program to perform a division of two numbers without using the division operator (‘/’).
Given two integers, find the minimum number between them without using any conditional statement (or ternary operator).
Given two integers, multiply them without using the multiplication operator or conditional loops.