Skip to content
BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

77 Commits
0-1-knapsack-problem.cpp
0-1-knapsack-problem.cpp
 
 
README.md
README.md
 
 
a.out
a.out
 
 
all-anagrams.cpp
all-anagrams.cpp
 
 
all-anagrams2.cpp
all-anagrams2.cpp
 
 
array-subset-of-another-array.cpp
array-subset-of-another-array.cpp
 
 
array-to-bst.cpp
array-to-bst.cpp
 
 
bottom-view-binary-tree.cpp
bottom-view-binary-tree.cpp
 
 
bubble-sort.cpp
bubble-sort.cpp
 
 
check-for-balanced-parentheses-in-an-expression.cpp
check-for-balanced-parentheses-in-an-expression.cpp
 
 
check-for-children-sum-property-in-a-binary-tree.cpp
check-for-children-sum-property-in-a-binary-tree.cpp
 
 
check-for-identical-bsts-without-building-the-trees.cpp
check-for-identical-bsts-without-building-the-trees.cpp
 
 
check-given-binary-tree-follows-height-property-red-black-tree.cpp
check-given-binary-tree-follows-height-property-red-black-tree.cpp
 
 
check-two-nodes-cousins-binary-tree.cpp
check-two-nodes-cousins-binary-tree.cpp
 
 
clone-linked-list-next-arbit-pointer-set-2.cpp
clone-linked-list-next-arbit-pointer-set-2.cpp
 
 
combinational-sum.cpp
combinational-sum.cpp
 
 
connect-nodes-level-level-order-traversal.cpp
connect-nodes-level-level-order-traversal.cpp
 
 
construct-a-binary-tree-from-parent-array-representation.cpp
construct-a-binary-tree-from-parent-array-representation.cpp
 
 
construct-a-binary-tree-from-postorder-and-inorder.cpp
construct-a-binary-tree-from-postorder-and-inorder.cpp
 
 
construct-ancestor-matrix
construct-ancestor-matrix
 
 
construct-ancestor-matrix.cpp
construct-ancestor-matrix.cpp
 
 
construct-tree-from-given-inorder-and-preorder-traversal.cpp
construct-tree-from-given-inorder-and-preorder-traversal.cpp
 
 
contiguous-subarray-inboth.cpp
contiguous-subarray-inboth.cpp
 
 
count-number-of-words.cpp
count-number-of-words.cpp
 
 
custom-data-structure.cpp
custom-data-structure.cpp
 
 
cutting-a-rod.cpp
cutting-a-rod.cpp
 
 
design-a-stack-that-supports-getmin-in-o1-time-and-o1-extra-space.cpp
design-a-stack-that-supports-getmin-in-o1-time-and-o1-extra-space.cpp
 
 
dfs-detect_cycle.cpp
dfs-detect_cycle.cpp
 
 
diagonal-sum-binary-tree.cpp
diagonal-sum-binary-tree.cpp
 
 
dynamic-programming-set-8-matrix-chain-multiplication.cpp
dynamic-programming-set-8-matrix-chain-multiplication.cpp
 
 
edit-distance.cpp
edit-distance.cpp
 
 
egg-dropping-puzzle
egg-dropping-puzzle
 
 
egg-dropping-puzzle.cpp
egg-dropping-puzzle.cpp
 
 
find-count.cpp
find-count.cpp
 
 
find-depth-of-the-deepest-odd-level-node.cpp
find-depth-of-the-deepest-odd-level-node.cpp
 
 
find-duplicates-in-on-time-and-constant-extra-space.cpp
find-duplicates-in-on-time-and-constant-extra-space.cpp
 
 
find-longest-path-directed-acyclic-graph.cpp
find-longest-path-directed-acyclic-graph.cpp
 
 
find-max-inTree.cpp
find-max-inTree.cpp
 
 
find-maximum-path-sum-in-a-binary-tree.cpp
find-maximum-path-sum-in-a-binary-tree.cpp
 
 
find-maximum-path-sum-two-leaves-binary-tree.cpp
find-maximum-path-sum-two-leaves-binary-tree.cpp
 
 
find-number-of-islands.cpp
find-number-of-islands.cpp
 
 
find-sub-array-sum-closest-0.cpp
find-sub-array-sum-closest-0.cpp
 
 
find-sum-left-leaves-given-binary-tree.cpp
find-sum-left-leaves-given-binary-tree.cpp
 
 
find-the-first-missing-number.cpp
find-the-first-missing-number.cpp
 
 
find-the-highest-occurring-digit-in-prime-numbers-in-a-range.cpp
find-the-highest-occurring-digit-in-prime-numbers-in-a-range.cpp
 
 
find-the-longest-path-in-a-matrix-with-given-constraints.cpp
find-the-longest-path-in-a-matrix-with-given-constraints.cpp
 
 
find-the-maximum-sum-path-in-a-binary-tree.cpp
find-the-maximum-sum-path-in-a-binary-tree.cpp
 
 
find-the-nearest-smaller-numbers-on-left-side-in-an-array.cpp
find-the-nearest-smaller-numbers-on-left-side-in-an-array.cpp
 
 
find-the-number-occurring-odd-number-of-times.cpp
find-the-number-occurring-odd-number-of-times.cpp
 
 
find-the-two-repeating-elements-in-a-given-array.cpp
find-the-two-repeating-elements-in-a-given-array.cpp
 
 
find-three-closest-elements-from-given-three-sorted-arrays.cpp
find-three-closest-elements-from-given-three-sorted-arrays.cpp
 
 
first-repeated-word-in-string.cpp
first-repeated-word-in-string.cpp
 
 
fix-two-swapped-nodes-of-bst.cpp
fix-two-swapped-nodes-of-bst.cpp
 
 
flattening-a-linked-list.cpp
flattening-a-linked-list.cpp
 
 
float-double.cpp
float-double.cpp
 
 
floor-in-a-sorted-array.cpp
floor-in-a-sorted-array.cpp
 
 
game-with-string.cpp
game-with-string.cpp
 
 
google_find-string.cpp
google_find-string.cpp
 
 
graph-bfs.cpp
graph-bfs.cpp
 
 
greater-on-right-side.cpp
greater-on-right-side.cpp
 
 
in-place-convert-a-given-binary-tree-to-doubly-linked-list.cpp
in-place-convert-a-given-binary-tree-to-doubly-linked-list.cpp
 
 
inorder-tree-traversal-without-recursion.cpp
inorder-tree-traversal-without-recursion.cpp
 
 
inpost.cpp
inpost.cpp
 
 
inputf.in
inputf.in
 
 
insertion-sort.cpp
insertion-sort.cpp
 
 
iterative-inorder-traversal.cpp
iterative-inorder-traversal.cpp
 
 
iterative-k-distant
iterative-k-distant
 
 
iterative-k-distant.cpp
iterative-k-distant.cpp
 
 
iterative-level-order.cpp
iterative-level-order.cpp
 
 
iterative-method-to-find-height-of-binary-tree.cpp
iterative-method-to-find-height-of-binary-tree.cpp
 
 
k-anagrams-1.cpp
k-anagrams-1.cpp
 
 
kadanes-algorithm.cpp
kadanes-algorithm.cpp
 
 
key-pair.cpp
key-pair.cpp
 
 
linked-list-insert.cpp
linked-list-insert.cpp
 
 
list-matrix.cpp
list-matrix.cpp
 
 
list-matrix2.cpp
list-matrix2.cpp
 
 
longest-ap.cpp
longest-ap.cpp
 
 
longest-common-subsequence.cpp
longest-common-subsequence.cpp
 
 
longest-common-substring.cpp
longest-common-substring.cpp
 
 
longest-increasing-subsequence.cpp
longest-increasing-subsequence.cpp
 
 
longest-palindrome-substring-set-1.cpp
longest-palindrome-substring-set-1.cpp
 
 
majority-element.cpp
majority-element.cpp
 
 
make-linked-list.cpp
make-linked-list.cpp
 
 
manipulate-string.cpp
manipulate-string.cpp
 
 
max-heap.cpp
max-heap.cpp
 
 
max-sum-of-lengths.cpp
max-sum-of-lengths.cpp
 
 
maximum-difference.cpp
maximum-difference.cpp
 
 
maximum-index.cpp
maximum-index.cpp
 
 
maximum-of-all-subarrays-of-size-k.cpp
maximum-of-all-subarrays-of-size-k.cpp
 
 
maximum-of-minimum-for-every-window-size.cpp
maximum-of-minimum-for-every-window-size.cpp
 
 
maximum-profit.cpp
maximum-profit.cpp
 
 
maximum-sum-such-that-no-two-elements-are-adjacent.cpp
maximum-sum-such-that-no-two-elements-are-adjacent.cpp
 
 
maximum-value-in-a-bitonic-array.cpp
maximum-value-in-a-bitonic-array.cpp
 
 
merge-k-sorted-arrays
merge-k-sorted-arrays
 
 
merge-k-sorted-arrays.cpp
merge-k-sorted-arrays.cpp
 
 
merge-sort.cpp
merge-sort.cpp
 
 
mergesort-linkedlist.cpp
mergesort-linkedlist.cpp
 
 
minimum-distance-between-two-numbers.cpp
minimum-distance-between-two-numbers.cpp
 
 
minimum-length-unsorted-subarray-sorting-which-makes-the-complete-array-sorted.cpp
minimum-length-unsorted-subarray-sorting-which-makes-the-complete-array-sorted.cpp
 
 
n-divisors.cpp
n-divisors.cpp
 
 

Repository files navigation

Algorithms practice

This repository contains solutions to popular interview questions.

About

solutions to popular interview questions

Topics

algorithmsalgorithms-and-data-structurescppdata-structuresgeeksforgeeksgeeksforgeeks-cppgeeksforgeeks-dsageeksforgeeks-interview-prepgeeksforgeeks-solutionsinterviewinterview-practiceinterview-preparationinterview-questions

Resources

Readme
Activity

Stars

11 stars

Watchers

2 watching

Forks

8 forks
Report repository

Releases

Packages

Contributors

Languages