Files

.vs
DSA-workshop
c++
- Palindrom.cpp
- Search in a row-column sorted Matrix.cpp
- absolute-value.cpp
- adding-two-matrices.cpp
- addition-of-two-numbers.cpp
- addition-under-modulo.cpp
- alone-in-couple.cpp
- ambstrong.cpp
- amend-the-sentence.cpp
- array-delete-and-shift.cpp
- array-insert-at-end.cpp
- array-insert-at-index.cpp
- array-update-by-index.cpp
- at-least-two-greater-element.cpp
- automorphic-number.cpp
- back-to-front.cpp
- balanced-array.cpp
- bfs-graph.cpp
- bin-search.cpp
- binary-array-sorting.cpp
- binary-array-sorting2.cpp
- binary-arrays-sorting.cpp
- bitwise-operator.cpp
- boolean-matrix-problem.cpp
- bubble-sort.cpp
- bubble_sort.cpp
- c-fiend-function.cpp
- c-generic-sort.cpp
- c-hello-world.cpp
- c-to-f.cpp
- check-if-a-numbe-is-power-of-anter.cpp
- check-if-array-is-sorted.cpp
- check-if-b-is-an-anagram-of-a.cpp
- check-if-k-bit-is-set.cpp
- check-if-linked-list-is-palindrome.cpp
- check-if-string-is-isogram.cpp
- check-if-two-arrays-are-equals.cpp
- check-string.cpp
- check-whether-kth-bit-is-set.cpp
- check_for_binary.cpp
- circular-linked-list-head-insert.cpp
- circular-linked-list.cpp
- circular-list-delete-at-position.cpp
- compare-circular-doubly-linked-list.cpp
- compare-two-linked-lists.cpp
- consonant-and-vowals.checkcpp
- count-1-in-sorted-array.cpp
- count-bigger-than-x.cpp
- count-bst-nodes-that-lie-in-a-give-range.cpp
- count-distinc-vowels.cpp
- count-element-occurences.cpp
- count-leaves-in-binary-tree.cpp
- count-nodes-of-linked-list.cpp
- count-non-repeating-elements.cpp
- count-number-leaves-nodes.cpp
- count-number-of-set-bits.cpp
- count-numbers-divisible-by-m.cpp
- count-occurrency-linked-list.cpp
- count-odd-even.cpp
- count-of-camel-case-characters.cpp
- count-repeated-element.cpp
- count-smaller-elements.cpp
- count-smaller-than-x.cpp
- count-the-zeros.cpp
- count-words-in-string.cpp
- count-zeros.cpp
- data-types.cpp
- delete-a-node-in-single-linked-list.cpp
- delete-head-of-circular-list.cpp
- delete-head-of-doubly-linked-list.cpp
- delete-middle-of-linked-list.cpp
- delete-node-without-head-pointer.cpp
- delete-tail-of-circular-linked-list.cpp
- delete-tail-of-doubly-linked-list.cpp
- deque-implementation.cpp
- detect_loop.cpp
- detele-tail-linked-list.cpp
- digits-in-factorial.cpp
- display-circular-linked-list.cpp
- display-double-circular-linked-list.cpp
- display-double-linked-list-forward-and-backward.cpp
- display-linked-list.cpp
- display-longest-name.cpp
- doubly-linked-list-head-insert.cpp
- doubly-linked-list-tail-insert.cpp
- equilibrium-point.cpp
- even-odd.cpp
- facing-the-sun.cpp
- factorial_of_a_number.cpp
- find-duplicates-in-array.cpp
- find-first-set-bit-final2.cpp
- find-first-set-bit.cpp
- find-index.cpp
- find-lenght-of-loop.cpp
- find-maximum-number.cpp
- find-minimum-and-maximum-nuber.cpp
- find-nk-th-node-in-linked-list.cpp
- find-number-of-numbers.cpp
- find-odd-occurrenci.cpp
- find-position-of-set-bit.cpp
- find-the-frequency.cpp
- find-transition-point.cpp
- find-unique-element.cpp
- find-unique-element3.cpp
- find_immediate_smaller_than_x.cpp
- find_index.cpp
- find_the_fine.cpp
- first-and-second-smallest-element.cpp
- first-element-to-occur-k-times.cpp
- first-repeating-element.cpp
- first-repeating-element2.cpp
- first_letter_of_each_word.cpp
- for-loop-prime-check.cpp
- frequency_of_array_elements.cpp
- front-to-back.cpp
- full-function-bst.cpp
- fullprime.cpp
- generate-permutation.cpp
- get-length-circular-linked-list.cpp
- get_element-at-index.cpp
- get_element_by_index.cpp
- get_middle_element_of_circular_double_linked-list.cpp
- greater-on-right-side.cpp
- greatest_of_three_nubers.cpp
- identical-Linked-list.cpp
- immediate-grater.cpp
- immediate-smaller-element.cpp
- implement-queue-using-linked-list.cpp
- implement-stack-using-linked-list.cpp
- index-of-an-extra-element.cpp
- index-of-first-1-in-a-sorted-array-of-0s-and-1s.cpp
- inorder-of-BST.cpp
- inorder-traversal-and-bst.cpp
- inorder-traversal.cpp
- insert-a-node-in-a-bst.cpp
- insert-a-node-in-doubly-linked-list.cpp
- insert-at-the-end-of-circular-linked-list.cpp
- insert-in-middle-of-linked-list.cpp
- insert-in-sorted-linked-list.cpp
- insert-in-stack.cpp
- insert-node-in-doubly-linked-list.cpp
- insert-tail-circular-linked-list.cpp
- int-to-binary.cpp
- intersaction-pooint-iny-shapped-linked-list.cpp
- is-array-sorted.cpp
- is-the-doubly-linked-list-circular.cpp
- isIsogram.cpp
- join-two-linked-list.cpp
- k-larghest-elements.cpp
- k-th-element-of-two-sorted-arrays.cpp
- k_distance_from_root.cpp
- kth-larghest-elment-in-bst.cpp
- kth-smallest-number.cpp
- last-index-of-1.cpp
- leader-in-array.cpp
- learn-to-comment.cpp
- learning-struct.cpp
- left-view-of-binary-tree.cpp
- left_index.cpp
- left_view_of_binary_tree.cpp
- length-of-string.cpp
- level-order-of-binary-search-tree.cpp
- level-order-tree2.cpp
- linked-list-delete-at-position.cpp
- linked-list-insert.cpp
- linked-list-lenght-even-or-odd.cpp
- logical_operators.cpp
- longest-substring-containing-1.cpp
- lower-case.cpp
- lower-to-uppercase.cpp
- lowest-common-ancestor-bst.cpp
- majority-element.cpp
- map-operations.cpp
- max-and-mimum.cpp
- max-and-second-max.cpp
- max-distance-between-same-elements.cpp
- maximize-toys.cpp
- maximum-and-minimum-in-linked-list.cpp
- maximum-no-of-1s-row.cpp
- maximum-product-of-tw-numbers.cpp
- mean-and-median.cpp
- mean.cpp
- median-of-two-array.cpp
- merge-sort.cpp
- merge-two-sorted-arrays.cpp
- microsoft-reverse-words-in-string.cpp
- middle-element-linkedlist.cpp
- middle-of-stack.cpp
- min-in-BST.cpp
- minimum-product-pair.cpp
- mirror-tree.cpp
- missing-characters-in-panagram.cpp
- missing-number-in-an-array.cpp
- modular-node.cpp
- multimap-operations.cpp
- multiplication-under-modulo.cpp
- multiplication_table.cpp
- multiply-left-and-right-array-sum.cpp
- multiset-operator.cpp
- naive-pattern-search.cpp
- need-some-change.cpp
- new_line.cpp
- node-at-given-pos-linked-list.cpp
- non-preating-character.cpp
- non-repeating-character.cpp
- number-is-sparceor-not.cpp
- number-is-sparse-or-not.cpp
- number-of-digits.cpp
- number-of-occurrency.cpp
- numbers-containing-1-2-and-3.cpp
- occurrence-of-an-integer-in-a-linked-list.cpp
- odd-or-even.cpp
- operations-on-queue.cpp
- operations-on-stack.cpp
- pair-sum-in-vector.cpp
- pair-sum-vector.cpp
- pair-swap-linked-list.cpp
- pairs-with-difference-k.cpp
- panagram-checking.cpp
- peack-element.cpp
- porstOrder-of-BST.cpp
- postorder-traversal.cpp
- power-of-2.cpp
- power-of-two-checker.cpp
- preOrder-of-BST.cpp
- preoder-traversal.cpp
- prime-check.cpp
- prime-number-check.cpp
- prime-numbers-in-range.cpp
- print-adjacency-list.cpp
- print-alternate-elements-of-an-array.cpp
- print-distinct-element.cpp
- print-first-letter-of-every-word.cpp
- print-from-1-to-n-using-recursion.cpp
- print-linked-list.cpp
- print_an_element.cpp
- product-of-array-element.cpp
- product_max_in_first_and_min_in_sec.cpp
- queue-designer.cpp
- queue-operations.java
- queue-reversal.cpp
- queue_using_array.cpp
- remove-a-and0ac-from-given-string.cpp
- remove-duplicate-elements.cpp
- remove-duplicates-sorted-linked-list.cpp
- remove-head-single-linked-list.cpp
- remove-repeated-consecutive-digits.cpp
- remove-spaces.cpp
- remove_loop_from_linked_list.cpp
- removing-consecutive-duplicates.cpp
- repeate-char.cpp
- repeating-character-first-appearance-leftmost.cpp
- replace-os-with-5s.cpp
- reverse-a-string.cpp
- reverse-array-2.cpp
- reverse-array-using-stack.cpp
- reverse-columns-of-matrix.cpp
- reverse-first-k-elements-of-queue.cpp
- reverse-string-with-stack.cpp
- reverse-the-array.cpp
- reverse-word-in-given-string.cpp
- reverse_digits.cpp
- reverse_linked_list.cpp
- reversing-the-vowels.cpp
- right_and_left_rotation.cpp
- rotate-array-by-n-elements-1587115621.cpp
- rotate-array-by-n-elements.cpp
- rotate-array-by-n-elements.cpp.save.1
- rotate-matirixe-clowise.cpp
- rotate-matrix-of-90-degrees.cpp
- search-element-in-bst.cpp
- search-in-linked-list.cpp
- search-in-matrix.cpp
- search-in-sorted-array.cpp
- search-node-bst.cpp
- search0an-element-in-an-array.cpp
- set-all-odd-bits.cpp
- set-operations.cpp
- size-of-binary-tree.cpp
- smallest-positive-missing-number.cpp
- sort-a-stack.cpp
- sort-and-reverse.cpp
- sort-array-of-zeros-ones-and-two.cpp
- sort-arrays-of-0-and-1.cpp
- sort-arrays-of-0.cpp
- sort-linked-list-of-0s-1s-2s.cpp
- sorted-insert-for-circular-linked-list.cpp
- split-strings.cpp
- sqare-rooot.cpp
- stack-designer.cpp
- stack-implementation-with-array.cpp
- step-by-step-condition.cpp
- stl-vector.cpp
- string-quicksort.cpp
- string-validation.cpp
- strong-number.cpp
- strongest-neighbour.cpp
- strstr.cpp
- student-of-the-year.cpp
- subarray-with-given-sum.cpp
- sum-last-n-nodes.cpp
- sum-of-array-elements.cpp
- sum-of-array-elements2.cpp
- sum-of-binary-tree.cpp
- sum-of-digits.cpp
- sum-of-distinct-element.cpp
- sum-of-leaf-nodes-in-bst.cpp
- sum-of-leaf-nodes.cpp
- sum-of-matrix-elements.cpp
- sum-of-nodes.cpp
- sum_of_array.cpp
- sum_of_array2.cpp
- sum_of_depencies.cpp
- sum_of_first_n_terms.cpp
- swap-all-odd-and-evenb0-ts.cpp
- swap-the-objects.cpp
- taking-inputs.cpp
- template.cpp
- the-dice-problem.cpp
- third-larghest-element.cpp
- transponse.cpp
- transpose-of-matrix.cpp
- transpose-of-matrix.cpp.save
- tree-level-order-traversal.cpp
- twice-counter.cpp
- two-dimensional-world.cpp
- two-tree-are-identical.cpp
- two_numers-with-sum-closest-to-zero.cpp
- union-of-two-sorted-arrays-1587115621.cpp
- uppercase-to-lowercase.cpp
- value-equal-to-index-value.cpp
- vowels-in-string.cpp
- while-loop-print-table.cpp
- who--has-the-majority.cpp
- winner_of_an_election.cpp
images
java
must-do-coding-challenges
python
.gitignore
CODE_OF_CONDUCT.md
CONTRIBUTING.md
LICENSE
README.md
geeksforgeeks.png

sqare-rooot.cpp

Adds sqare root solution

Jul 7, 2020

5e511f5 · Jul 7, 2020