Competitive_Coding

This repo contains, all the programs written by me for competitive programming contests (as mentioned below) I have participated till date.

./
├── A_Jeff_and_Digits.cpp
├── all algorithms.txt
├── Allocation KICKSTART 2020.cpp
├── book.pdf
├── Class
│   └── FenwickTree.cpp
├── CodeChef
│   ├── Bon_Appetit.cpp
│   ├── CENS20D.cpp
│   ├── Chef_and_Dynamo.cpp
│   ├── Chef_got_Recipes.cpp
│   ├── Coders_Legacy_Jul2020
│   │   ├── Chef_vs_Doof.cpp
│   │   └── Doof_on_Cartesian.cpp
│   ├── Cook-Off_Apr2020
│   │   ├── Lift Requests.cpp
│   │   └── Matrix_Decomposition.cpp
│   ├── Cook-Off_Dec2020
│   │   ├── catch_the_thief.cpp
│   │   ├── min_attendance_required.cpp
│   │   └── Self-Destructing_Strings.cpp
│   ├── Cook-Off_Jan2020
│   │   ├── chefChick.cpp
│   │   └── examCheating.cpp
│   ├── Div_3_Rated_Contest_2021_Division_2_(Unrated)
│   │   ├── Body_Mass_Index.cpp
│   │   ├── Chef_and_Patients.cpp
│   │   ├── Rectangle.cpp
│   │   └── Total_Score.cpp
│   ├── FANCY.cpp
│   ├── IARCS OPC Judge Problems
│   │   ├── Average.cpp
│   │   ├── Discrepancies_in_the_Voters_List.cpp
│   │   ├── Dividing_Squences.cpp
│   │   ├── End_of_Corruption.cpp
│   │   ├── Find_the_Permutation.cpp
│   │   ├── Lead_Game.cpp
│   │   ├── List_of_Books.cpp
│   │   ├── Longest_Palindrome.cpp
│   │   ├── Next_Permutation.cpp
│   │   ├── Permutation_Cycles.cpp
│   │   ├── Reverse.cpp
│   │   ├── Whats_the_Rank.cpp
│   │   ├── Word_list.cpp
│   │   └── Zero_One_Tiles.cpp
│   ├── Long-Challenge_Apr2020
│   │   ├── COVID_Pandemic_and_Long_Queue.cpp
│   │   ├── Sell_All_the_Cars.cpp
│   │   ├── Squared_Subsequences.cpp
│   │   ├── Strange_Number.cpp
│   │   └── Unit_GCD.cpp
│   ├── Long-Challenge_Aug2020
│   │   ├── 1.cpp
│   │   ├── 2.cpp
│   │   ├── 3.cpp
│   │   └── 4.cpp
│   ├── Long-Challenge_Dec2019
│   │   ├── Easy Subsequence Selection.cpp
│   │   ├── Plus Multiply.cpp
│   │   ├── That Is My Score!.cpp
│   │   ├── Untitled1.cpp
│   │   └── untitled.cpp
│   ├── Long-Challenge_Dec2020
│   │   ├── Digit_Matrix.cpp
│   │   ├── Even_Pair_Sum.cpp
│   │   ├── input.txt
│   │   ├── output.txt
│   │   ├── Positive_Prefixes.cpp
│   │   ├── Vaccine_Distribution.cpp
│   │   └── Vaccine_Production.cpp
│   ├── Long-Challenge_Feb2020
│   │   ├── Hard Cash.cpp
│   │   ├── Long Challenge and Cookoff overlap.cpp
│   │   ├── No Change Required .cpp
│   │   ├── School of Geometry.cpp
│   │   └── The Theater Problem.cpp
│   ├── Long-Challenge_Feb2021
│   │   ├── Chef_and_Meetings.cpp
│   │   ├── Frog_Sort.cpp
│   │   ├── Highest_Divisor.cpp
│   │   ├── Maximise_Funtion.cpp
│   │   ├── Prime_Game.cpp
│   │   ├── Team_Name.cpp
│   │   └── XOR Sums.java
│   ├── Long-Challenge_Jan2021
│   │   ├── Chef_and_Div3.cpp
│   │   ├── Encoded_String.cpp
│   │   ├── Fair_Elections.cpp
│   │   ├── Point_of_Impact.cpp
│   │   └── Watching_CPL.cpp
│   ├── Long-Challenge_Jul2020
│   │   ├── Ada_King.cpp
│   │   ├── Chef_and_Card_Game.cpp
│   │   ├── Chef_and_Strings.cpp
│   │   ├── Chefina_and_Swaps.cpp
│   │   ├── Doctor_Chef.cpp
│   │   ├── Missing_a_Point.cpp
│   │   └── temp.cpp
│   ├── Long-Challenge_Jun2020
│   │   ├── Chef_and_Icecream.cpp
│   │   ├── Chef_and_Price_Control.cpp
│   │   ├── Chef_and_String.cpp
│   │   ├── Even_Matrix.cpp
│   │   ├── Main_Template.cpp
│   │   ├── Operation_on_a_Tuple.cpp
│   │   ├── Operation_on_Tuple.cpp
│   │   └── The_Tom_and_Jerry_Game.cpp
│   ├── Long-Challenge_Mar2020
│   │   ├── Ada Bishop 2.cpp
│   │   ├── Lasers Everywhere.cpp
│   │   ├── Pintu and Fruits.cpp
│   │   ├── untitled.cpp
│   │   └── XOR Engine.cpp
│   ├── Long-Challenge_May2020
│   │   ├── chef_and_bitwise_product.cpp
│   │   ├── coronavirus_spread.cpp
│   │   ├── isolation_centers.cpp
│   │   ├── sorting_vases.cpp
│   │   └── triple_sort.cpp
│   ├── Long-Challenge_Nov2020
│   │   └── FEMA2.cpp
│   ├── Long-Challenge_Oct2020
│   │   ├── Chef_and_Easy_Queries.cpp
│   │   ├── Covid_Run.cpp
│   │   ├── Positive_AND.cpp
│   │   └── Replace_for_X.cpp
│   ├── Lunch-Time_Apr2020
│   │   ├── Another_Birthday_Present.cpp
│   │   ├── Chef_in_Fantasy_League.cpp
│   │   └── Positive_Mex.cpp
│   ├── Lunch-Time_Dec2020
│   │   ├── input.txt
│   │   ├── One_Zero_Swaps.cpp
│   │   ├── Sed_Sequences.cpp
│   │   └── Three_Letters.cpp
│   ├── Lunch-Time_Jan2020
│   │   ├── Bob And His Friends.cpp
│   │   └── Chef And Street Food.cpp
│   ├── Lunchtime may 2021
│   │   ├── Charges.cpp
│   │   ├── K_Subarrays.cpp
│   │   ├── Tom_And_Jerry_1.cpp
│   │   └── Total_Components.cpp
│   ├── Lunch-Time_May2021
│   │   └── TomAndJerry1.cpp
│   ├── Lunch-Time_Nov2019
│   │   ├── Compress the List.cpp
│   │   └── Untitled1.cpp
│   ├── Mah_Queen.cpp
│   ├── Marbles.cpp
│   ├── Mussadi_Lal_and_Stairs.cpp
│   ├── ObtainTheSum.cpp
│   ├── Root_of_the_Problem.cpp
│   └── TOWIN.cpp
├── Codeforces
│   ├── 1028B.cpp
│   ├── 1068B.cpp
│   ├── 1092B.cpp
│   ├── 118A.cpp
│   ├── 1195C.cpp
│   ├── 122A.cpp
│   ├── 1250F.cpp
│   ├── 1325B.cpp
│   ├── 1335A.cpp
│   ├── 1343B.cpp
│   ├── 1353B.cpp
│   ├── 1353C.cpp
│   ├── 1360B.cpp
│   ├── 1367B.cpp
│   ├── 1385B.cpp
│   ├── 1400A.cpp
│   ├── 1419D1.cpp
│   ├── 1450B.cpp
│   ├── 1453A.cpp
│   ├── 1490B.cpp
│   ├── 1490C.cpp
│   ├── 1490D.cpp
│   ├── 158B.cpp
│   ├── 1593E.cpp
│   ├── 160A.cpp
│   ├── 173A.cpp
│   ├── 197A.cpp
│   ├── 208A.cpp
│   ├── 230B.cpp
│   ├── 268C.cpp
│   ├── 318A.cpp
│   ├── 32B.cpp
│   ├── 337A.cpp
│   ├── 339B.cpp
│   ├── 401C.cpp
│   ├── 415B.cpp
│   ├── 451A.cpp
│   ├── 451B.cpp
│   ├── 455A.cpp
│   ├── 467B.cpp
│   ├── 478B.cpp
│   ├── 478C.cpp
│   ├── 479A.cpp
│   ├── 479C.cpp
│   ├── 489C.cpp
│   ├── 492B.cpp
│   ├── 499B.cpp
│   ├── 508B.cpp
│   ├── 510A.cpp
│   ├── 58A.cpp
│   ├── 69A.cpp
│   ├── 734B.cpp
│   ├── 831B.cpp
│   ├── 83A.cpp
│   ├── 978B.cpp
│   ├── Anton_and_Danik.cpp
│   ├── B_Drinks.cpp
│   ├── Bear_and_Big_Brother.cpp
│   ├── Beautiful_Matrix.cpp
│   ├── Beautiful_year.cpp
│   ├── Bit++.cpp
│   ├── Boy_or_Girl.cpp
│   ├── C1_Potions_Easy_Version_.cpp
│   ├── Calculating_function.cpp
│   ├── C_Ball_in_Berland.cpp
│   ├── Codeforces Global Round 15
│   │   └── (A) Subsequence Permutation.cpp
│   ├── CodeForces_Round_#615
│   │   ├── A.cpp
│   │   ├── B.cpp
│   │   └── C.cpp
│   ├── Codeforces_Round_#661
│   │   ├── 1.cpp
│   │   └── 2.cpp
│   ├── Codeforces_Round_#693
│   │   ├── a.cpp
│   │   ├── b.cpp
│   │   ├── c.cpp
│   │   ├── d.cpp
│   │   └── input.txt
│   ├── Codeforces Round #703 (Div. 2)
│   │   ├── 1486A.cpp
│   │   ├── 1486B.cpp
│   │   ├── 1486C1.cpp
│   │   └── 1486D.cpp
│   ├── D_Districts_Connection.cpp
│   ├── Dominant_piranha.cpp
│   ├── Domino_Piling.cpp
│   ├── Drinks.cpp
│   ├── Educational_Round_#81
│   │   ├── Display The Number.cpp
│   │   ├── Infinite_Prfixes.cpp
│   │   ├── Same_GCD.cpp
│   │   └── tempCodeRunnerFile.cpp
│   ├── Elections.cpp
│   ├── Elephant.cpp
│   ├── George_and_Accomodation.cpp
│   ├── Helpful_Maths.cpp
│   ├── Hulk.cpp
│   ├── In_Search_of_an_Easy_problem.cpp
│   ├── LuntikAndSubsequences.cpp
│   ├── Magnets.cpp
│   ├── MinMexCut.cpp
│   ├── Nearly_Lucky_Number.cpp
│   ├── Next_Round.cpp
│   ├── Petr_and_a_Combination_Lock.cpp
│   ├── Petya_and_strings.cpp
│   ├── Presents.cpp
│   ├── Queue_at_the_School.cpp
│   ├── Sifid ans Strange Subsequences.cpp
│   ├── Soldier_and_Banana.cpp
│   ├── Stones_on_the_Table.cpp
│   ├── Team.cpp
│   ├── tempCodeRunnerFile.cpp
│   ├── Tram.cpp
│   ├── Translation.cpp
│   ├── Ultra-fast_Mathematician.cpp
│   ├── Unique_Number.cpp
│   ├── Vanya_and_fence.cpp
│   ├── Watermelon.cpp
│   ├── Way_too_Long_Words.cpp
│   ├── Word_Capitalisation.cpp
│   ├── Word.cpp
│   └── Wrong_Substraction.cpp
├── _config.yml
├── convert_cases_of_a_string.txt
├── Convert int to string.txt
├── CP
│   ├── BackTracking
│   │   └── Knights_Tour_Problem.cpp
│   ├── Binary_Search
│   │   ├── Allocate_Minimum_Number_of_Pages.cpp
│   │   ├── Binary_Search.cpp
│   │   ├── Binary_Search_on_Reverse_Sorted_Array.cpp
│   │   ├── Count_of_Element_in_Sorted_Array.cpp
│   │   ├── Find_an_Element_in_Bitonic_Array.cpp
│   │   ├── Find_an_Element_in_Row-wise_Column-wise_Sorted_Array.cpp
│   │   ├── Find_Ceil_of_an_Element_in_Sorted_Array.cpp
│   │   ├── Find_Element_in_Sorted_Rotated_Array.cpp
│   │   ├── Find_Floor_of_an_Element_in_Sorted_Array.cpp
│   │   ├── Finding_an_Element_in_Infinite_Sorted_Array.cpp
│   │   ├── Find_Max_Element_in_Bitonic_Array.cpp
│   │   ├── Find_Next_Alphabetical_Element.cpp
│   │   ├── First_Occurence_of_a_Number_in_Sorted_Array.cpp
│   │   ├── Last_Occurence_of_a_Number_in_Sorted_Array.cpp
│   │   ├── Minimum_Difference_Element_in_Sorted_Array.cpp
│   │   ├── Number_of_Times_a_Sorted_Array_is_Rotated.cpp
│   │   ├── Order_Agnostic_Binary_Search.cpp
│   │   ├── Peak_Element_in_a_Array.cpp
│   │   └── Searching_in_a_Nearly_Sorted_Array.cpp
│   ├── DP
│   │   ├── 0-1 KnapSack
│   │   │   ├── Count_Number_of_Subset_with_given_Difference.cpp
│   │   │   ├── Count_of_Subset_Sum_with_a_Given_Sum.cpp
│   │   │   ├── Equal_Sum_Partition.cpp
│   │   │   ├── IPL.cpp
│   │   │   ├── Knapsack_Probelm.cpp
│   │   │   ├── Minimum_Subset_Sum_Difference.cpp
│   │   │   ├── Subset_Sum_Problem.cpp
│   │   │   ├── SUPW.cpp
│   │   │   └── Target_Sum.cpp
│   │   ├── Edit Distance
│   │   │   └── Edit Distance.cpp
│   │   ├── Longest_Common_Subsequence
│   │   │   ├── Longest_Common_Subsequence.cpp
│   │   │   ├── Longest_Palindromic_SubSequence.cpp
│   │   │   ├── Longest_Repeating_Subsequence.cpp
│   │   │   ├── Minimmum_Number_of_Insertion_and_Deletion_to_Convert_String_A_to_B.cpp
│   │   │   ├── Minimum_Deletions_to_make_String_Palindrome.cpp
│   │   │   ├── Minimum_Number_of_Insertion_in_String_to_make_Palindrome.cpp
│   │   │   ├── Print_Longest_Common_Subsequence.cpp
│   │   │   ├── Print_Shortest_Common_SuperSequence.cpp
│   │   │   ├── Sequence_Pattern_Matching.cpp
│   │   │   └── Shortest_Common_SuperSequence_Length.cpp
│   │   ├── Matrix_Chain_Multiplication
│   │   │   ├── Egg_Dropping_Puzzle.cpp
│   │   │   ├── Evaluate_Expression_to_True.cpp
│   │   │   ├── MCM.cpp
│   │   │   └── Palindrome_Partitioning.cpp
│   │   └── Unbounded_KnapSack
│   │       ├── Coin_Change_Problem_Max_Number_of_Ways.cpp
│   │       ├── Coin_Change_Problem_Min_Number_of_Coins.cpp
│   │       ├── Rod_Cutting_Problem.cpp
│   │       └── Unbounded_Knapsack_Probelm.cpp
│   ├── Graph
│   │   ├── BFS-2D_Chess_Knight_Move_Codechef.cpp
│   │   ├── BFS-2D_Jungle_Run_HackerEarth.cpp
│   │   ├── BFS_Monk_and_the_Island_HackerEarth.cpp
│   │   ├── BFS_Prime_Path_SPOJ.cpp
│   │   ├── BFS_Social_Networking_Graph_HackerEarth.cpp
│   │   ├── Bipartite_Graph_BUGLIFE - A Bug’s Life.cpp
│   │   ├── Connected_Components_in_a_Graph.cpp
│   │   ├── Detect_Cycle_in_Directed_Graph.cpp
│   │   ├── Detect_Cycle_in_Un-Directed_Graph.cpp
│   │   ├── DFS-2D_Counting_Rooms_CSES.cpp
│   │   ├── DFS_Bertown_Roads_Codechef.cpp
│   │   ├── DFS.cpp
│   │   ├── DFS_Feasible_Relations_HackerEarth.cpp
│   │   ├── DFS_Submerging_Islands_SPOJ.cpp
│   │   ├── DFS_using_Loop.cpp
│   │   ├── finding of articulation points.cpp
│   │   ├── Fire Escape Routes.cpp
│   │   ├── KahnsAlgorithm_Topological_Sort_SPOJ.cpp
│   │   ├── Kruskal_Algo.cpp
│   │   ├── KruskalAlgorithm_Minimum_Spanning_Tree_HackerEarth.cpp
│   │   ├── PRIM's algo for MST using minheap O(nlogn).cpp
│   │   ├── PT07Y - Is it a tree.cpp
│   │   ├── Single_Source_Shortest_Path.cpp
│   │   └── topological sort.cpp
│   ├── Heap
│   │   ├── Connect_Ropes_to_Minimise_the_Cost.cpp
│   │   ├── Frequency_Sort.cpp
│   │   ├── K_Closest_Element.cpp
│   │   ├── K_Closest_Points_to_Origin.cpp
│   │   ├── Kth_Smallest_Element.cpp
│   │   ├── Return_K_Largest_Elements_in_Array.cpp
│   │   ├── Sort_a_K_Sorted_Array.cpp
│   │   ├── Sum_of_Elements_between_k1_Smallest_and_k2_Smallest_Numbers.cpp
│   │   └── Top_K_Frequent.cpp
│   ├── Number_Theory
│   │   ├── Arpa's_hard_exam_and_Mehrdad's_naive_cheat-CodeForces.cpp
│   │   ├── euler's totient function O(nlogn).cpp
│   │   ├── Fibonacci_Finding-HackerRank.cpp
│   │   ├── GCD_Queries-CodeChef.cpp
│   │   ├── Micro_and_Prime_Prime-HackerEarth.cpp
│   │   ├── Modular_GCD-CodeChef.cpp
│   │   ├── Primality_Test-Codechef.cpp
│   │   ├── PRIME1-Prime_Generator-SPOJ.cpp
│   │   ├── Prime_Interval-HackerEarth.cpp
│   │   └── TDKPRIME-Finding_the_Kth_Prime-SPOJ.cpp
│   ├── Policy Based Data Structure
│   │   ├── inversion_count_using_pbds.cpp
│   │   ├── pairs_of_topics.cpp
│   │   ├── pbds_impmentation.cpp
│   │   └── policy_based_ds.cpp
│   ├── Recursion
│   │   ├── Generate_all_Parenthesis.cpp
│   │   ├── Josephus_Problem.cpp
│   │   ├── Kth_Symbol_in_Grammar.cpp
│   │   ├── Recursion_PrintAllSubsequences.cpp
│   │   ├── Sort_Array_Using_Recursion.cpp
│   │   └── Tower_of_Hanoi.cpp
│   ├── Segment_Tree
│   │   ├── Help_Ashu-HackerEarth.cpp
│   │   ├── KQUERY-K_Query-SPOJ.cpp
│   │   ├── Lazy_Tree.cpp
│   │   ├── Merge_Sort_Tree.cpp
│   │   ├── Multiple_of_3-Codechef.cpp
│   │   ├── RMQSQ-Range_Minimum_Query-SPOJ.cpp
│   │   └── Segment_Tree.cpp
│   └── Stack
│       ├── Max_Area_Rectangle_in_Binary_Matrix.cpp
│       ├── Maximum_Area_Histogram.cpp
│       ├── Min_Element_in_Stack_with_Extra_Space.cpp
│       ├── Minimum_Element_in_Stack_with_O(1)_Space.cpp
│       ├── Nearest_Greater_to_Left.cpp
│       ├── Nearest_Greater_to_Right.cpp
│       ├── Nearest_Smaller_to_Left.cpp
│       ├── Nearest_Smaller_to_Right.cpp
│       ├── Rain_Water_Trapping.cpp
│       └── Stock_Span.cpp
├── cses
│   ├── Apartments.cpp
│   ├── Apple_Divisons.cpp
│   ├── Bit_Strings.cpp
│   ├── Building_Roads.cpp
│   ├── Building_Teams.cpp
│   ├── Coin_Piles.cpp
│   ├── Concert_Tickets.cpp
│   ├── Counting_Divisors.cpp
│   ├── Counting_Rooms.cpp
│   ├── Creating_Strings.cpp
│   ├── Distinct_Numbers.cpp
│   ├── Dynamic_Range_Min_Queries.cpp
│   ├── Dynamic_Range_Sum_Query.cpp
│   ├── Exponentiation.cpp
│   ├── Ferris_Wheel.cpp
│   ├── Gray_Code.cpp
│   ├── Increasing_Array.cpp
│   ├── Labyrinth.cpp
│   ├── Message_Route.cpp
│   ├── MissingNumber.java
│   ├── Movie_Festival.cpp
│   ├── Number_Spiral.cpp
│   ├── NumberSpiral.java
│   ├── Palindrome_Reorder.cpp
│   ├── Permutations.cpp
│   ├── Permutations.java
│   ├── Range_Xor_Queries.cpp
│   ├── Repetitions.java
│   ├── Restaurant_Customers.cpp
│   ├── Round_Trip.cpp
│   ├── Static_Range_Minimum_Queries.cpp
│   ├── Static_Range_Sum_Queries.cpp
│   ├── Subordinates.cpp
│   ├── Tower_of_Hanoi.cpp
│   ├── Trailling_Zeros.cpp
│   ├── Tree_Diameter.cpp
│   ├── Two_Knights.cpp
│   ├── Two_Sets copy.cpp
│   ├── Two_Sets.cpp
│   └── WeirdAlgorithm.java
├── folder_structure.md
├── GFG
│   ├── BFS of graph.cpp
│   ├── Binomial_Coefficient.cpp
│   ├── Bit Difference.cpp
│   ├── Check for BST.cpp
│   ├── Checkmate.cpp
│   ├── Chocolate Distribution Problem.cpp
│   ├── Count Squares.cpp
│   ├── Count the Reversals .cpp
│   ├── Decode the string .cpp
│   ├── Dutch_Flag-Sort.cpp
│   ├── Edit Distance.cpp
│   ├── Find the median.cpp
│   ├── isbinarytreeheap.cpp
│   ├── Kadane's Algorithm.cpp
│   ├── Kth element in Matrix.cpp
│   ├── Largest Number formed from an Array.cpp
│   ├── Longest_Increasing_Subsequence.cpp
│   ├── Longest Palindrome in a String.cpp
│   ├── Longest Repeating Subsequence.cpp
│   ├── Lowest Common Ancestor in a Binary Tree.cpp
│   ├── Matrix_Spiral_Print.cpp
│   ├── Max_Area_Rectangle_in_2d_Binary_Matrix.cpp
│   ├── Maximum size rectangle in binary matrix.cpp
│   ├── Maximum sum of elements not part of LIS.cpp
│   ├── Median in a row-wise sorted Matrix.cpp
│   ├── Minimum element in BST.cpp
│   ├── Minimum swaps and K together.cpp
│   ├── minNumberOfJumps.cpp
│   ├── Next Permutation.cpp
│   ├── N meetings in one room.cpp
│   ├── Palindromic Array.cpp
│   ├── Parenthesis Checker.cpp
│   ├── Permutation_Coeff.cpp
│   ├── Predecessor and Successor.cpp
│   ├── Rat in a Maze Problem - I.cpp
│   ├── Reverse a linked list.cpp
│   ├── Smallest  Mapped String.cpp
│   ├── Smallest subarray with sum greater than x .cpp
│   ├── Stock span problem.cpp
│   ├── Three way partitioning.cpp
│   ├── Trapping Rain Water.cpp
│   ├── Triplet Sum in Array.cpp
│   ├── Value equal to index value.cpp
│   ├── Wave_Sort.cpp
│   └── Word Break.cpp
├── Guide to Competitive Programming_ Learning and Improving Algorithms Through Contests ( PDFDrive ).pd.pdf
├── HackerBlocks
│   ├── 2D Magical matrix.cpp
│   ├── Coding_Blocks_Ta.cpp
│   ├── Friend and Game.cpp
│   ├── Jumbles.cpp
│   ├── Match Tie.cpp
│   ├── Nikita_and_her_Boyfriend.cpp
│   ├── Nobita Scored Good Marks.cpp
│   ├── Pairs_on_Line.cpp
│   ├── Paul And Railway Track.cpp
│   ├── Rohan_and_Trump_Cards.cpp
│   ├── Single_in_Engineering_College.cpp
│   ├── Smart_Keypad_Advanced.cpp
│   └── Smart_Robber.cpp
├── HackerEarth
│   ├── April_Circuits_2020
│   │   ├── Changes_in_a_string.cpp
│   │   └── Cyclic_Shifts.cpp
│   ├── Binary numbers.cpp
│   ├── Codathon- NIT_Bhopal
│   │   ├── Day 1.cpp
│   │   └── Day 2.cpp
│   ├── CodeWarz_2.0
│   │   ├── Diamond.cpp
│   │   ├── Longest positive subsequence.cpp
│   │   └── XOR.cpp
│   ├── January_Circuits_2020
│   │   ├── Distribute chocolates.cpp
│   │   ├── equalSubarrays.cpp
│   │   └── Set numbers.cpp
│   ├── March_Circuits_2020
│   │   ├── Annoying Chemistry.cpp
│   │   ├── Dislikes and Party.cpp
│   │   └── Factorial_Equations.cpp
│   └── Monk_and_Rotation.cpp
├── HackerRank
│   └── OPC_Feb2020
│       ├── a.out
│       ├── cake
│       ├── cake.cpp
│       ├── house.cpp
│       ├── phy.cpp
│       ├── untitled
│       └── untitled.cpp
├── IncreasingArray.java
├── InterviewBit
│   ├── Allocate Books.cpp
│   ├── Array & Two Pointer
│   │   ├── Add One To Number.cpp
│   │   ├── Flip.cpp
│   │   ├── Kth Smallest Element in the Array.cpp
│   │   ├── Maximum Absolute Difference.cpp
│   │   ├── Maximum Sum Triplet.cpp
│   │   ├── Max Sum Contiguous Subarray.cpp
│   │   ├── Minimum Lights to Activate.cpp
│   │   ├── Min Steps in Infinite Grid.cpp
│   │   ├── NUMRANGE.cpp
│   │   └── Partitions.cpp
│   ├── Backtracking & Hashing
│   │   └── Longest Consecutive Sequence.cpp
│   ├── Binary Search
│   │   ├── Allocate_books.cpp
│   │   ├── Implement_power_function.cpp
│   │   ├── Matrix Search.cpp
│   │   ├── Painter's_partition_problem.cpp
│   │   ├── Search for a Range.cpp
│   │   ├── Smaller or equal elements.cpp
│   │   ├── Sorted Insert Position.cpp
│   │   ├── SquareRoot_of_integers.cpp
│   │   └── WoodCutting Made Easy!.cpp
│   ├── Bit Manipulation & Two Pointer
│   │   ├── Count Total Set Bits.cpp
│   │   ├── Divide Integers.java
│   │   ├── Min XOR Value.java
│   │   ├── Number of 1 Bits.cpp
│   │   ├── Reverse Bits.cpp
│   │   ├── Single Number.java
│   │   └── Trailing Zeroes.cpp
│   ├── Dynamic Programming
│   │   ├── Edit Distance.cpp
│   │   ├── Interleaving Strings.cpp
│   │   ├── Intersecting Chords in a Circle.cpp
│   │   ├── Largest area of rectangle with permutations.cpp
│   │   ├── Length of Longest Subsequence.cpp
│   │   ├── Longest Common Subsequence.cpp
│   │   ├── Longest Increasing Subsequence.cpp
│   │   ├── Longest Palindromic Subsequence.cpp
│   │   ├── Maximum Path in Triangle.java
│   │   ├── MaxProductSubarray.cpp
│   │   ├── Paint House!.cpp
│   │   ├── Regular Expression II.cpp
│   │   ├── Regular Expression Match.cpp
│   │   ├── Repeating Sub-Sequence.cpp
│   │   ├── RodCutting.cpp
│   │   ├── Scramble String.cpp
│   │   ├── ShortestCommonSubstring.cpp
│   │   ├── Smallest sequence with given Primes.cpp
│   │   ├── Stairs.cpp
│   │   ├── Ways_to_color_a_3NBoard.cpp
│   │   ├── Ways to Decode.cpp
│   │   └── Yet another string operation problem.cpp
│   ├── FizzBuzz.cpp
│   ├── Graph
│   │   ├── Black Shapes.cpp
│   │   ├── Capture Regions on Board.cpp
│   │   ├── Clone Graph.cpp
│   │   ├── Commutable Islands.cpp
│   │   ├── Convert Sorted List to Binary Search Tree.cpp
│   │   ├── Cycle in Directed Graph.cpp
│   │   ├── Cycle in Undirected Graph.cpp
│   │   ├── Delete Edge!.cpp
│   │   ├── Knight On Chess Board.cpp
│   │   ├── Largest Distance between nodes of a Tree.cpp
│   │   ├── Level Order.cpp
│   │   ├── Min Cost Path.cpp
│   │   ├── Permutation Swaps!.cpp
│   │   ├── Possibility of finishing all courses given pre-requisites.cpp
│   │   ├── Region in BinaryMatrix.cpp
│   │   ├── Smallest Multiple With 0 and 1.cpp
│   │   ├── Snake Ladder Problem!.cpp
│   │   ├── Stepping Numbers.cpp
│   │   ├── Sum Of Fibonacci Numbers.cpp
│   │   ├── Two teams.cpp
│   │   ├── Useful Extra Edges.cpp
│   │   ├── Valid Path.cpp
│   │   ├── Word Ladder I.cpp
│   │   ├── Word Ladder II.cpp
│   │   └── Word Search Board.cpp
│   ├── Hashing
│   │   ├── 2 Sum.java
│   │   ├── 4 Sum.java
│   │   ├── Colorful Number.java
│   │   └── Valid Sudoku.java
│   ├── Implement Power Function.cpp
│   ├── Is Rectangle.cpp
│   ├── Linked LIst, Stack & Queues
│   │   ├── Balanced Parantheses!.cpp
│   │   ├── Evaluate Expression.cpp
│   │   ├── First non-repeating character in a stream of characters.cpp
│   │   ├── Largest Rectangle in Histogram.cpp
│   │   ├── MAXSPPROD.cpp
│   │   ├── Merge Two Sorted Lists.cpp
│   │   ├── Min Stack.cpp
│   │   ├── Nearest Smaller Element.cpp
│   │   ├── NEXTGREATER.cpp
│   │   ├── Palindrome List.cpp
│   │   ├── Partition List.cpp
│   │   ├── Rain Water Trapped.cpp
│   │   ├── Redundant Braces.cpp
│   │   ├── Remove Duplicates from Sorted List.cpp
│   │   ├── Remove Duplicates from Sorted List II.cpp
│   │   ├── Remove Nth Node from List End.cpp
│   │   ├── Simplify Directory Path.cpp
│   │   ├── Sliding Window Maximum.cpp
│   │   ├── Sort Binary Linked List.cpp
│   │   └── SUBTRACT.cpp
│   ├── Math
│   │   ├── All Factors.cpp
│   │   ├── Binary Representation.cpp
│   │   ├── Distribute in Circle!.cpp
│   │   ├── MATH_BUG02.cpp
│   │   ├── Next Similar Number.cpp
│   │   ├── Palindrome Integer.cpp
│   │   ├── Prime Numbers.cpp
│   │   ├── Prime Sum.cpp
│   │   ├── Total Moves For Bishop!.cpp
│   │   └── Verify Prime.cpp
│   ├── Median of Array.cpp
│   ├── Painter's Partition Problem.cpp
│   ├── Power Of Two Integers.cpp
│   ├── PRETTYPRINT.cpp
│   ├── Prime Sum.cpp
│   ├── Rotated Sorted Array Search.cpp
│   ├── Square Root of Integer.cpp
│   ├── String
│   │   ├── Amazing Subarrays.cpp
│   │   ├── Count And Say.cpp
│   │   ├── Implement StrStr.cpp
│   │   ├── Longest Common Prefix.cpp
│   │   ├── Palindrome String.cpp
│   │   ├── Remove Consecutive Characters.cpp
│   │   ├── Valid Number.cpp
│   │   ├── Vowel and Consonant Substrings!.cpp
│   │   └── Zigzag String.cpp
│   ├── Sum of pairwise Hamming Distance.cpp
│   └── Water Flow.cpp
├── Interviewbit Codedrift
│   └── Graph
│       ├── a.out
│       └── kingdom_of_friendship.cpp
├── Interview Questions
│   ├── adobe_specail_num.cpp
│   ├── Amazon_Practice
│   ├── a.out
│   ├── deutsche_bank_1.cpp
│   ├── deutsche_bank_2.cpp
│   ├── flipkart-2.cpp
│   ├── google_special_matrix.cpp
│   ├── gs_3.cpp
│   ├── gs.cpp
│   ├── Hacker Blocks
│   │   ├── anmol_and_good_subbarray.cpp
│   │   ├── a.out
│   │   ├── count_subsequences.cpp
│   │   ├── fernandes_path.cpp
│   │   ├── flipkart-2.cpp
│   │   ├── friend_and_game.cpp
│   │   ├── microsoft_save_dolby.cpp
│   │   ├── nikita_and_her_boyfriend.cpp
│   │   ├── pairs_on_line.cpp
│   │   ├── smart_robber.cpp
│   │   ├── sum_it_up.cpp
│   │   ├── test.cpp
│   │   ├── test.py
│   │   └── tranform_favourite_string.cpp
│   ├── JusPay
│   │   ├── 1.cpp
│   │   ├── 2.cpp
│   │   ├── 3.cpp
│   │   └── a.out
│   ├── Nutanix
│   │   ├── a.out
│   │   └── sit_eat_go.cpp
│   ├── salesforce-2.2.cpp
│   ├── salesforce-2.3.cpp
│   ├── salesforce-2.cpp
│   ├── salesforce-3.cpp
│   ├── test1.cpp
│   ├── test2.cpp
│   ├── test3.cpp
│   ├── test.cpp
│   └── uber_equal_disconnected_segments.cpp
├── LeetCode
│   ├── 1011. Capacity To Ship Packages Within D Days.cpp
│   ├── 1108. Defanging an IP Address.cpp
│   ├── 1235. Maximum Profit in Job Scheduling.cpp
│   ├── 124. Binary Tree Maximum Path Sum.cpp
│   ├── 1266. Minimum Time Visiting All Points.cpp
│   ├── 126. Word Ladder II.cpp
│   ├── 127. Word Ladder.cpp
│   ├── 128. Longest Consecutive Sequence.cpp
│   ├── 1342. Number of Steps to Reduce a Number to Zero.cpp
│   ├── 138. Copy List with Random Pointer.cpp
│   ├── 1395. Count Number of Teams.cpp
│   ├── 1431. Kids With the Greatest Number of Candies.cpp
│   ├── 1470. Do Shuffle the Array.cpp
│   ├── 150. Evaluate Reverse Polish Notation.cpp
│   ├── 1512. Number of Good Pairs.cpp
│   ├── 1631. Path With Minimum Effort.cpp
│   ├── 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers.cpp
│   ├── 1727. Largest Submatrix With Rearrangements.cpp
│   ├── 174. Dungeon Game.cpp
│   ├── 1759. Count Number of Homogenous Substrings.cpp
│   ├── 17. Letter Combinations of a Phone Number.cpp
│   ├── 18. 4Sum.cpp
│   ├── 1860.IncrementalMemoryLeak.cpp
│   ├── 1889. Minimum Space Wasted From Packaging.cpp
│   ├── 1.Matrix.cpp
│   ├── 225. Implement Stack using Queues.cpp
│   ├── 232. Implement Queue using Stacks.cpp
│   ├── 23. Merge k Sorted Lists.cpp
│   ├── 24. Swap Nodes in Pairs.cpp
│   ├── 258. Add Digits.cpp
│   ├── 25. Reverse Nodes in k-Group.cpp
│   ├── 2. Add Two Numbers.cpp
│   ├── 318. Maximum Product of Word Lengths.cpp
│   ├── 354. Russian Doll Envelopes.cpp
│   ├── 374. Guess Number Higher or Lower.java
│   ├── 37. Sudoku Solver.cpp
│   ├── 38. Count and Say.cpp
│   ├── 413 ARITHEMATIC SLICES
│   ├── 415. Add Strings.cpp
│   ├── 435. NON OVERLAPPING SOLUTIONS
│   ├── 437. Path Sum III.cpp
│   ├── 445. Add Two Numbers II.cpp
│   ├── 448. Find All Numbers Disappeared in an Array.cpp
│   ├── 450. Delete Node in a BST.cpp
│   ├── 454. 4Sum II.cpp
│   ├── 456. 132 Pattern.cpp
│   ├── 459. Repeated Substring Pattern.cpp
│   ├── 48. Rotate Image.cpp
│   ├── 4. Median of Two Sorted Arrays.cpp
│   ├── 51. N-Queens.cpp
│   ├── 52. N-Queens II.cpp
│   ├── 547. Number of Provinces.cpp
│   ├── 565. Array Nesting.cpp
│   ├── 62 Unique paths
│   ├── 679. 24 Game.cpp
│   ├── 69. Sqrt(x).cpp
│   ├── 709. To Lower Case.cpp
│   ├── 717. 1-bit and 2-bit Characters.cpp
│   ├── 718. Maximum Length of Repeated Subarray.cpp
│   ├── 71. Simplify Path.cpp
│   ├── 729. My Calendar I.cpp
│   ├── 740. Delete and Earn.cpp
│   ├── 771. Jewels and Stones.cpp
│   ├── 792. Number of Matching Subsequences.cpp
│   ├── 79. Word Search.cpp
│   ├── 804. Unique Morse Code Words.cpp
│   ├── 82. Remove Duplicates from Sorted List II.cpp
│   ├── 848. Shifting Letters.cpp
│   ├── 875. Koko Eating Bananas.cpp
│   ├── 876. Middle of the Linked List.cpp
│   ├── 922. Sort Array By Parity II.cpp
│   ├── 923. 3Sum With Multiplicity.cpp
│   ├── 92. Reverse Linked List II.cpp
│   ├── 96. Unique Binary Search Trees.cpp
│   ├── 970. Powerful Integers.cpp
│   ├── 97. Interleaving String.cpp
│   ├── 987. Vertical Order Traversal of a Binary Tree.cpp
│   ├── 989. Add to Array-Form of Integer.cpp
│   ├── 98. Validate Binary Search Tree.cpp
│   ├── Asteroid-Collision.java
│   ├── Best-Time-to-Buy-and-Sell-Stock.java
│   ├── Binary-Tree-Right-Side-View.java
│   ├── Biweekly Contest 56
│   │   ├── 5793. Nearest Exit from Entrance in Maze.cpp
│   │   └── 5794. Sum Game.cpp
│   ├── Biweekly Contest 57
│   │   ├── 1941. Check if All Characters Have Equal Number of Occurrences.cpp
│   │   ├── 1942. The Number of the Smallest Unoccupied Chair.cpp
│   │   ├── 1943. Describe the Painting.cpp
│   │   └── 1944. Number of Visible People in a Queue.cpp
│   ├── Biweekly Contest 59
│   │   ├── 1974. Minimum Time to Type Word Using Special Typewriter.cpp
│   │   ├── 1975. Maximum Matrix Sum.cpp
│   │   └── 1976. Number of Ways to Arrive at Destination.cpp
│   ├── Can-Place-Flowers.java
│   ├── Consecutive Numbers Sum.cpp
│   ├── Container-With-Most-Water.java
│   ├── Count-Good-Nodes-in-Binary-Tree.java
│   ├── Count Sorted Vowel Strings.cpp
│   ├── Decode-String.java
│   ├── Delete-Node-in-a-BST.java
│   ├── Delete-the-Middle-Node-of-a-Linked-List.java
│   ├── Determine-if-Two-Strings-Are-Close.java
│   ├── Dota2-Senate.java
│   ├── Equal-Row-and-Column-Pairs.java
│   ├── Erect the Fence.cpp
│   ├── Find-Peak-Element.java
│   ├── Find-Pivot-Index.java
│   ├── Find-the-Difference-of-Two-Arrays.java
│   ├── Find-the-Duplicate-Number.java
│   ├── Find-the-Highest-Altitude.java
│   ├── Get Maximum in Generated Array.cpp
│   ├── Greatest-Common-Divisor-of-Strings.java
│   ├── Guess-Number-Higher-or-Lower.java
│   ├── Happy-Number.java
│   ├── Increasing-Triplet-Subsequence.java
│   ├── Isomorphic Strings.cpp
│   ├── Is-Subsequence.java
│   ├── Keys-and-Rooms.java
│   ├── Kids-With-the-Greatest-Number-of-Candies.java
│   ├── Koko-Eating-Bananas.java
│   ├── Kth Largest Element in an Array.cpp
│   ├── Kth-Largest-Element-in-an-Array.java
│   ├── Leaf-Similar-Trees.java
│   ├── Longest-Common-Prefix.java
│   ├── Longest-Common-Subsequence.java
│   ├── Longest Increasing Subsequence.cpp
│   ├── Longest_Increasing_Subsequence.cpp
│   ├── Longest-Increasing-Subsequence.java
│   ├── Longest-Palindromic-Substring.java
│   ├── Longest-Subarray-of-1's-After-Deleting-One-Element.java
│   ├── Longest-ZigZag-Path-in-a-Binary-Tree.java
│   ├── Lowest-Common-Ancestor-of-a-Binary-Tree.java
│   ├── Majority-Element-II.java
│   ├── Majority-Element.java
│   ├── Map Sum Pairs.cpp
│   ├── Max_Area_Rectangle_in_2d_Binary_Matrix.cpp
│   ├── Max-Consecutive-Ones-III.java
│   ├── Maximum-Average-Subarray-I.java
│   ├── Maximum-Depth-of-Binary-Tree.java
│   ├── Maximum-Number-of-Vowels-in-a-Substring-of-Given-Length.java
│   ├── Maximum-Subarray.java
│   ├── Maximum-Subsequence-Score.java
│   ├── Maximum-Twin-Sum-of-a-Linked-List.java
│   ├── Max-Number-of-K-Sum-Pairs.java
│   ├── Merge-Intervals.java
│   ├── Merge-Sorted-Array.java
│   ├── Merge-Strings-Alternately.java
│   ├── Merge-Two-Sorted-Lists.java
│   ├── Middle-of-the-Linked-List.java
│   ├── Minimum Window Substring.cpp
│   ├── Move-Zeroes.java
│   ├── Nearest-Exit-from-Entrance-in-Maze.java
│   ├── Number-of-Provinces.java
│   ├── Number-of-Recent-Calls.java
│   ├── Odd-Even-Linked-List.java
│   ├── Pascal's-Triangle.java
│   ├── Path-Sum-III.java
│   ├── Pow(x,-n).java
│   ├── Product-of-Array-Except-Self.java
│   ├── Remove-K-Digits.java
│   ├── Remove-Nth-Node-From-End-of-List.java
│   ├── Removing-Stars-From-a-String.java
│   ├── Reorder-Routes-to-Make-All-Paths-Lead-to-the-City-Zero.java
│   ├── Reverse-Linked-List.java
│   ├── Reverse-Vowels-of-a-String.java
│   ├── Reverse-Words-in-a-String.java
│   ├── Roman-to-Integer.java
│   ├── Rotate-Function.java
│   ├── Rotate-Image.java
│   ├── RottenOranges.cpp
│   ├── Rotting-Oranges.java
│   ├── Search-a-2D-Matrix.java
│   ├── Search-in-a-Binary-Search-Tree.java
│   ├── Set-Matrix-Zeroes.java
│   ├── Smallest-Number-in-Infinite-Set.java
│   ├── Sort-Colors.java
│   ├── String-Compression.java
│   ├── Subsets.java
│   ├── Successful-Pairs-of-Spells-and-Potions.java
│   ├── Total-Cost-to-Hire-K-Workers.java
│   ├── Trapping Rain Water.cpp
│   ├── Two-Sum.java
│   ├── Unique-Number-of-Occurrences.java
│   ├── Weekly Contest 248
│   │   ├── 5800. Build Array from Permutation.cpp
│   │   ├── 5801. Eliminate Maximum Number of Monsters.cpp
│   │   └── 5802. Count Good Numbers.cpp
│   ├── Weekly Contest 249
│   │   ├── 5808. Concatenation of Array.cpp
│   │   └── 5809. Unique Length-3 Palindromic Subsequences.cpp
│   ├── Weekly Contest 250
│   │   ├── 1935. Maximum Number of Words You Can Type.cpp
│   │   ├── 1936. Add Minimum Number of Rungs.cpp
│   │   └── 1938. Maximum Genetic Difference Query.cpp
│   ├── Weekly Contest 251
│   │   ├── 1945. Sum of Digits of String After Convert.cpp
│   │   ├── 1946. Largest Number After Mutating Substring.cpp
│   │   └── 1947. Maximum Compatibility Score Sum.cpp
│   └── Weekly Contest 255
│       ├── 1979. Find Greatest Common Divisor of Array.cpp
│       ├── 1980. Find Unique Binary String.cpp
│       └── 1981. Minimize the Difference Between Target and Chosen Elements.cpp
├── Main_Template.cpp
├── min_main.cpp
├── most used algorithms on vectors.txt
├── Other
│   ├── Bubble_Sort.c
│   ├── class_Trie.cpp
│   ├── Detect_Loop_in_Linked_List.cpp
│   ├── Factorial_of_Large_Number.cpp
│   ├── Implement Disjoint Set.cpp
│   ├── Implementing addition and subtraction of two polynomial using linked list.c
│   ├── Implementing calculation of frequency of elements in order of appearance.c
│   ├── Implementing circular queue using array.c
│   ├── Implementing deletion of nodes if higher value is in right .c
│   ├── Implementing DQUE using a one-dimensional array.c
│   ├── Implementing insertion sort on linked list and reversing.c
│   ├── Implementing linear queue using array.c
│   ├── Implementing linear queue using linked list.c
│   ├── Implementing linked list with insertion and deletion.c
│   ├── Implementing operations on queue.c
│   ├── Implementing pre-order, in-order, post-order traversal of a binary tree.c
│   ├── Implementing priority queue using two dimensional array.c
│   ├── Implementing reversing of first k elements of a queue.c
│   ├── Implementing two stacks on a single array.c
│   ├── Insertion_Sort.c
│   ├── Invest_Wisely.cpp
│   ├── Matrix_Spiral_Traversal.cpp
│   ├── Merge_Sort.c
│   ├── Primality Test.cpp
│   ├── Quick_Sort.c
│   ├── Selection_Sort.c
│   ├── Shell_Sort.c
│   ├── Staircase.cpp
│   ├── Subtract Number Represented in Linked List.cpp
│   ├── The_Lazy_Jumper.cpp
│   ├── working_Inorder.cpp
│   ├── working_Postorder.cpp
│   └── working_Preorder.cpp
├── output.md
├── Project_Euler
│   ├── Even_fibonacci_numbers.cpp
│   ├── Largest_palindrome_project.cpp
│   ├── Largest_prime_factor.cpp
│   ├── Multiples_of_3_and_5.cpp
│   └── tempCodeRunnerFile.cpp
├── push.sh
├── Python Competitive Program
│   ├── 11.py
│   ├── 1. armstrong_number.py
│   ├── 2nd max. value in dictionary.py
│   ├── 3-2-1-1-2-3 type pattern.py
│   ├── aaaa.py
│   ├── Ackerman function.py
│   ├── ALGO.py
│   ├── Assignment 2.pdf
│   ├── Assignment3.pdf
│   ├── Assignments.txt.py
│   ├── bmi_cal.py
│   ├── check fibonacci number or not.py
│   ├── check if array is sorted & rotated.py
│   ├── convert_capital to small.py
│   ├── cost, selling price profit.py
│   ├── count occurance in tuple.py
│   ├── day 0 hacker.py
│   ├── email_app.py
│   ├── email.py
│   ├── even in ascending , odd in descending.py
│   ├── even,odd,prime,palindrme,armstrong.py
│   ├── factorial.py
│   ├── fibonacci series.py
│   ├── File_base_record _system.py
│   ├── fizzbuzz.py
│   ├── gretest element in right.py
│   ├── gretest_no.py
│   ├── guess_ravi.py
│   ├── highest product possible by  3.py
│   ├── ifelse.py
│   ├── input of name branch gender college.py
│   ├── insertion of two python list.py
│   ├── interview 6d-12.py
│   ├── interview 6d-13.py
│   ├── interview 6d-14.py
│   ├── interview 6d-15.py
│   ├── jumping ball.py
│   ├── Knapsack problem.py
│   ├── kth smallest element.py
│   ├── leap year.py
│   ├── lexicographically in election.py
│   ├── like palindrome string.py
│   ├── LIST.py
│   ├── login_system.py
│   ├── LOOP.py
│   ├── m1.py
│   ├── merge k sorted list.py
│   ├── mini-project jarvis.py
│   ├── mini-project-mic.py
│   ├── mini-project-speech.py
│   ├── mini-project-testing-code.py
│   ├── mishra_pad.py
│   ├── mysql_1.py
│   ├── no allowed repetition of character.py
│   ├── pattern.py
│   ├── permutATION IN STRING.py
│   ├── p.py
│   ├── project.html
│   ├── remove duplicate charcter in string.py
│   ├── remove duplicate in list.py
│   ├── remove duplicate value from dictionary value.py
│   ├── replace all 0 with 5.py
│   ├── reverse string.py
│   ├── ridecost_cal.py
│   ├── run score type.py
│   ├── salary2.py
│   ├── salary.py
│   ├── smallest +number missing from unsorted list.py
│   ├── solution d3-6.py
│   ├── sort a list of 0 & 1 in non decreasing.py
│   ├── sort tuple list.py
│   ├── square root.py
│   ├── stolen value from house.py
│   ├── string in alphabetical.py
│   ├── student_database_copy.py
│   ├── student data copy2.py
│   ├── Student_Management_database.py
│   ├── swap 2 variable.py
│   ├── swapcase.py
│   ├── temparature.py
│   ├── trangle check.py
│   ├── traverse  print matrix in spiral form.py
│   ├── upcoming next greatest number.py
│   ├── wrap_4_digit.py
│   ├── wrap nstring.py
│   └── X type pattern.py
├── README.md
├── SPOJ
│   ├── AGGRCOW.cpp
│   ├── NAKANJ-Minimum_Knight_Moves-SPOJ.cpp
│   └── PON.cpp
├── Summation of matrix diagonally.cpp
├── Template.txt
├── to find critical edges in a graph.cpp
├── To get sum of all subsets.txt
└── valarrays.txt