Problems

# Title Likes
61

Find loop length in a cyclic/circular linked list

0
62

Detect a loop in cyclic/circular linked list

0
63

Determine if a binary tree is a binary search tree

0
64

Implement a debounce function in javascript

0
65

Given the binary tree create linked lists of the nodes at the same level

0
66

Word break problem dynamic programming

0
67

Introduction to backtracking

0
68

Pascals triangle javascript code

0
69

Flatten nested array javascript

0
70

Generate all permutations of a given array using backtracking

0
71

Replace all spaces in a string with %20

0
72

Justify if a string consists of valid parentheses

0
73

Negate a number using addition operator

0
74

Find a pair of elements from an array whose sum equals a given number

0
75

Generate all combinations of an array

0
76

Implement a power function

0
77

Determine given a pattern and string are isomorphic

0
78

Determine if given strings are isomorphic

0
79

Find consecutive segments in an sorted array

0
80

Rearrange characters in a string so that no character repeats consecutively.

0

Find loop length in a cyclic/circular linked list

Detect a loop in cyclic/circular linked list

Determine if a binary tree is a binary search tree

Implement a debounce function in javascript

Given the binary tree create linked lists of the nodes at the same level

Word break problem dynamic programming

Introduction to backtracking

Pascals triangle javascript code

Flatten nested array javascript

Generate all permutations of a given array using backtracking

Replace all spaces in a string with %20

Justify if a string consists of valid parentheses

Negate a number using addition operator

Find a pair of elements from an array whose sum equals a given number

Generate all combinations of an array

Implement a power function

Determine given a pattern and string are isomorphic

Determine if given strings are isomorphic

Find consecutive segments in an sorted array

Rearrange characters in a string so that no character repeats consecutively.