freeCodeCamp/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures
camperbot f65a7a53bf
chore(i18n,curriculum): processed translations (#44319)
2021-11-30 15:06:52 +01:00
..
add-a-new-element-to-a-binary-search-tree.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
add-elements-at-a-specific-index-in-a-linked-list.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
adjacency-list.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
adjacency-matrix.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
breadth-first-search.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
check-if-an-element-is-present-in-a-binary-search-tree.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
check-if-binary-search-tree.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
create-a-circular-queue.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
create-a-doubly-linked-list.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
create-a-hash-table.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
create-a-linked-list-class.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
create-a-map-data-structure.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
create-a-priority-queue-class.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
create-a-queue-class.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
create-a-set-class.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
create-a-stack-class.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
create-a-trie-search-tree.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
create-an-es6-javascript-map.md chore(i18n,curriculum): update translations (#43534) 2021-09-22 16:34:59 +01:00
create-and-add-to-sets-in-es6.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
delete-a-leaf-node-in-a-binary-search-tree.md chore(i18n,curriculum): update translations 2021-10-27 21:47:35 +05:30
delete-a-node-with-one-child-in-a-binary-search-tree.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
delete-a-node-with-two-children-in-a-binary-search-tree.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
depth-first-search.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
find-the-minimum-and-maximum-height-of-a-binary-search-tree.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
find-the-minimum-and-maximum-value-in-a-binary-search-tree.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
implement-heap-sort-with-a-min-heap.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
incidence-matrix.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
insert-an-element-into-a-max-heap.md chore(i18n,curriculum): processed translations (#44319) 2021-11-30 15:06:52 +01:00
invert-a-binary-tree.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
learn-how-a-stack-works.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
perform-a-difference-on-two-sets-of-data.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
perform-a-subset-check-on-two-sets-of-data.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
perform-a-union-on-two-sets.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
perform-an-intersection-on-two-sets-of-data.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
remove-an-element-from-a-max-heap.md chore(i18n,curriculum): update translations (#43332) 2021-08-31 09:47:25 -07:00
remove-elements-from-a-linked-list-by-index.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
remove-elements-from-a-linked-list.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
remove-items-from-a-set-in-es6.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
reverse-a-doubly-linked-list.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
search-within-a-linked-list.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
typed-arrays.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
use-.has-and-.size-on-an-es6-set.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
use-breadth-first-search-in-a-binary-search-tree.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
use-depth-first-search-in-a-binary-search-tree.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
use-spread-and-notes-for-es5-set-integration.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00
work-with-nodes-in-a-linked-list.md chore(i18n,curriculum): update translations (#43089) 2021-08-02 07:05:44 -07:00