Skip to content

NerdyCoder

  • Home
  • Jobs & Internships
  • Courses
  • Practice Problems
    • DP
    • Trees
    • Graphs
    • Strings
  • About
  • Contact
  • Privacy Policy

Tag: backtracking

Top Binary tree interview problems

September 17, 2020 Raunak Jain

Here is a curated list of top interview problems on binary trees. These are mostly asked in face to face technical interview rounds. The list

Continue reading

Path sum equal to k in trees

September 12, 2020 Raunak Jain

You are given a binary tree which can have negative elements also and an integer k, you need to print all the paths in the

Continue reading

Permutations of a string using backtracking.

August 30, 2020 Raunak Jain

Given an array or a string, print all the permutations of it. A permutation of a string, is a rearrangement of the elements of the

Continue reading

Print all paths from Root to leaf.

August 22, 2020 Raunak Jain

You are given a binary tree, you need to print all the paths from root to leaf nodes. In the above figure, the paths from

Continue reading

Top Posts

  • Top Binary tree interview problems
Privacy & Cookies: This site uses cookies. By continuing to use this website, you agree to their use.
To find out more, including how to control cookies, see here: Cookie Policy

PAGES

  • Home
  • Jobs & Internships
  • Courses
  • Practice Problems
    • DP
    • Trees
    • Graphs
    • Strings
  • About
  • Contact
  • Privacy Policy