Featured in Data Structures And Algorithms
Number of Ways to make Change
This solution seeks to solve the problem of finding the number of ways to make change for a given amount of money n using a given set of coin denomin… Read More
8 months, 3 weeks ago ; 133 views
BST Traversal
The solution implements three different depth-first traversal methods for binary trees: in-order traversal, pre-order traversal, and post-order trave… Read More
8 months, 3 weeks ago ; 127 views
Inverting a Binary Tree
Inverting a Binary Tree This solution herein is expected to solve the problem of inverting a binary tree. In other words, it aims to transform … Read More
8 months, 3 weeks ago ; 138 views
Validate BST
Validate BST Validate BST aims to determine whether a given binary tree is a valid binary search tree (BST). A BST is a binary tree where each … Read More
8 months, 3 weeks ago ; 126 views
Permutations
Permutations refer to all possible arrangements of elements within a sequence, where the order of elements matters. Permutations can be generated for… Read More
8 months, 3 weeks ago ; 155 views
Binary Search Tree
A binary search tree is a hierarchical data structure that allows for efficient insertion, deletion, and searching of elements. The solution below… Read More
8 months, 3 weeks ago ; 128 views
Tail Recursion
Tail Recursion Tail recursion is a type of recursive function where the last statement executed within the function is a recursive call. Nothing r… Read More
8 months, 3 weeks ago ; 133 views
Insertion Sort Algorithm
The given solution implements the Insertion Sort algorithm, which is a simple comparison-based sorting algorithm. What is the Problem Being Solv… Read More
8 months, 3 weeks ago ; 164 views
Selection Sort Algorithm
The solution below implements the Selection Sort algorithm, which is a simple comparison-based sorting algorithm. def selection_sort(array): i… Read More
8 months, 3 weeks ago ; 151 views
Bubble Sort Algorithm
Bubble Sort algorithm The solution below implements the Bubble Sort algorithm, which is a simple comparison-based sorting algorithm. # O(n) t… Read More
8 months, 3 weeks ago ; 125 views
Latest
Number of Ways to make Change
This solution seeks to solve the problem of finding the number of ways to make change for a given amount of money n using a given set of coin denomin… Read More
Kibsoft in
DSA
BST Traversal
The solution implements three different depth-first traversal methods for binary trees: in-order traversal, pre-order traversal, and post-order trave… Read More
Kibsoft in
DSA
Inverting a Binary Tree
Inverting a Binary Tree This solution herein is expected to solve the problem of inverting a binary tree. In other words, it aims to transform … Read More
Kibsoft in
DSA
Validate BST
Validate BST Validate BST aims to determine whether a given binary tree is a valid binary search tree (BST). A BST is a binary tree where each … Read More
Kibsoft in
DSA
Permutations
Permutations refer to all possible arrangements of elements within a sequence, where the order of elements matters. Permutations can be generated for… Read More
Kibsoft in
DSA
Binary Search Tree
A binary search tree is a hierarchical data structure that allows for efficient insertion, deletion, and searching of elements. The solution below… Read More
Kibsoft in
DSA
Tail Recursion
Tail Recursion Tail recursion is a type of recursive function where the last statement executed within the function is a recursive call. Nothing r… Read More
Kibsoft in
DSA
Insertion Sort Algorithm
The given solution implements the Insertion Sort algorithm, which is a simple comparison-based sorting algorithm. What is the Problem Being Solv… Read More
Kibsoft in
DSA
Selection Sort Algorithm
The solution below implements the Selection Sort algorithm, which is a simple comparison-based sorting algorithm. def selection_sort(array): i… Read More
Kibsoft in
DSA
Bubble Sort Algorithm
Bubble Sort algorithm The solution below implements the Bubble Sort algorithm, which is a simple comparison-based sorting algorithm. # O(n) t… Read More
Kibsoft in
DSA