Author Archives: Stanislav_Panteleev

Java.Algo.Arrays.SeparateDigits

We can convert integer to string and then get chars, but more effective way is to use / and % operators, here is an example more effective example

Posted in Без рубрики | Comments Off on Java.Algo.Arrays.SeparateDigits

Algo.Java.Arrays.Intersection

example another example

Posted in Без рубрики | Comments Off on Algo.Java.Arrays.Intersection

Algo.Java.Arrays.PriorityQueue

example

Posted in Без рубрики | Comments Off on Algo.Java.Arrays.PriorityQueue

Algo.Java.DFS.BST.CollectNodesByDepth

example

Posted in Без рубрики | Comments Off on Algo.Java.DFS.BST.CollectNodesByDepth

Algo.Java.GetAllSubArrays

iterative approach recursive approach

Posted in Без рубрики | Comments Off on Algo.Java.GetAllSubArrays

Algo.Java.Dfs.Backtracking

ALL SUBSETS IS NOT ALL SUBARRAYS !!! Lets say we have array with nums 5 1 6, what will be all combinations of these nums ? It’s a tree, so we can traverse it and get all combinations, where we … Continue reading →

Posted in Без рубрики | Comments Off on Algo.Java.Dfs.Backtracking

Algo.Java.IsSameTree

Posted in Без рубрики | Comments Off on Algo.Java.IsSameTree

Algo.Java.DFS.Postorder

find sum find count find max abs difference between left and right find max diameter between left and right

Posted in Без рубрики | Comments Off on Algo.Java.DFS.Postorder

Algo.Java.Arrays.Strings.FrequencyApproach

Posted in Без рубрики | Comments Off on Algo.Java.Arrays.Strings.FrequencyApproach

Algo.Java.DFS.Theory

let’s say we have binary search tree like this TRAVERSE PREORDER !!! CAN CLONE THE TREE !!! AND SEARCH IN TREE Another example TRAVERSE INORDER !!! GIVES A SORTED ORDER IN BINARY SEARCH TREE !!! TRAVERSE POSTORDER Algo.Java.DFS.Postorder Another post … Continue reading →

Posted in Без рубрики | Comments Off on Algo.Java.DFS.Theory