{"id":18401833,"url":"https://github.com/vedbhanushali/supreme_dsa","last_synced_at":"2025-07-22T09:09:15.281Z","repository":{"id":182248054,"uuid":"668139065","full_name":"Vedbhanushali/SUPREME_DSA","owner":"Vedbhanushali","description":"github repository of DSA challenges","archived":false,"fork":false,"pushed_at":"2025-06-28T18:58:39.000Z","size":26688,"stargazers_count":10,"open_issues_count":0,"forks_count":2,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-28T19:50:29.772Z","etag":null,"topics":["algorithms","competitive-programming","cpp","dsa","dsa-algorithm","dsa-practice","frontendmasters","github","github-codespaces","learn","open-source","replit","stl-algorithms","stl-containers"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Vedbhanushali.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2023-07-19T05:49:57.000Z","updated_at":"2025-06-28T18:58:43.000Z","dependencies_parsed_at":"2025-06-28T19:47:49.840Z","dependency_job_id":null,"html_url":"https://github.com/Vedbhanushali/SUPREME_DSA","commit_stats":null,"previous_names":["vedbhanushali/supreme_dsa"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Vedbhanushali/SUPREME_DSA","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vedbhanushali%2FSUPREME_DSA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vedbhanushali%2FSUPREME_DSA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vedbhanushali%2FSUPREME_DSA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vedbhanushali%2FSUPREME_DSA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Vedbhanushali","download_url":"https://codeload.github.com/Vedbhanushali/SUPREME_DSA/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vedbhanushali%2FSUPREME_DSA/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":266463039,"owners_count":23932895,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-07-22T02:00:09.085Z","response_time":66,"last_error":null,"robots_txt_status":null,"robots_txt_updated_at":null,"robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","competitive-programming","cpp","dsa","dsa-algorithm","dsa-practice","frontendmasters","github","github-codespaces","learn","open-source","replit","stl-algorithms","stl-containers"],"created_at":"2024-11-06T02:40:09.606Z","updated_at":"2025-07-22T09:09:15.258Z","avatar_url":"https://github.com/Vedbhanushali.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# SUPREME_DSA\n\ngithub repository of DSA challanges\n\n## 1. Basics of programming\n\n[difference of endl and \\n](./2_basic_of_programmin_II/README.md#difference-of-endl-and-n)  \n[C datatypes](./2_basic_of_programmin_II/README.md#c-basic-datatypes)  \n[ascii table](./2_basic_of_programmin_II/README.md#asci-table-imp)  \n[negative number storeing](./2_basic_of_programmin_II/README.md#how-negative-numbers-are-stored-in-memory)  \n[Switch](./2_basic_of_programmin_II/README.md#switch)  \n[Miscellaneous](./2_basic_of_programmin_II/README.md#miscellaneous)  \n[Time comlexity precedence](./2_basic_of_programmin_II/README.md#time-complexity--space)\n\n## 2. Arrays\n\n[Sort zero's \u0026 one's (Dutch national flag problem)](/3_Array/README.md#sort-zeros--ones-dutch-national-flag-problem)  \n[Pascal Triangle](/3_Array/README.md#pascal-triangle)  \n[CODE SNIPPETS (swapping,reverse array)](/3_Array/README.md#code-snippets)  \n[Vector merge two vectors in new vector](/3_Array/README.md#merge-two-vectors)\n\n### Array Practice Questions\n\n[sort colors](/3_Array/Assignment.md#sort-colors)  \n[move all -ve no the left side of array](/3_Array/Assignment.md#move-all--ve-no-the-left-side-of-array)  \n[find duplicate Number](/3_Array/Assignment.md#find-duplicate-number)  \n[missing elements from an array with duplicate](/3_Array/Assignment.md#missing-elements-from-an-array-with-duplicate)  \n[Find first occurence](/3_Array/Assignment.md#find-first-occurence)  \n[Common element in 3 sorted array](/3_Array/Assignment.md#common-element-in-3-sorted-array)  \n[Wave print a matrix](/3_Array/Assignment.md#wave-print-a-matrix)  \n[Spiral print a matrix](/3_Array/Assignment.md#spiral-print-a-matrix)  \n[add two number of array](/3_Array/Assignment.md#add-two-number-of-array)  \n[find factorial of number](/3_Array/Assignment.md#find-factorial-of-number)\n\n## 3. Binary Search\n\n[binary search](/4_searching_and_sorting/binary_search.md#binary-search)  \n[find first occurrence](/4_searching_and_sorting/binary_search.md#find-first-occurrence)  \n[find last occurrence](/4_searching_and_sorting/binary_search.md#find-first-occurrence)  \n[total number of occurrences](/4_searching_and_sorting/binary_search.md#total-number-of-occurrences)  \n[find peak element in mountain array](/4_searching_and_sorting/binary_search.md#find-peak-element-in-a-mountain-array)  \n[find pivot element in array](/4_searching_and_sorting/binary_search.md#find-pivot)  \n[search in sorted rotated array](/4_searching_and_sorting/binary_search.md#search-in-rotated-sorted-array-application-of-finding-pivot-element)  \n[find square root](/4_searching_and_sorting/binary_search.md#find-square-root)  \n[search in nearly sorted array](/4_searching_and_sorting/binary_search.md#binary-search-in-nearly-sorted-array)  \n[Divide two numbers using binary search](/4_searching_and_sorting/binary_search.md#divide-two-numbers-using-binary-search)\n[Binary search in 2D matrix](/4_searching_and_sorting/binary_search.md#binary-search-on-2d-matrix)\n\n### index based binary search\n\n[find missing elements (index based binary search)](/4_searching_and_sorting/binary_search.md#find-missing-element)  \n[find odd occuring element in an array](/4_searching_and_sorting/binary_search.md#find-odd-occuring-element-in-array)\n\n## 3. Sorting\n\n[Selection sort](/4_searching_and_sorting/sorting.md#selection-sort)  \n[Bubble sort](/4_searching_and_sorting/sorting.md#bubble-sort)  \n[Insertion sort](/4_searching_and_sorting/sorting.md#insertion-sort)  \n[STL sort](/4_searching_and_sorting/sorting.md#sort-using-stl-sort)\n[custom sort](/4_searching_and_sorting/sorting.md#custom-comparator)\n\n### Practice Questions of searching and sorting\n\n[K-Diff Pairs In An Array](/4_searching_and_sorting/Assignment.md#k-diff-pairs-in-an-array)  \n[Find K-Closest Element](/4_searching_and_sorting/Assignment.md#find-k-closest-element)  \n[Exponential Search \u0026 Unbounded](/4_searching_and_sorting/Assignment.md#exponential-search--unbounded)  \n[Binary Search in infinite array](/4_searching_and_sorting/Assignment.md#binary-searching-in-infinite-array)  \n[Book Allocation Problem](/4_searching_and_sorting/Assignment.md#book-allocation-problem)  \n[Painters Partition Problem](/4_searching_and_sorting/Assignment.md#painters-partition-problem)  \n[Aggresive Cows](/4_searching_and_sorting/Assignment.md#aggresive-cows)  \n[EKO SPOJ](/4_searching_and_sorting/Assignment.md#eko-spoj)  \n[PRATA](/4_searching_and_sorting/Assignment.md#prata)  \n[Median or row wise sorted matrix](/4_searching_and_sorting/Assignment.md#Median-of-row-wise-sorted-matrix)\n\n## 4. Char arrays and string\n\n[input string methods](./5_char_array_string/README.md)  \n[check palindrome](./5_char_array_string/README.md#check-palindrome)  \n[remove duplicates](./5_char_array_string/README.md#remove-duplicates)  \n[remove all occurrences of part from main string](./5_char_array_string/README.md#remove-all-occurrences-of-part-from-main-string)  \n[valid palindrome 2](./5_char_array_string/README.md#valid-palindrome-2)  \n[minimum time difference](./5_char_array_string/README.md#minimum-time-difference)  \n[palindromic substring](./5_char_array_string/README.md#palindromic-substring)\n\n### Practice Questions of strings\n\n[valid anagram](./5_char_array_string/Assignment.md#valid-anagram)  \n[reverse only letters](./5_char_array_string/Assignment.md#reverse-only-letters)  \n[longest common prefix](./5_char_array_string/Assignment.md#longest-common-prefix)  \n[reverse vowels of as string](./5_char_array_string/Assignment.md#reverse-vowels-of-a-string)  \n[isomorphic string](./5_char_array_string/Assignment.md#isomorphic-string)  \n[reorganize string](./5_char_array_string/Assignment.md#reorganize-string)  \n[group anagram](./5_char_array_string/Assignment.md#group-anagram)  \n[longest palindromix substring](./5_char_array_string/Assignment.md#longest-palindromic-substring)  \n[find the index of first occurence in a string](./5_char_array_string/Assignment.md#find-the-index-of-first-occurence-in-a-string)  \n[string to integer (stoi)](./5_char_array_string/Assignment.md#string-to-integer-stoi)  \n[string compression](./5_char_array_string/Assignment.md#string-compression)  \n[Integers to Roman](./5_char_array_string/Assignment.md#integers-to-roman)  \n[Zigzag conversion](./5_char_array_string/Assignment.md#zigzag-conversion)  \n[Largest number](./5_char_array_string/Assignment.md#largest-number)\n[Palindrome Partitioning](/5_char_array_string/Assignment.md#palindrome-partitioning)\n\n## Pointers and Mathematics algorithms\n\n[Seive of Erathosthenes - prime number](/6_pointers_maths/README.md#seive-of-erathosthenes---count-prime)  \n[GCD euclid algorithm](/6_pointers_maths/README.md#gcd-euclid-algorithm)  \n[Modulus properties](/6_pointers_maths/README.md#modulus-properties)  \n[Fast exponential pow(a,b)](/6_pointers_maths/README.md#fast-exponential)  \n[Find modulus of negative number](/6_pointers_maths/README.md#find-modulus-of-negative-number)  \n[Pigeon hole](/6_pointers_maths/README.md#pigeon-hole)  \n[catalan number bst](/6_pointers_maths/README.md)  \n[inclusion exclusion principle](/6_pointers_maths/README.md)  \n[chinese reminder theorem](/6_pointers_maths/README.md)  \n[lucas's theorem](/6_pointers_maths/README.md)  \n[fermat's theorem](/6_pointers_maths/README.md)  \n[probability concepts](/6_pointers_maths/README.md)\n\n## Recursion\n\n[print 1 to n](/7_Recurssion/README.md#print-1-to-n)  \n[factorial](/7_Recurssion/README.md#factorial)  \n[fibonaci](/7_Recurssion/README.md#fibonaci)  \n[climbing stairs](/7_Recurssion/README.md#climbing-stairs)  \n[array print all element using recursion](/7_Recurssion/README.md#array-print-all-element-using-recursion)  \n[find max in array using recursion](/7_Recurssion/README.md#find-max-in-array-using-recursion)  \n[finding value in array using array](/7_Recurssion/README.md#finding-value-in-array-using-recursion)  \n[print all digits of number using recursion](/7_Recurssion/README.md#print-all-digits-of-number-using-recursion)  \n[finding is array sorted](/7_Recurssion/README.md#finding-is-array-is-sorted)  \n[Binary search using recursion](/7_Recurssion/README.md#binary-search-using-recursion)  \n[Subsequence of string](/7_Recurssion/README.md#subsequence-of-string)  \n[Coin exchange](/7_Recurssion/README.md#coin-exchange)  \n[Cut into segement](/7_Recurssion/README.md#cut-into-segments)  \n[Maximum sum of adjacent elements](/7_Recurssion/README.md#maximum-sum-of-adjacent-elements)  \n\n### Practice Questions of recursion\n\n[Last occurrence of a char](/7_Recurssion/Assignment.md#last-occurrence-of-a-char)  \n[Reverse a string RE](/7_Recurssion/Assignment.md#reverse-a-string-re)  \n[Add string RE](/7_Recurssion/Assignment.md#add-string-re)  \n[palindrome check RE](/7_Recurssion/Assignment.md#palindrome-check-re)  \n[Remove all occurrence of substring](/7_Recurssion/Assignment.md#remove-all-occurrence-of-substring)  \n[print all subarrays using RE](/7_Recurssion/Assignment.md#print-all-subarrays-using-re)  \n[Buy and sell stocks](/7_Recurssion/Assignment.md#buy-and-sell-stocks)  \n[House Robber](/7_Recurssion/Assignment.md#house-robber---todo-optimization)  \n[Integer to English words](/7_Recurssion/Assignment.md#integer-to-english-words)  \n[Wild card Matching](/7_Recurssion/Assignment.md#wild-card-matching---todo-optimization)  \n[Perfect squares](/7_Recurssion/Assignment.md#perfect-squares)  \n[Minimum cost for tickets](/7_Recurssion/Assignment.md#minimum-cost-for-tickets)  \n[Number of dice roll with target sum](/7_Recurssion/Assignment.md#number-of-dice-roll-with-target-sum)  \n\n## Divide and Conquer\n\n[merge sort](/8_Divide_and_conquor/README.md#merge-sort)  \n[In place Merge sort](/8_Divide_and_conquor/README.md#inplace-merge-sort)  \n[quick sort](/8_Divide_and_conquor/README.md#quicksort)  \n\n## Backtracking\n\n[permutation of string](/9_backtracking/README.md#permutation-of-string)  \n[house robber problem](/9_backtracking/README.md#house-robber-problem)  \n[rate in maze](/9_backtracking/README.md#rate-in-maze)  \n[sudoko solver](/9_backtracking/README.md#sudoko-solver)  \n[N Queen](/9_backtracking/README.md#n-queen)  \n[generate paranthesis](/9_backtracking/README.md)  \n[phonekeypad problem](/9_backtracking/README.md#phone-keypad-problem)  \n\n### Practice Questions of Backtracking\n\n[count inversion](/9_backtracking/Assignment.md#count-inversion)  \n[inplace mergesort](/8_Divide_and_conquor/README.md#inplace-merge-sort)  \n[max sub array sum](/9_backtracking/Assignment.md#max-sub-array-sum)  \n[quicksort end element as pivot  best way short](/8_Divide_and_conquor/README.md#quicksort)  \n[combination sum](/9_backtracking/Assignment.md#combination-sum)  \n[combination sum II](/9_backtracking/Assignment.md#combination-sum-ii)  \n[permutation II](/9_backtracking/Assignment.md#permutation-ii)  \n[Beautiful arrangment](/9_backtracking/Assignment.md#beautiful-arrangment)  \n[Distribute Repeating Integers](/9_backtracking/Assignment.md#distribution-repeating-integers)  \n\n## OOPS\n\n[Static memory allocation](/10_OPPS/README.md#static-memory-allocation)  \n[Dynamic memory allocation](/10_OPPS/README.md#dynamic-memory-allocation)  \n[1D array and 2D array heap memory](/10_OPPS/README.md#1d-memory-allocation)  \n[Constructor](/10_OPPS/README.md#constructor)  \n[Destructor](/10_OPPS/README.md#destructor)  \n[Encapsulation](/10_OPPS/README.md#encapsulation)  \n[Inheritance](/10_OPPS/README.md#inheritance)  \n[Types of inheritance](/10_OPPS/README.md#types-of-inheritance)  \n[Polymorphism](/10_OPPS/README.md#polymorphism)  \n[Abstraction](/10_OPPS/README.md#abstraction)  \n[const keyword](/10_OPPS/README.md#const-keyword)  \n[mutable keyword](/10_OPPS/README.md#mutable-used-for-debugging-purpose-only---production-code-not-good-practise)  \n[Initialization list](/10_OPPS/README.md#initialization-list)  \n[Macros](/10_OPPS/README.md#macros)  \n[Shallow copy vs deep copy](/10_OPPS/README.md#shallow-copy-vs-deep-copy)  \n[local and global variables](/10_OPPS/README.md#local-and-global-variables)  \n[Static keyword in class](/10_OPPS/README.md#static-keyword-in-class)  \n[Abstraction deep](/10_OPPS/README.md#abstraction)  \n[Inline function](/10_OPPS/README.md#inline-function)  \n[friend keyword](/10_OPPS/README.md#friend-keyword)  \n[private constructor](/10_OPPS/README.md#private-constructor)  \n[Virtual constructor vs virtual destructor](/10_OPPS/README.md#virtual-constructor-vs-virtual-destructor)  \n\n## LinkedList\n\n[Single LinkedList structure](/11_LinkedList/LINKEDLIST.md#single-linked-list)  \n[find length of linkedlist](/11_LinkedList/LINKEDLIST.md#find-length-of-linkedlist)  \n[Insert at head](/11_LinkedList/LINKEDLIST.md#insert-at-head)  \n[Insert at tail](/11_LinkedList/LINKEDLIST.md#insert-at-tail)  \n[Insert at position](/11_LinkedList/LINKEDLIST.md#insert-at-position)  \n[Delete node at postion](/11_LinkedList/LINKEDLIST.md#delete-node-at-postion)  \n[Reverse Linked list using loops](/11_LinkedList/LINKEDLIST.md#reverse-linked-list-using-loops)  \n[Reverse linked list using recursion](/11_LinkedList/LINKEDLIST.md#reverse-linked-list-using-recursion)  \n[find middle of Linked list](/11_LinkedList/LINKEDLIST.md#find-length-of-linkedlist)  \n[K group reverse Linked list](/11_LinkedList/LINKEDLIST.md#k-groups-reverse-linked-list)  \n[LL circular detection and deleting loop](/11_LinkedList/LINKEDLIST.md#is-ll-circular--detect-and-delete-loop)  \n[LL is palindrome of not](/11_LinkedList/LINKEDLIST.md#linked-list-is-palindrome-or-not)  \n[Remove duplicates from sorted LL](/11_LinkedList/LINKEDLIST.md#remove-duplicates-from-a-sorted-ll)  \n[Remove duplicates from unsorted LL](/11_LinkedList/LINKEDLIST.md#remove-duplicates-from-unsorted-ll)  \n[Sort 0's 1's and 2's in LL](/11_LinkedList/LINKEDLIST.md#sort-0s-1s-and-2s-in-ll)  \n[Add two numbers represented by LL](/11_LinkedList/LINKEDLIST.md#two)  \n\n## Doubly LinkedList\n\n[Doubly linked list structure](/11_LinkedList/DOUBLY_LINKEDLIST.md#doubly-linked-list)  \n[print doubly linked list](/11_LinkedList/DOUBLY_LINKEDLIST.md#print-doubly-linked-list)  \n[length of doubly linked list](/11_LinkedList/DOUBLY_LINKEDLIST.md#length-of-doubly-linked-list)  \n[Insert at head](/11_LinkedList/DOUBLY_LINKEDLIST.md#insert-at-head)  \n[Insert at tail](/11_LinkedList/DOUBLY_LINKEDLIST.md#insert-at-tail)  \n[Insert at position](/11_LinkedList/DOUBLY_LINKEDLIST.md#insert-at-position)  \n[Delete node from position](/11_LinkedList/DOUBLY_LINKEDLIST.md#delete-node-from-position)  \n\n### Practice Questions of LL\n\n[Merge 2 Sorted Linked List](/11_LinkedList/Assignment.md#merge-2-sorted-linked-list)  \n[Clone a Linked List with Random Pointer](/11_LinkedList/Assignment.md#clone-a-linked-list-with-random-pointer)  \n[Merge Sort in Linked list](/11_LinkedList/Assignment.md#merge-sort-in-linked-list)  \n[Flatten a Linked List](/11_LinkedList/Assignment.md#flatten-a-linked-list)  \n[Print kth node from end of Linked List](/11_LinkedList/Assignment.md#print-kth-node-from-end-of-linked-list)  \n[Intersection point of 2 Linked list](/11_LinkedList/Assignment.md#intersection-point-of-2-linked-list)  \n[Rotate List (Leetcode)](/11_LinkedList/Assignment.md#rotate-list-leetcode)  \n[Delete n nodes after m nodes (Leetcode)](/11_LinkedList/Assignment.md#delete-n-nodes-after-m-nodes-leetcode)  \n[Find min/max number between critical points (Leetcode)](/11_LinkedList/Assignment.md#find-minmax-number-between-critical-points-leetcode)  \n[Merge Node in between zeroes (Leetcode)](/11_LinkedList/Assignment.md#merge-node-in-between-zeroes-leetcode)  \n\n## Stack\n\n[Stack operations](/12_Stack/README.md#stack)  \n[Custom stack implementation (without using STL)](/12_Stack/README.md#custom-stack-implementation-not-using-stl-stack-library)  \n[Create 2 stack in one array](/12_Stack/README.md#create-2-stack-in-1-array)  \n[reverse string using stack](/12_Stack/README.md#reverse-string-using-stack)  \n[find middle element in stack](/12_Stack/README.md#find-middle-element-in-stack)  \n[Insert at bottom of stack](/12_Stack/README.md#insert-at-bottom-of-stack-insert-top-of-stack-element-to-bottom)  \n[reverse a stack using only one stack](/12_Stack/README.md#reverse-a-stack-using-only-one-stack)  \n[Valid parenthesis](/12_Stack/README.md#valid-parenthesis)  \n[Sort a stack](/12_Stack/README.md#sort-a-stack)  \n[Remove redundant brackets](/12_Stack/README.md#remove-redundant-brackets)  \n[Min stack (stack containg the minimum element in it)](/12_Stack/README.md#min-stack)  \n[longest valid parantheses](/12_Stack/README.md#longest-valid-paratheses)  \n[Next smaller element](/12_Stack/README.md#next-smaller-element)  \n[Prev Smaller element](/12_Stack/README.md#prev-smaller-element)  \n[Largest rectangular area in histogram](/12_Stack/README.md#largest-rectangular-area-in-histogram)  \n\n### Practice Questions of Stack\n\n[Minimum Bracket Reversal](/12_Stack/Assignment.md#minimum-bracket-reversal)  \n[Remove All Adjacent Duplicates In String](/12_Stack/Assignment.md#remove-all-adjacent-duplicates-in-string)  \n[Celebrity Problem](/12_Stack/Assignment.md#celebrity-problem)  \n[Next greater element in Linked List leetcode](/12_Stack/Assignment.md#next-greater-element-in-linked-list-leetcode)  \n[N Stacks in an Array](/12_Stack/Assignment.md#n-stacks-in-an-array)  \n[Online Stock Span Leetcode](/12_Stack/Assignment.md#online-stock-span-leetcode)  \n[Check If Word Is Valid After Substitutions Leetcode](/12_Stack/Assignment.md#check-if-word-is-valid-after-substitutions-leetcode)  \n[Decode Strings Leetcode](/12_Stack/Assignment.md#decode-strings-leetcode)  \n[Car Fleet - I Leetcode](/12_Stack/Assignment.md#car-fleet---i-leetcode)  \n[Car Fleet - 11 Leetcode](/12_Stack/Assignment.md#car-fleet---11-leetcode)  \n[Simplify Path Leetcode](/12_Stack/Assignment.md#simplify-path-leetcode)  \n[Max rectangle in Binary Matrix with all Is](/12_Stack/Assignment.md#max-rectangle-in-binary-matrix-with-all-is)  \n[Trapping rain Water](/12_Stack/Assignment.md#trapping-rain-water)  \n\n## Queue\n\n[operations](/13_Queue/README.md#operations)  \n[custom implementation of Queue](/13_Queue/README.md#custom-implementation-of-queue)  \n[Circular Queue](/13_Queue/README.md#circular-queue)  \n[Input restricted Queue](/13_Queue/README.md#input-restricted-queue)  \n[Output restricted Queue](/13_Queue/README.md#output-restricted-queue)  \n[Doubly ended Queue(Deque)](/13_Queue/README.md#doubly-ended-queue-deque)  \n[Circular Doubly ended Queue](/13_Queue/README.md#circular-doubly-ended-queue)  \n[STL Deque](/13_Queue/README.md#stl-deque)  \n[Reverse a queue](/13_Queue/README.md#reverse-a-queue)  \n[Reverse first k element of queue](/13_Queue/README.md#reverse-first-k-element-of-queue)  \n[Interleave first and second half of Queue](/13_Queue/README.md#interleave-first-and-second-half-of-queue)  \n[First -ve integer in every window of size k(sliding window + Queue)](/13_Queue/README.md#first--ve-integer-in-every-window-of-size-k-sliding-window--queue)  \n[Non-repeated character in a string](/13_Queue/README.md#non-repeated-character-in-a-string)  \n[Gas Station](/13_Queue/README.md)  \n[Sliding window maximum(sliding window + Queue)](/13_Queue/README.md#sliding-window-maximum-queue--sliding-window)  \n\n### Practice Questions of Queue\n\n[Implement Queue using stack](/13_Queue/Assignement.md#implement-queue-using-stack)  \n[Implement Stack using Queue](/13_Queue/Assignement.md#implement-stacks-using-queue)  \n[Implement k Queue in an array](/13_Queue/Assignement.md#implement-k-queues-in-an-array)  \n\n## Tree\n\n[Types of tree](/14_Tree/README.md#types-of-tree)  \n[Terms of tree](/14_Tree/README.md#terms-of-tree)  \n[Tree traversal](/14_Tree/README.md#tree-traversals)  \n[Building tree](/14_Tree/README.md#building-tree)  \n[Level order Traversal](/14_Tree/README.md#level-order-traversal)  \n[Inorder Traversal](/14_Tree/README.md#inorder-traversal---lnr)  \n[Preorder Traversal](/14_Tree/README.md#preordertraversal---nlr)  \n[PostOrder Traversal](/14_Tree/README.md#postorder-traversal---lrn)  \n[Maximum depth / height of binary tree](/14_Tree/README.md#maximum-depth--height-of-tree)  \n[Maximum depth / height of N-ary tree](/14_Tree/README.md#maximum-depth--height-of-n-ary-tree)  \n[Diameter of tree](/14_Tree/README.md#diameter-of-tree)  \n[Check if two tree are identical or not](/14_Tree/README.md#check-if-two-tree-are-identical-or-not)  \n[Check if two trees are mirror images of each other or not](/14_Tree/README.md#check-if-two-trees-are-mirror-images-of-each-other-or-not)  \n[Check if binary tree is balanced binary tree](/14_Tree/README.md#check-if-binary-tree-is-balanced-binary-tree)  \n[Check whether BT is sum tree or not/ convert BST into sum tree](/14_Tree/README.md#check-whether-bt-is-sum-tree-or-not--convert-bst-into-sum-tree)  \n[Lowest common ancestor](/14_Tree/README.md#lowest-common-ancestor)  \n[Kth ancestor](/14_Tree/README.md#kth-ancestor)  \n[Path sum](/14_Tree/README.md#path-sum)  \n[Path sum II](/14_Tree/README.md#path-sum-ii)  \n[Sum of longest bloodline](/14_Tree/README.md#sum-of-longest-bloodline-todo)  \n[Build tree from inorder and preorder traversal](/14_Tree/README.md#build-tree-from-inorder-and-preorder-traversal)  \n[Top View of binary tree](/14_Tree/README.md#top-view-of-binary-tree)  \n[Bottom view of binary Tree](/14_Tree/README.md#bottom-view-of-binary-tree)  \n[left view of tree](/14_Tree/README.md#left-view-of-binary-tree)  \n[right view of tree](/14_Tree/README.md#right-view)  \n[boundary view of tree](/14_Tree/README.md#boundary-traversal)  \n\n### Practice Questions of Tree\n\n[Fast way to find diameter of tree](/14_Tree/Assignment.md#fast-way-to-find-diameter-of-a-tree)  \n[Fast way to determing that binary tree is balanced or not](/14_Tree/Assignment.md#fast-way-to-determine-that-the-binary-tree-is-balanced-or-not)  \n[Check 2 trees are identical or not](/14_Tree/Assignment.md#check-2-trees-are-identical-or-not)  \n[Check 2 trees are mirror of each other or not](/14_Tree/Assignment.md#check-2-trees-are-mirror-of-each-other-or-not)  \n[Diagonal traversal of a binary tree](/14_Tree/Assignment.md#diagonal-traversal-of-a-binary-tree)  \n[Zig-Zag traversal of a binary tree](/14_Tree/Assignment.md#zig-zag-traversal-of-a-binary-tree)  \n[Transform to Sum tree.](/14_Tree/Assignment.md#transform-to-sum-tree)  \n[Vertical traversal of a binary tree.](/14_Tree/Assignment.md#vertical-traversal-of-a-binary-tree)  \n[Morris traversal of a binary tree](/14_Tree/Assignment.md#morris-traversal-of-a-binary-tree)  \n[Sum of longest bloodline of a tree](/14_Tree/Assignment.md#sum-of-longest-bloodline-of-a-tree)  \n[K-sum path in a binary tree](/14_Tree/Assignment.md#k-sum-path-in-a-binary-tree)  \n[Max sum of non-adjacent nodes in binary tree](/14_Tree/Assignment.md#max-sum-of-non-adjacent-nodes-in-binary-tree)  \n[Max time to burn a binary tree](/14_Tree/Assignment.md#max-time-to-burn-a-binary-tree)  \n[Flatten a Binary tree into Linked List](/14_Tree/Assignment.md#flatten-a-binary-tree-into-linked-list)  \n[Check if a Binary Tree contains duplicate subtrees of size 2 or more](/14_Tree/Assignment.md#check-if-a-binary-tree-contains-duplicate-subtrees-of-size-2-or-more)  \n[Check for Children Sum Property in a Binary Tree](/14_Tree/Assignment.md#check-for-children-sum-property-in-a-binary-tree)  \n[Serialize and Deserialize Binary Tree](/14_Tree/Assignmentmd#serialize-and-deserialize-binary-tree)  \n\n## BST\n\n[BST creation](/15_BST/README.md#bst-creation)  \n[Searching in BST](/15_BST/README.md#searching-in-bst)  \n[Minimum and Maximum value in BST](/15_BST/README.md#minimum-and-maximum-value-in-bst)  \n[Inorder predeccessor/successor](/15_BST/README.md#inorder-of-bst)  \n[Deletion in BST](/15_BST/README.md#deletion-in-bst)  \n[Validate BST](/15_BST/README.md#validate-bst)  \n[Lowest Common Ancestor](/15_BST/README.md#lowest-common-ancestor)  \n[Kth smallest Element in a BST](/15_BST/README.md#kth-smallest-element-in-a-bst)  \n[Create BST from Inorder Traversal](/15_BST/README.md#create-bst-from-inorder-traversal)  \n[Convert a BST into balanced BST](/15_BST/README.md#convert-a-bst-into-balanced-bst-todo)  \n[2 sum in BST](/15_BST/README.md#2-sum-in-bst)  \n[Convert BST into sorted doubly linked list](/15_BST/README.md#convert-bst-into-sorted-doubly-linked-list)  \n[Sorted doubly LL into BST](/15_BST/README.md#sorted-doubly-ll-into-bst)  \n[Convert sorted List to BST](/15_BST/README.md#convert-sorted-list-to-binary-search-tree)  \n[Find largest BST in binary tree](/15_BST/README.md#find-larget-bst-in-binary-tree)  \n[Merge 2 BST](/15_BST/README.md#merge-2-bst)  \n\n### Practice Questions of BST\n\n[Find inorder successor and inorder predecessor in a BST](/15_BST/Assignment.md#find-inorder-successor-and-inorder-predecessor-in-a-bst)  \n[Construct BST from preorder traversal](/15_BST/Assignment.md#construct-bst-from-preorder-traversal)  \n[Count pairs from 2 BST whose sum is eqaul to given value 'X'](/15_BST/Assignment.md#count-pairs-from-2-bst-whose-sum-is-equal-to-given-value-x)  \n[Convert a normal BST into balanced BST](/15_BST/Assignment.md#convert-a-normal-bst-into-a-balanced-bst)  \n[Find the median of BST in O(n) time and O(1) space](/15_BST/Assignment.md#find-the-median-of-bst-in-on-time-and-01-space)  \n[Check whether BST contains Dead end](/15_BST/Assignment.md#check-whether-bst-contains-dead-end)  \n[Flatten BST to sorted list](/15_BST/Assignment.md#flatten-bst-to-sorted-list)  \n[Count BST nodes that lie in a given range](/15_BST/Assignment.md#count-bst-nodes-that-lie-in-a-given-range)  \n[Replace every element with least greater element on its right.](/15_BST/Assignment.md#replace-every-element-with-the-least-greater-element-on-its-right)  \n[Valid BST from preorder](/15_BST/Assignment.md#valid-bst-from-preorder)  \n\n## Heap\n\n[Heap](/16_Heap/README.md#heap)  \n[Max heap](/16_Heap/README.md#max-heap)  \n[Insertion in max Heap](/16_Heap/README.md#insertion-in-max-heap)  \n[Deletion in max heap](/16_Heap/README.md#deletion-in-max-heap)  \n[Heapify](/16_Heap/README.md#heapify)  \n[Heap Sort](/16_Heap/README.md#heap-sort)  \n[stl heap](/16_Heap/README.md#stl-heap)  \n[kth smallest number in array](/16_Heap/README.md#kth-smallest-number-in-array)  \n[merge 2 max heap](/16_Heap/README.md#merge-2-max---heap)  \n[find if complete binary tree is heap or not](/16_Heap/README.md#find-if-complete-binary-tree-is-heap-or-not)  \n[convert bst into max heap](/16_Heap/README.md#convert-bst-into-max-heap)  \n[check given tree is CBT](/16_Heap/README.md#check-given-tree-is-cbt-complete-binary-tree-or-not)  \n[merge k sorted array](/16_Heap/README.md#merge-k---sorted-array)  \n[merge k sorted LL](/16_Heap/README.md#merge-k-sorted-ll)  \n[smallest range covering element from k lists](/16_Heap/README.md#smallest-range-covering-element-from-k-lists)  \n[remove stones to minimize the total](/16_Heap/README.md#remove-stones-to-minimize-the-total)  \n[make heap and heapify stl](/16_Heap/README.md#make_heap-and-heapify-stl-todo)  \n[reorganize string](/16_Heap/README.md#reorganize-string)  \n[longest happy string](/16_Heap/README.md#longest-happy-string)  \n[find median from data stream](/16_Heap/README.md#find-median-from-data-stream)  \n\n### Practice questions of heap\n\n[Check if tree is a heap](/16_Heap/Assignment.md#check-if-tree-is-a-heap)  \n[Merge 2 max heaps](/16_Heap/Assignment.md#merge-2-max-heaps)  \n[K closest point to origin](/16_Heap/Assignment.md#k-closest-point-to-origin)  \n[Sliding window maximum](/16_Heap/Assignment.md#sliding-window-maximum)  \n[Get biggest three rhombus sums in a grid](/16_Heap/Assignment.md#get-biggest-three-rhombus-sums-in-a-grid)  \n[Min diff in sum after element removal](/16_Heap/Assignment.md#min-diff-in-sum-after-element-removal)  \n[Min number of refuelling stops](/16_Heap/Assignment.md#min-number-of-refuelling-stops)  \n\n## Maps and Tries\n\n[HashMap](/17_Maps/README.md#hashmap)  \n[HashMap stl](/17_Maps/README.md#hashmap-stl)  \n[Implementation](/17_Maps/README.md#implementation)  \n[Custom hashMap implementation](/17_Maps/README.md#custom-hashmap-implementation)  \n[Using bucket array](/17_Maps/README.md#using-bucket-array)  \n[Good hash function](/17_Maps/README.md#good-hash-function)  \n[Find freq of characters in string](/17_Maps/README.md#find-freq-of-characters-in-string)  \n[Check circular LL](/17_Maps/README.md#check-circular-ll)  \n[Tries](/17_Maps/README.md#tries)  \n[Trie structure](/17_Maps/README.md#trie-structure)  \n[Longest common prefix](/17_Maps/README.md#longest-common-prefix)  \n[Implement dictornary](/17_Maps/README.md#implement-dictonary)  \n[Mutliset to find min and max in single Data structure](/17_Maps/README.md#mutliset-to-find-min-and-max-in-single-data-structure)  \n\n### Practice question for Map \u0026 Tries\n\n[Custom Sort String (using HashMap in class level)](/17_Maps/Assignment.md#custom-sort-string-using-hashmap-in-class-level)  \n[Array subste of another array](/17_Maps/Assignment.md#array-subset-of-another-array)  \n[Union of two linked list](/17_Maps/Assignment.md#union-of-two-linked-list)  \n[Intersection of two linked list](/17_Maps/Assignment.md#intersection-of-two-linked-list)  \n[Sum equal to sum](/17_Maps/Assignment.md#sum-equal-to-sum)  \n[Largest subarray with 0 sum](/17_Maps/Assignment.md#largest-subarray-with-0-sum)  \n[Implement trie prefix tree](/17_Maps/Assignment.md#implement-trie-prefix-tree)  \n[Replace words](/17_Maps/Assignment.md#replace-words)  \n[Top K frequent words](/17_Maps/Assignment.md#top-k-frequent-words)  \n[Camelcase matching](/17_Maps/Assignment.md#camelcase-matching)\n[Palindrome pairs](/17_Maps/Assignment.md#palindrome-pairs)  \n\n## DP\n\n[Approach](/18_DP/README.md#approaches)  \n[When to apply DP](/18_DP/README.md#when-to-apply-dp)  \n[Top down (Memoization)](/18_DP/README.md#top-down-memoization)  \n[Bottom Up (Tabulation)](/18_DP/README.md#bottom-up-tabulation)  \n[Space Optimization](/18_DP/README.md#space-optimization)  \n[1D DP and 2D DP](/18_DP/README.md#1d-dp-and-2d-dp)  \n[Fibonacci](/18_DP/README.md#fibonacci)  \n[Coin change](/18_DP/README.md#coin-change)  \n[House robber](/18_DP/README.md#house-robber)  \n[Painting Fence](/18_DP/README.md#painting-fence)  \n[0/1 knapsack problem - 2D DP problem](/18_DP/README.md#01-knapsack-problem---2d-dp-problem)  \n[Out of Boundary Paths - 3D DP problem](/18_DP/README.md#out-of-boundary-paths---3d-dp-problem)  \n[Partition equal subset sum](/18_DP/README.md#partition-equal-subset-sum)  \n[Number of dice roll with target](/18_DP/README.md#number-of-dice-roll-with-target)  \n[Minimum swaps to make sequence increasing](/18_DP/README.md#minimum-swaps-to-make-sequence-increasing)  \n[Guess number higher or lower II](/18_DP/README.md#guess-number-higher-or-lower-ii)  \n[Minimum cost tree leaf values](/18_DP/README.md#minimum-cost-tree-from-leaf-values)  \n[Unique binary search tree](/18_DP/README.md#unique-binary-search-tree)  \n[DP on string](/18_DP/README.md#dp-on-string)  \n[Find longes increasing subsequence](/18_DP/README.md#find-longest-increasing-subsequence)  \n[DP with binary search](/18_DP/README.md#dp-with-binary-search)  \n[Russian Doll envelopes](/18_DP/README.md#russian-doll-envelopes)  \n[Maximum Height by stacking cuboids](/18_DP/README.md#maximum-height-by-stacking-cuboids)  \n\n### Practice question of DP\n\nLinear DP\n\n- [Perfect Squares Leetcode](/18_DP/Assignment.md#perfect-squares-leetcode)  \n- [Min Cost for Tickets Leetcode](/18_DP/Assignment.md#min-cost-for-tickets-leetcode)  \n\nDP on Strings\n\n- [Longest Palindromic SubString Leetcode](/18_DP/Assignment.md#longest-palindromic-substring-leetcode)  \n- [Distinct Subsequences Leetcode](/18_DP/Assignment.md#distinct-subsequences-leetcode)  \n- [Min ASCII Delete Sum for 2 Strings Leetcode](/18_DP/Assignment.md#min-ascii-delete-sum-for-2-strings-leetcode)  \n- [Word Break 1 and 2 Leetcode](/18_DP/Assignment.md#word-break-1-and-2-leetcode)  \n\nDP on Trees\n\n- [House Robber iii Leetcode](/18_DP/Assignment.md#house-robber-iii-leetcode)  \n- [Unique BST ii Leetcode](/18_DP/Assignment.md#unique-bst-ii-leetcode)  \n\nDP on Intervals\n\n- [Stone Games Leetcode](/18_DP/Assignment.md#stone-games-leetcode)  \n- [Burst balloons Leetcode](/18_DP/Assignment.md#burst-balloons-leetcode)  \n\nLIS / LCS Variants\n\n- [Intervleaving Strings Leetcode](/18_DP/Assignment.md#intervleaving-strings-leetcode)  \n- [Min Insertion steps to make a string palindrome Leetcode](/18_DP/Assignment.md#min-insertion-steps-to-make-a-string-palindrome-leetcode)  \n- [Min Number of Removals to make Mountain Array Leetcode](/18_DP/Assignment.md#min-number-of-removals-to-make-mountain-array-leetcode)  \n- [Make Array Strictly increasing Leetcode](/18_DP/Assignment.md#make-array-strictly-increasing-leetcode)  \n\nBuy \u0026 Sell Stocks Variants [all 5 variants] Leetcode\n\n- [1st Variant [121. Best Time to Buy and Sell Stock] - Already Covered in Recursion Week HomeWork](/18_DP/Assignment.md#1st-variant-121-best-time-to-buy-and-sell-stock---already-covered-in-recursion-week-homework)  \n\nKnapsack DP\n\n- [Target Sum Leetcode](/18_DP/Assignment.md#target-sum-leetcode)  \n- [Min Swaps to make Sequences increasing Leetcode](/18_DP/Assignment.md#min-swaps-to-make-sequences-increasing-leetcode)  \n- [Reducing Dishes Leetcode](/18_DP/Assignment.md#reducing-dishes-leetcode)  \n- [Ones and Zeroes Leetcode](/18_DP/Assignment.md#ones-and-zeroes-leetcode)  \n\nMinMax DPs\n\n- [Predict the Winner Leetcode](/18_DP/Assignment.md#predict-the-winner-leetcode)  \n- [Partition Array for Maximum Sum](/18_DP/Assignment.md#partition-array-for-maximum-sum)  \n\n## Graph\n\n[Types of graph](/19_Graphs/README.md#types-of-graphs)  \n[Degree of node](/19_Graphs/README.md#degree-of-node)  \n[In degree](/19_Graphs/README.md#in-degree)  \n[Out degree](/19_Graphs/README.md#out-degree)  \n[path](/19_Graphs/README.md#path)  \n[Acyclic Graph](/19_Graphs/README.md#acyclic-graph)  \n[Graph Implementation](/19_Graphs/README.md#graph-implementation)  \n[Adjancency Matrix](/19_Graphs/README.md#adjancency-matrix)  \n[Adjancency List](/19_Graphs/README.md#adjancency-list)  \n[weighted adjancency list](/19_Graphs/README.md#weighed-adjancency-list)  \n[Graph data structure](/19_Graphs/README.md#graph-data-structure)  \n[BFS and DFS traversal](/19_Graphs/README.md#bfs--dfs-traversal)  \n[Cycle Detection using BFS, DFS for Directed and undirected](/19_Graphs/README.md#cycle-detection)  \n[Topological Sort using DFS \u0026 (BFS - kahn's algorithm)](/19_Graphs/README.md#topological-sort)  \n[Shortest path using BFS](/19_Graphs/README.md#shortest-path)  \n[Shortest path using DFS and Topological sort](/19_Graphs/README.md#shortest-path)  \n[Shortest path using Dijkstra algorithm set implementation](/19_Graphs/README.md#shortest-path-using-dijkstra-algorithm)    \n[Shortest path Dijkstra (Word ladder problem priority queue implementation )](/19_Graphs/README.md#word-ladder)  \n[Cons of Dijkstra and its alternate solution](/19_Graphs/README.md#cons-of-djikstra-algorithm)  \n[Shortest path Bellman Ford algorithm](/19_Graphs/README.md#bellman---ford-algorithm)  \n[Floyd Warshall](/19_Graphs/README.md#floyd-warshall)  \n[Strongly Connected component / Kosaraju algorithm](/19_Graphs/README.md#strongly-connected-component-scc--kosaraju-algorithm)  \n[Bridge in a graph / Tarjan's algorithm](/19_Graphs/README.md#bridge-in-a-graph--tarjans-algorithm)  \n\n### questions\n\n[Number of provincies (BFS \u0026 DFS)](/19_Graphs/README.md#number-of-provincies)  \n[Number of island (DFS)](/19_Graphs/README.md#number-of-islands)  \n[Flodd fill (DFS)](/19_Graphs/README.md#flood-fill)  \n[Rotting Oranges (BFS - find deepest level)](/19_Graphs/README.md#rotting-oranges)  \n[Course Schedule (topological sort)](/19_Graphs/README.md#course-schedule)  \n[Course Schedule II (topological sort)](/19_Graphs/README.md#course-schedule-ii)  \n[Path with Minimum Effort (Dijkstra priority queue)](/19_Graphs/README.md#path-with-minimum-effort)  \n[Critical Connection in a network (finding bridges)](/19_Graphs/README.md#critical-connections-in-a-network)  \n\n### assignments\n\n[Spanning Tree and Minimum spanning tree](/19_Graphs/Assignment.md#spanning-tree)  \n[Prim's algorithm](/19_Graphs/Assignment.md#prims-algorithm)  \n[Kruskal's algorithm](/19_Graphs/Assignment.md#kruskals-algorithm)  \n[Eventual Safe states](/19_Graphs/Assignment.md#eventual-safe-states)  \n[Word Ladder-2](/19_Graphs/Assignment.md#word-ladder-2)  \n[Minimum Mulitiplication to reach End](/19_Graphs/Assignment.md#minimum-multiplications-to-reach-end)  \n[Number of operation to make network Connected](/19_Graphs/Assignment.md#number-of-operations-to-make-network-connected)  \n[Find the city with the smallest number of neighbours at a threshold distance](/19_Graphs/Assignment.md#find-the-city-with-the-smallest-number-of-neighbours-at-a-threshold-distance)  \n[Accounts merge](/19_Graphs/Assignment.md#accounts-merges)  \n\n## Greedy\n\n[Arrival time of train](/20_Greedy/README.md#arrival-time-of-train)  \n[Lollipop](/20_Greedy/README.md#lollipop)  \n[DEFKIN](/20_Greedy/README.md#defkin)\n[Min cost of ropes](/20_Greedy/README.md#min-cost-of-ropes)  \n[Huffman encoding](/20_Greedy/README.md#huffman-encoding)  \n[Fractional knapsack](/20_Greedy/README.md#fractional-knapsack)  \n[Chocolate Distribution](/20_Greedy/README.md#chocolate-distribution)  \n\n## Sliding Window\n\n[Fixed size window](/21_sliding_window/README.md#fixed-size-windows)  \n[Varaible size window](/21_sliding_window/README.md#variable-size-window)  \n[Two pointer approach](/21_sliding_window/README.md#two-pointer-approach)  \n[Optimized window](/21_sliding_window/README.md#optimized-window)  \n[Smallest window in a string containing all the characters of another string](/21_sliding_window/README.md#smallest-window-in-a-string-containing-all-the-characters-of-another-string)  \n\n## Bit Manipulation\n\n[Odd/even checking](/22_Bit_Manipulation/README.md#oddeven-checking)  \n[Bit masking](/22_Bit_Manipulation/README.md#bit-masking)  \n[Change ith bit](/22_Bit_Manipulation/README.md#change-ith-bit)  \n[Single number XOR logic duplication](/22_Bit_Manipulation/README.md#single-number)  \n[Clear last ith bits](/22_Bit_Manipulation/README.md#clear-last-i-bits)  \n[Check power of 2](/22_Bit_Manipulation/README.md#check-power-of-2)  \n[Count set bits](/22_Bit_Manipulation/README.md#count-set-bits)  \n[Fast exponential](/22_Bit_Manipulation/README.md#fast-exponential)  \n[Clear range of bits](/22_Bit_Manipulation/README.md#clear-range-of-bits)  \n[subsequence using bit masking](/22_Bit_Manipulation/README.md#subsequence-using-bitmasking)  \n\n## Placment Guidance\n\n[Interview Dos and Don'ts](/PLACEMENT_STUFF/Interview__Dos_and_Donts_love_babbar.pdf)  \n[Placement opportunities](/PLACEMENT_STUFF/Lets_talk_about_Placement_Opportunities_with_love_babber.pdf)  \n[Resume Review](/PLACEMENT_STUFF/Lets_talk_about_RESUME_witth_love_babbar.pdf)  \n\n## LICENSE\n\n[MIT LICENSE](/LICENSE)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvedbhanushali%2Fsupreme_dsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fvedbhanushali%2Fsupreme_dsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvedbhanushali%2Fsupreme_dsa/lists"}