Category: Cracking the Coding interview

Problem (Validate BST | Solution of cracking the coding interview):- Implement a function to check if a binary tree is a binary search tree. Code of (Validate BST | Solution … Read More

List of the Depth | Solution of cracking the coding interview

Program (List of the Depth | Solution of cracking the coding interview):- Given the binary tree , design the an algorithm … Read More

Minimal Tree | Solution of cracking the coding interview

Problem (Minimal Tree | Solution of cracking the coding interview):- Given a sorted array with unique integer element , write an algorithm … Read More

Route Between nodes | Solution of Cracking the coding Interview

Problem (Route Between nodes | Solution of Cracking the coding Interview):- Given a directed Graph , Design an algorithm to find out … Read More

Solution of cracking the coding interview

Solution of cracking the coding interview Here we will discuss questions of the cracking the coding interview (6th edition ) . By clicking on the link you can explore the … Read More

string compression | solution of cracking the coding interview

Problem (string compression | solution of cracking the coding interview)- Implement a method to perform basic string compression using the counts of repeated characters for example , the string aabccccaaa … Read More

Zero matrix | solution of cracking the coding interview

Problem (Zero matrix | solution of cracking the coding interview):- Write an algorithm such that if an element in an MxN matrix is 0 , it’s entire row and column … Read More

One Away | Solution of cracking the coding interview