├── 450 ├── Ajinkya │ ├── Find Duplicate.cpp │ ├── Min Jumps to reach end of array.cpp │ ├── Minimize the maximum difference.cpp │ ├── Power using array.cpp │ └── knapsack 01.cpp ├── Captain │ ├── Array │ │ ├── 1ReverseTheArray.cpp │ │ ├── 2Find the maximum and minimum element in an array.cpp │ │ ├── 4Given an array which consists of only 0, 1 and 2. Sort the array without using any sorting algo.cpp │ │ └── Move all the negative elements to one side of the array .cpp │ └── Captain.txt ├── Chirag │ └── 450 Questions ├── FINAL450.xlsx ├── Kajal │ ├── reverse a linked list │ └── reverse a string ├── Nagendra │ ├── BST │ │ ├── Delete Node in a BST.py │ │ ├── Fina a value in a BST.py │ │ └── Minimum element in BST.py │ ├── Dynamic │ │ ├── 0 - 1 Knapsack Problem.py │ │ ├── BF Negative weight cycle.py │ │ ├── Longest Common Subsequence.py │ │ └── matric chain mult.py │ ├── String │ │ ├── Count and Say problem.py │ │ ├── Palindrome String.py │ │ ├── Reverse String.py │ │ └── next greater number .py │ ├── array │ │ ├── Array Subset of another array .py │ │ ├── Best Time to Buy and Sell Stock.py │ │ ├── Chocolate Distribution problem.py │ │ ├── Common elements .py │ │ ├── Count pairs with given sum .py │ │ ├── Cyclically rotate an array by one.py │ │ ├── Factorials of large numbers .py │ │ ├── Find the Duplicate Number.py │ │ ├── Find the maximum and minimum element in an array.py │ │ ├── Find the median .py │ │ ├── Inversion of array .py │ │ ├── Kth smallest element.py │ │ ├── Largest Sum Contiguous Subarray.py │ │ ├── Max Sum Subarray of size K .py │ │ ├── Maximum Product Subarray .py │ │ ├── Merge Without Extra Space.py │ │ ├── Move all negative numbers to beginning and positive to end with constant extra space.py │ │ ├── Palindromic Array .py │ │ ├── Row with max 1s.py │ │ ├── Smallest subarray with sum greater than x .py │ │ ├── Sort an array of 0s, 1s and 2s.py │ │ ├── Subarray with 0 sum .py │ │ ├── Three way partitioning .py │ │ ├── Triplet Sum in Array .py │ │ ├── Union of two arrays.py │ │ ├── merge intervals.py │ │ └── reverse arry.py │ ├── greedy │ │ ├── Activity Selection Problem.py │ │ ├── Chocolate Distribution Problem .py │ │ ├── Coin Piles .py │ │ ├── DEFKIN - Defense of a Kingdom.py │ │ ├── Find smallest number with given number of digits and sum of digits.py │ │ ├── Fractional Knapsack.py │ │ ├── Huffman Encoding .py │ │ ├── Job Sequencing Problem .py │ │ ├── Maximize sum after K negations .py │ │ ├── Maximize sum(arr[i]i) of an Array .py │ │ ├── Minimum Cost of ropes .py │ │ ├── Minimum Platforms .py │ │ ├── Rearrange characters .py │ │ ├── Shop in Candy Store .py │ │ └── Swap and Maximize .py │ ├── matrix │ │ └── Search ele 2D Matrix.py │ └── searching & sorting │ │ ├── Count Squares.py │ │ ├── Find the repeating and the missing.py │ │ ├── First and last occurrences of X.py │ │ ├── Maximum and minimum of an array using minimum number of comparisons.py │ │ ├── Search in Rotated Sorted Array.py │ │ ├── Value equal to index value.py │ │ └── find majority element.py ├── Nayana_Bhoj │ ├── MaximumMinimumInArray.java │ ├── Nayana_Bhoj │ └── ReverseAnArray.java ├── Neeraj │ ├── 012s.py │ ├── Reverse a String.py │ ├── duplicate in array of n+1 integers.py │ ├── negtive right and positive left.py │ ├── nerj.txt │ ├── recursive reverse a string.py │ └── subarray with zero sum.py ├── README.md ├── Rahul │ ├── Array │ │ └── reverseArray.cpp │ └── String │ │ └── reverseString.cpp ├── Ratndeep │ ├── Array │ │ ├── Array1-reversearray-Q1.py │ │ ├── Array2-middleofthreeelements-Q2.py │ │ ├── Cyclically rotate an array by one.py │ │ ├── find duplication in O(n).py │ │ ├── kadane.py │ │ ├── kth smallest.py │ │ ├── merge two list without extra space.py │ │ ├── middle of three.py │ │ ├── min jump to reach end.py │ │ ├── minimize the height.py │ │ ├── negativeleftpositiveright.py │ │ ├── sort012.py │ │ └── union&intersection.py │ ├── Binary Search Tree │ │ ├── delete node.py │ │ ├── insert new node.py │ │ └── smallest value.py │ ├── Binary Tree │ │ ├── BT-1 Level Order Traversal.py │ │ ├── Reverse level order.py │ │ ├── bottom view.py │ │ ├── boundary view.py │ │ ├── diagonal traversal.py │ │ ├── diameter of bt.py │ │ ├── height of bt.py │ │ ├── inorder recursive&iterative.py │ │ ├── left view.py │ │ ├── mirrortree.py │ │ ├── postorder.py │ │ ├── preorder traversal.py │ │ ├── right view.py │ │ ├── subtree.py │ │ ├── top view.py │ │ ├── transform to sum tree.py │ │ └── zigzag.py │ ├── Optimal Only │ │ └── pascal.py │ ├── String │ │ ├── String1-Reverse_string-Q1.py │ │ ├── String2-Palindrome-Q2.py │ │ ├── check)two_strings are same rotated.py │ │ ├── countandsay.py │ │ ├── immutable.py │ │ ├── longestcommonsubsequence.py │ │ ├── longestcommonsubsequenceoptimal.py │ │ ├── longestpalindromestring.py │ │ ├── longestpalindromestringmem.py │ │ ├── longestpalindromicsustringtabular.py │ │ ├── longestpanidromesubstringlinear.py │ │ ├── printduplicatesonly.py │ │ └── shuffle.py │ ├── backtracking │ │ ├── nqueen.py │ │ └── rat in maze.py │ ├── dynamic programming │ │ ├── 0-1knapsack.py │ │ ├── coin change problem.py │ │ ├── levenshtein disatance.py │ │ ├── longest repeating subsequence.py │ │ ├── matrix-chain-multiplication.py │ │ ├── nCr.py │ │ ├── nPr.py │ │ ├── nth catalan.py │ │ ├── watching cpl.py │ │ └── word break.py │ ├── graph │ │ ├── DFS.py │ │ ├── bfs.py │ │ ├── detect cycle in directed graph.py │ │ ├── detect cycle in undirected graph.py │ │ └── implementation.py │ ├── greedy │ │ ├── huffman encoding.py │ │ ├── job sequencing.py │ │ └── n meeting room.py │ ├── linkedlist.py │ │ ├── add 1 to number representated in linkedlist.py │ │ ├── add two numbers representated in linkedlist.py │ │ ├── detectloop.py │ │ ├── intersection of two linkedlist.py │ │ ├── make last node as head.py │ │ ├── remove duplicate element from unsorted linkedlist.py │ │ ├── remove duplicate from sorted ll.py │ │ ├── removeloop.py │ │ ├── reverse.py │ │ ├── reverseks.py │ │ └── starting node of loop.py │ ├── matrix │ │ ├── row with max1's.py │ │ ├── searching in sortedmatrix.py │ │ ├── sorting a sortedmatrix.py │ │ └── spiral traversal.py │ ├── recursion │ │ ├── climbing stairs.py │ │ ├── pascal.py │ │ ├── permutation of string.py │ │ ├── reverse linkedlist.py │ │ └── reverse string.py │ ├── searching&sorting │ │ ├── countsquares.py │ │ ├── first-lastoccurance using binarysearch.py │ │ ├── missing and repeating.py │ │ ├── seach in rotated array.py │ │ └── value_equal_to_index_value.py │ └── stack │ │ ├── max size rectaingle in matrix.py │ │ └── maximum rectaingle in histogram.py ├── Tarun │ ├── Array │ │ ├── 1 Reverse a array.py │ │ ├── 2 find minimum and mzximum element in array.py │ │ ├── 3 Find Kth smallest element in O(N).py │ │ ├── 5 Move all negative numbers to beginning and positive to end.py │ │ ├── 7 Largest sum subarray.py │ │ └── 9 Minimum no of the jump to rach in the end.py │ └── String │ │ ├── Count and Say.py │ │ ├── Reverse String without extra space.py │ │ └── check if strings are rotations of each other or not.py ├── Utkarsh │ ├── DP │ │ ├── editDistanceStrings.cpp │ │ ├── longestCommonSubsequence.cpp │ │ └── longestRepeatingSubsequence.cpp │ ├── array │ │ ├── findDuplicate.cpp │ │ ├── findMissingAndRepeating.cpp │ │ ├── firstAndLastX.cpp │ │ ├── maxAreaRectangle.cpp │ │ ├── mergeTwoSortedArrays.cpp │ │ ├── middleOfThree.cpp │ │ ├── nMeetingInARoom.cpp │ │ ├── negativeToLeftSide.cpp │ │ ├── powerFucntion.cpp │ │ └── spiralTraversalMatrix.cpp │ ├── backtracking │ │ └── nQueenChess.cpp │ ├── binaryTree │ │ ├── diameterOfBST.cpp │ │ ├── heightOfBST.cpp │ │ ├── insertionBST.cpp │ │ ├── levelOrderBFS.cpp │ │ ├── minimumInBST.cpp │ │ ├── postorderTraversal.cpp │ │ ├── preorderTraversal.cpp │ │ └── reverseLevelorder.cpp │ ├── greedy │ │ └── permutationCoefficient.cpp │ ├── linkedList │ │ ├── add1ToLinkedList.cpp │ │ ├── add2Nums.cpp │ │ ├── intersectionOfSortedList.cpp │ │ ├── moveLastElementToFront.cpp │ │ └── reverseLinkedList.cpp │ ├── searching-sorting │ │ ├── Search2Dmatrix.cpp │ │ ├── kth-smallest-element_in_unsorted_array.cpp │ │ ├── printSortedMatrix.cpp │ │ └── sort012.cpp │ └── string │ │ ├── check_if_string_rotations_of_each_other.cpp │ │ ├── countAndSay.cpp │ │ ├── duplicatesInString.cpp │ │ ├── palindrome_string.cpp │ │ ├── printSubsequence.cpp │ │ ├── reverse_string.cpp │ │ └── validShuffle.cpp └── reverse.py ├── (Coursera) Data Structures and Algorithms Specialization └── Nagendra │ ├── Algorithmic Toolbox │ ├── week1_programming_challenges │ │ ├── 1_sum_of_two_digits │ │ │ ├── APlusB.cpp │ │ │ ├── APlusB.cs │ │ │ ├── APlusB.hs │ │ │ ├── APlusB.java │ │ │ ├── APlusB.js │ │ │ ├── APlusB.kt │ │ │ ├── APlusB.py │ │ │ ├── APlusB.rb │ │ │ ├── APlusB.rs │ │ │ └── APlusB.scala │ │ ├── 2_maximum_pairwise_product │ │ │ ├── MaxPairwiseProduct.java │ │ │ ├── MaxPairwiseProduct.kt │ │ │ ├── max_pairwise_product.cpp │ │ │ ├── max_pairwise_product.js │ │ │ ├── max_pairwise_product.py │ │ │ └── max_pairwise_product.rb │ │ └── week1_programming_challenges.pdf │ ├── week2_algorithmic_warmup │ │ ├── 1_fibonacci_number │ │ │ ├── Fibonacci.java │ │ │ ├── Fibonacci.kt │ │ │ ├── fibonacci.cpp │ │ │ ├── fibonacci.hs │ │ │ ├── fibonacci.js │ │ │ ├── fibonacci.py │ │ │ └── fibonacci.rb │ │ ├── 2_last_digit_of_fibonacci_number │ │ │ ├── FibonacciLastDigit.java │ │ │ ├── FibonacciLastDigit.kt │ │ │ ├── fibonacci_last_digit.cpp │ │ │ ├── fibonacci_last_digit.hs │ │ │ ├── fibonacci_last_digit.js │ │ │ ├── fibonacci_last_digit.py │ │ │ └── fibonacci_last_digit.rb │ │ ├── 3_greatest_common_divisor │ │ │ ├── GCD.java │ │ │ ├── GCD.kt │ │ │ ├── gcd.cpp │ │ │ ├── gcd.hs │ │ │ ├── gcd.js │ │ │ ├── gcd.py │ │ │ └── gcd.rb │ │ ├── 4_least_common_multiple │ │ │ ├── LCM.java │ │ │ ├── LCM.kt │ │ │ ├── by_learners │ │ │ │ └── lcm.rb │ │ │ ├── lcm.cpp │ │ │ ├── lcm.hs │ │ │ └── lcm.py │ │ ├── 5_fibonacci_number_again │ │ │ ├── FibonacciHuge.java │ │ │ ├── FibonacciHuge.kt │ │ │ ├── fibonacci_huge.cpp │ │ │ ├── fibonacci_huge.hs │ │ │ ├── fibonacci_huge.js │ │ │ ├── fibonacci_huge.py │ │ │ └── fibonacci_huge.rb │ │ ├── 6_last_digit_of_the_sum_of_fibonacci_numbers │ │ │ ├── FibonacciSumLastDigit.java │ │ │ ├── FibonacciSumLastDigit.kt │ │ │ ├── by_learners │ │ │ │ └── fibonacci_sum_last_digit.rb │ │ │ ├── fibonacci_sum_last_digit.cpp │ │ │ ├── fibonacci_sum_last_digit.hs │ │ │ └── fibonacci_sum_last_digit.py │ │ ├── 7_last_digit_of_the_sum_of_fibonacci_numbers_again │ │ │ ├── FibonacciPartialSum.java │ │ │ ├── FibonacciPartialSum.kt │ │ │ ├── by_learners │ │ │ │ └── fib_partial_sum.rb │ │ │ ├── fibonacci_partial_sum.cpp │ │ │ ├── fibonacci_partial_sum.hs │ │ │ └── fibonacci_partial_sum.py │ │ ├── 8_last_digit_of_the_sum_of_squares_of_fibonacci_numbers │ │ │ ├── FibonacciSumSquares.java │ │ │ ├── fibonacci_sum_squares.cpp │ │ │ └── fibonacci_sum_squares.py │ │ └── week2_algorithmic_warmup.pdf │ ├── week3_greedy_algorithms │ │ ├── 1_money_change │ │ │ ├── Change.java │ │ │ ├── Change.kt │ │ │ ├── by_learners │ │ │ │ └── change.rb │ │ │ ├── change.cpp │ │ │ ├── change.hs │ │ │ └── change.py │ │ ├── 2_maximum_value_of_the_loot │ │ │ ├── FractionalKnapsack.java │ │ │ ├── FractionalKnapsack.kt │ │ │ ├── fractional_knapsack.cpp │ │ │ ├── fractional_knapsack.hs │ │ │ ├── fractional_knapsack.js │ │ │ ├── fractional_knapsack.py │ │ │ └── fractional_knapsack.rb │ │ ├── 3_car_fueling │ │ │ ├── CarFueling.java │ │ │ ├── car_fueling.cpp │ │ │ └── car_fueling.py │ │ ├── 4_maximum_advertisement_revenue │ │ │ ├── DotProduct.java │ │ │ ├── DotProduct.kt │ │ │ ├── by_learners │ │ │ │ └── dot_rpoduct.rb │ │ │ ├── dot_product.cpp │ │ │ ├── dot_product.hs │ │ │ └── dot_product.py │ │ ├── 5_collecting_signatures │ │ │ ├── CoveringSegments.java │ │ │ ├── CoveringSegments.kt │ │ │ ├── by_learners │ │ │ │ └── covering_segments.rb │ │ │ ├── covering_segments.cpp │ │ │ ├── covering_segments.hs │ │ │ └── covering_segments.py │ │ ├── 6_maximum_number_of_prizes │ │ │ ├── DifferentSummands.java │ │ │ ├── DifferentSummands.kt │ │ │ ├── by_learners │ │ │ │ └── different_summands.rb │ │ │ ├── different_summands.cpp │ │ │ ├── different_summands.hs │ │ │ └── different_summands.py │ │ ├── 7_maximum_salary │ │ │ ├── LargestNumber.java │ │ │ ├── LargestNumber.kt │ │ │ ├── by_learners │ │ │ │ └── largest_number.rb │ │ │ ├── largest_number.cpp │ │ │ ├── largest_number.hs │ │ │ └── largest_number.py │ │ └── week3_greedy_algorithms.pdf │ ├── week4_divide_and_conquer │ │ ├── 1_binary_search │ │ │ ├── .DS_Store │ │ │ ├── BinarySearch.java │ │ │ ├── BinarySearch.kt │ │ │ ├── binary_search.cpp │ │ │ ├── binary_search.js │ │ │ ├── binary_search.py │ │ │ └── binary_search.rb │ │ ├── 2_majority_element │ │ │ ├── MajorityElement.java │ │ │ ├── MajorityElement.kt │ │ │ ├── by_learners │ │ │ │ └── majority_element.rb │ │ │ ├── majority_element.cpp │ │ │ └── majority_element.py │ │ ├── 3_improving_quicksort │ │ │ ├── Sorting.java │ │ │ ├── Sorting.kt │ │ │ ├── by_learners │ │ │ │ └── sorting.rb │ │ │ ├── sorting.cpp │ │ │ └── sorting.py │ │ ├── 4_number_of_inversions │ │ │ ├── Inversions.java │ │ │ ├── Inversions.kt │ │ │ ├── by_learners │ │ │ │ └── inversions.rb │ │ │ ├── inversions.cpp │ │ │ └── inversions.py │ │ ├── 5_organizing_a_lottery │ │ │ ├── PointsAndSegments.java │ │ │ ├── PointsAndSegments.kt │ │ │ ├── by_learners │ │ │ │ └── points_and_segments.rb │ │ │ ├── points_and_segments.cpp │ │ │ └── points_and_segments.py │ │ ├── 6_closest_points │ │ │ ├── Closest.java │ │ │ ├── Closest.kt │ │ │ ├── by_learners │ │ │ │ └── closest.rb │ │ │ ├── closest.cpp │ │ │ └── closest.py │ │ └── week4_divide_and_conquer.pdf │ ├── week5_dynamic_programming1 │ │ ├── 1_money_change_again │ │ │ ├── ChangeDP.java │ │ │ ├── ChangeDP.kt │ │ │ ├── change_dp.cpp │ │ │ └── change_dp.py │ │ ├── 2_primitive_calculator │ │ │ ├── PrimitiveCalculator.java │ │ │ ├── PrimitiveCalculator.kt │ │ │ ├── by_learners │ │ │ │ └── primitive_calculator.rb │ │ │ ├── primitive_calculator.cpp │ │ │ └── primitive_calculator.py │ │ ├── 3_edit_distance │ │ │ ├── EditDistance.java │ │ │ ├── EditDistance.kt │ │ │ ├── by_learners │ │ │ │ └── edit_distance.rb │ │ │ ├── edit_distance.cpp │ │ │ └── edit_distance.py │ │ ├── 4_longest_common_subsequence_of_two_sequences │ │ │ ├── LCS2.java │ │ │ ├── LCS2.kt │ │ │ ├── lcs2.cpp │ │ │ └── lcs2.py │ │ ├── 5_longest_common_subsequence_of_three_sequences │ │ │ ├── LCS3.java │ │ │ ├── LCS3.kt │ │ │ ├── by_learners │ │ │ │ └── lcs3.rb │ │ │ ├── lcs3.cpp │ │ │ └── lcs3.py │ │ └── week5_dynamic_programming1.pdf │ └── week6_dynamic_programming2 │ │ ├── 1_maximum_amount_of_gold │ │ ├── Knapsack.java │ │ ├── Knapsack.kt │ │ ├── by_learners │ │ │ └── knapsack.rb │ │ ├── knapsack.cpp │ │ └── knapsack.py │ │ ├── 2_partitioning_souvenirs │ │ ├── Partition3.java │ │ ├── Partition3.kt │ │ ├── partition3.cpp │ │ └── partition3.py │ │ ├── 3_maximum_value_of_an_arithmetic_expression │ │ ├── PlacingParentheses.java │ │ ├── PlacingParentheses.kt │ │ ├── by_learners │ │ │ └── placing_parentheses.rb │ │ ├── placing_parentheses.cpp │ │ └── placing_parentheses.py │ │ └── week6_dynamic_programming2.pdf │ ├── Learning Algorithms Through Programming and Puzzle Solving ( PDFDrive.com ).pdf │ └── What to do if your solution doesn’t work_.pdf ├── .vscode ├── launch.json ├── settings.json └── tasks.json ├── 1-Github-Git-help ├── 0.png ├── 1.png ├── 2.png ├── 4.png ├── 5.png └── README.md ├── Credit Suisse 2020 Solutions ├── Encrypting Messages.py ├── buy_sell2.py ├── buysell.py ├── counting change.py ├── perfect matching.py ├── q&a community.py └── risk trading.py ├── Interviewbit(Array) ├── Bribing was never easy (Recursive).py ├── Bribing was never easy .py ├── IMG │ ├── 1.png │ ├── 2_.png │ └── 3_.png ├── Make them equal.py └── README.md ├── LICENSE ├── Placement Preparation course GFG └── Nagendra │ └── Array │ ├── 1. Remove duplicate elements from sorted Array .py │ ├── 2. Reverse array in groups .py │ └── 3. Rotate Array .py ├── README.md ├── Searching & Sorting ├── Mit Lecture12 on sorting & searching.pdf ├── README.md ├── Stability in sorting algorithms.docx ├── binary search.py ├── bubble sort.py ├── insertion sort.py ├── linear search.py ├── merge sort.py ├── quick sort.py └── selection sort.py ├── Spoj Problems └── shpath-shortestpath.py ├── ZCO Codechef ├── SMART phone.py ├── tournament.py ├── variation.py └── video game.py ├── array ├── Ajinkya │ └── ajinkya.txt ├── Chinmay │ ├── chinamy.txt │ └── test.docx ├── Kajal │ └── kajal.txt ├── Nagendra │ ├── Cyclically rotate an array by one.py │ ├── Find the maximum and minimum element in an array.py │ ├── Kth smallest element.py │ ├── Largest Sum Contiguous Subarray.py │ ├── Move all negative numbers to beginning and positive to end with constant extra space.py │ ├── Row with max 1s.py │ ├── Sort an array of 0s, 1s and 2s.py │ ├── Union of two arrays.py │ ├── nagendra.txt │ └── reverse arry.py ├── Nayana_Bhoj │ ├── FirstNonRepeatingCharaterFromString.java │ ├── FirstRepeatingElementInArray.java │ ├── LeftRorateArrayBy1.java │ ├── LeftRorateArrayByD.java │ ├── MaximumMinimumInArray.java │ ├── MoveZerosToEnd.java │ ├── ProductOfArrayExceptSelf.java │ ├── SmallestPositiveNumberInArray.java │ ├── StocksBuySell.java │ └── SubArraySumArray.java ├── Neeraj │ ├── CT triplets.py │ ├── Subarray with given sum.py │ └── neeraj.txt ├── Prajjwal │ ├── Max_sum_subarray.py │ └── prajjawal.txt ├── README.md ├── Ratndeep │ ├── Minimize the heights.py │ ├── best time to buy and sell.py │ ├── convert array into zig zag fashion.py │ ├── finding missing number.py │ ├── kadane.py │ ├── koko eating banana.py │ ├── largest number formed from array.py │ ├── next permutation.py │ ├── one diff in adj of number.py │ ├── ratndeep.txt │ ├── spirally traverse matrix.py │ ├── subarray with given sum.py │ ├── subsets.py │ └── triplets_sum.py ├── Robin │ ├── Robin.txt │ ├── kadane.cpp │ ├── missing_number_array.cpp │ └── rearrange_array_alternately.cpp ├── Shivangi │ ├── shavangi.txt │ └── shivangi.txt ├── Utkarsh │ ├── array │ │ ├── Search2Dmatrix.cpp │ │ ├── findDuplicate.cpp │ │ ├── kth-smallest-element_in_unsorted_array.cpp │ │ ├── maxAreaRectangle.cpp │ │ ├── middleOfThree.cpp │ │ ├── powerFucntion.cpp │ │ ├── printSortedMatrix.cpp │ │ ├── sort012.cpp │ │ └── spiralTraversalMatrix.cpp │ └── stunnerhash.txt └── array.txt ├── backtracking ├── Ajinkya │ └── ajinkya.txt ├── Chinmay │ └── chinamy.txt ├── Kajal │ └── kajal.txt ├── Nagendra │ └── nagendra.txt ├── Neeraj │ └── neeraj.txt ├── Prajjwal │ └── prajjawal.txt ├── README.md ├── Ratndeep │ ├── Knight's Tour Problem.py │ ├── nqueen problem.py │ ├── nqueen problem_col.py │ ├── rat in maze.py │ └── ratndeep.txt ├── Robin │ └── Robin.txt ├── Shivangi │ ├── shavangi.txt │ └── shivangi.txt └── backtracking.txt ├── bitmagic ├── Ajinkya │ └── ajinkya.txt ├── Chinmay │ └── chinamy.txt ├── Kajal │ └── kajal.txt ├── Nagendra │ └── nagendra.txt ├── Neeraj │ └── neeraj.txt ├── Prajjwal │ └── prajjawal.txt ├── README.md ├── Ratndeep │ ├── Number Complement.py │ └── ratndeep.txt ├── Robin │ └── Robin.txt ├── Shivangi │ ├── shavangi.txt │ └── shivangi.txt └── bitmagic.txt ├── divide & conquer ├── Ajinkya │ └── ajinkya.txt ├── Chinmay │ └── chinamy.txt ├── Kajal │ └── kajal.txt ├── Nagendra │ └── nagendra.txt ├── Neeraj │ └── neeraj.txt ├── Prajjwal │ └── prajjawal.txt ├── README.md ├── Ratndeep │ └── ratndeep.txt ├── Robin │ └── Robin.txt ├── Shivangi │ ├── shavangi.txt │ └── shivangi.txt └── divide comquer.txt ├── doubly Linkedlist ├── Kajal │ └── kajal.txt ├── README.md ├── Ratndeep │ └── first non-repeating character in a stream.py ├── Shivangi │ ├── shavangi.txt │ └── shivangi.txt ├── pankaj │ └── pankaj.txt └── pratham │ └── pratham.txt ├── dynamic programming ├── Ajinkya │ └── ajinkya.txt ├── Chinmay │ └── chinamy.txt ├── Kajal │ └── kajal.txt ├── Nagendra │ ├── BF Negative weight cycle.py │ ├── matric chain mult.py │ └── nagendra.txt ├── Neeraj │ └── neeraj.txt ├── Prajjwal │ └── prajjawal.txt ├── README.md ├── Ratndeep │ ├── Edit Distance Between 2 Strings - The Levenshtein Distance.py │ ├── cap2.py │ ├── capgemini1.py │ ├── equal sum subsets.py │ ├── lcs.py │ └── ratndeep.txt ├── Robin │ └── Robin.txt ├── Shivangi │ ├── shavangi.txt │ └── shivangi.txt ├── dp.txt ├── pankaj │ └── pankaj.txt └── pratham │ └── pratham.txt ├── graph ├── Ajinkya │ └── ajinkya.txt ├── Chinmay │ └── chinamy.txt ├── Kajal │ └── kajal.txt ├── Nagendra │ ├── BFS.py │ ├── Detect cycle in an undirected graph.py │ ├── Detect_Cycle_in_a_Directed_Graph.py │ ├── alien dictionary.py │ ├── dfs.py │ ├── graph.py │ ├── nagendra.txt │ └── topological sort.py ├── Neeraj │ └── neeraj.txt ├── Prajjwal │ └── prajjawal.txt ├── README.md ├── Ratndeep │ ├── Distance of nearest cell having 1.py │ ├── X total shades.py │ ├── alien dictionary.py │ ├── count no. of strongly connected components.py │ ├── cycle in directed graph.py │ ├── dfs graph.py │ ├── find whether path exist.py │ ├── flood fill algorithm.py │ ├── number of islands by dfs.py │ ├── ratndeep.txt │ ├── rotten oranges.py │ ├── sum of dependencies in a graph.py │ ├── topological sort.py │ └── unit area of largest region of 1's.py ├── Robin │ └── Robin.txt ├── Shivangi │ ├── shavangi.txt │ └── shivangi.txt └── graph.txt ├── greedy ├── Ajinkya │ └── ajinkya.txt ├── Chinmay │ └── chinamy.txt ├── Kajal │ └── kajal.txt ├── Nagendra │ ├── EZDIJKST .py │ ├── Huffman_coding.py │ ├── Job Sequencing Problem.py │ ├── SHPATH - The Shortest Path.py │ ├── TRAFFICN - Traffic Network.py │ ├── The Escape .py │ ├── mini spanning tree.py │ └── nagendra.txt ├── Neeraj │ └── neeraj.txt ├── Prajjwal │ └── prajjawal.txt ├── README.md ├── Ratndeep │ ├── activity selection 2.py │ ├── activityselection.py │ ├── coin piles.py │ ├── huffman-encoding.py │ ├── job sequencing.py │ ├── largest number possible.py │ ├── max_toys.py │ ├── n meeting room.py │ ├── n meeting room2.py │ ├── pages fault in LRU.py │ └── ratndeep.txt ├── Robin │ └── Robin.txt ├── Shivangi │ ├── shavangi.txt │ └── shivangi.txt ├── greedy.txt └── largest number possible.py ├── hashing ├── Ajinkya │ └── ajinkya.txt ├── Chinmay │ └── chinamy.txt ├── Kajal │ └── kajal.txt ├── Nagendra │ └── nagendra.txt ├── Neeraj │ └── neeraj.txt ├── Prajjwal │ └── prajjawal.txt ├── README.md ├── Ratndeep │ ├── ratndeep.txt │ └── searching.py ├── Robin │ └── Robin.txt ├── Shivangi │ ├── shavangi.txt │ └── shivangi.txt └── hashing.txt ├── heap ├── Ajinkya │ └── ajinkya.txt ├── Chinmay │ └── chinamy.txt ├── Kajal │ └── kajal.txt ├── Nagendra │ ├── Binary heap.py │ └── nagendra.txt ├── Neeraj │ └── neeraj.txt ├── Prajjwal │ └── prajjawal.txt ├── README.md ├── Ratndeep │ ├── is binary tree max heap.py │ ├── min_heap.py │ ├── min_heap_without_lib.py │ └── ratndeep.txt ├── Robin │ └── Robin.txt ├── Shivangi │ ├── shavangi.txt │ └── shivangi.txt └── heap.txt ├── img ├── Linkedlist.png ├── Stability.jpg └── traffic1.png ├── linkedlist ├── Ajinkya │ └── ajinkya.txt ├── Chinmay │ └── chinamy.txt ├── Kajal │ └── kajal.txt ├── Nagendra │ ├── Mail System Design.py │ ├── ll.py │ ├── loop -Reverse a linked list.py │ └── nagendra.txt ├── Neeraj │ └── neeraj.txt ├── Prajjwal │ └── prajjawal.txt ├── README.md ├── Ratndeep │ ├── Delete nodes having greater value on right.py │ ├── Multipy two Linkedlist.py │ ├── Segregate even and odd nodes in a Linked List.py │ ├── cloning with random pointer.py │ ├── find insertion point.py │ ├── mail system design.py │ ├── merge k sorted linkeedlist.py │ ├── middle node.py │ ├── nth node from end.py │ ├── partition list.py │ ├── ratndeep.txt │ ├── reverse.py │ ├── reverseingroups.py │ └── rotate.py ├── Robin │ └── Robin.txt ├── Shivangi │ ├── shavangi.txt │ └── shivangi.txt ├── Utkarsh │ ├── linkedList │ │ ├── add1ToLinkedList.cpp │ │ ├── intersectionOfSortedList.cpp │ │ ├── moveLastElementToFront.cpp │ │ └── reverseLinkedList.cpp │ └── stunnerhash.txt └── linkedlist.txt ├── more on arrays ├── Chinmay │ └── chinamy.txt ├── Nagendra │ └── nagendra.txt ├── Neeraj │ └── neeraj.txt ├── Prajjwal │ └── prajjawal.txt ├── Ratndeep │ └── ratndeep.txt ├── Robin │ └── Robin.txt └── more on arrays.txt ├── more on strings ├── Chinmay │ └── chinamy.txt ├── Nagendra │ └── nagendra.txt ├── Neeraj │ └── neeraj.txt ├── Prajjwal │ └── prajjawal.txt ├── Ratndeep │ └── ratndeep.txt ├── Robin │ └── Robin.txt └── more on string.txt ├── more on tree ├── Chinmay │ └── chinamy.txt ├── Nagendra │ └── nagendra.txt ├── Neeraj │ └── neeraj.txt ├── Prajjwal │ └── prajjawal.txt ├── Ratndeep │ └── ratndeep.txt ├── Robin │ └── Robin.txt └── more on trees.txt ├── pepcoding └── Ratndeep │ ├── Basics │ ├── all prime.java │ ├── count digits.java │ ├── fibonacci.java │ ├── grading.java │ ├── inverse.java │ ├── pattern.java │ ├── prime factorization.java │ ├── prime.java │ ├── pythagorean triplet.java │ ├── reverse number.java │ └── rotate number.java │ ├── functions and arrays │ └── sum fo two numbers.java │ └── pattern │ ├── pattern 17.java │ ├── pattern 18.java │ ├── pattern 19.java │ ├── pattern 20.java │ ├── pattern1.java │ ├── pattern10.java │ ├── pattern11.java │ ├── pattern12.java │ ├── pattern13.java │ ├── pattern14.java │ ├── pattern15.java │ ├── pattern16.java │ ├── pattern2.java │ ├── pattern3.java │ ├── pattern4.java │ ├── pattern5.java │ ├── pattern6.java │ ├── pattern7.java │ ├── pattern8.java │ └── pattern9.java ├── recursion ├── Ajinkya │ └── ajinkya.txt ├── Chinmay │ └── chinamy.txt ├── Kajal │ └── kajal.txt ├── Nagendra │ └── nagendra.txt ├── Neeraj │ └── neeraj.txt ├── Prajjwal │ └── prajjawal.txt ├── README.md ├── Ratndeep │ └── ratndeep.txt ├── Robin │ └── Robin.txt ├── Shivangi │ ├── shavangi.txt │ └── shivangi.txt └── recursion.txt ├── segment tree ├── Kajal │ └── kajal.txt ├── README.md ├── Ratndeep │ └── sum of range & updation in logn.py └── Shivangi │ ├── shavangi.txt │ └── shivangi.txt ├── sorting ├── Stability in sorting algorithms.docx ├── bubble sort.py ├── insertion sort.py ├── merge sort.py ├── quick sort.py └── selection sort.py ├── stack & queue ├── Ajinkya │ └── ajinkya.txt ├── Chinmay │ └── chinamy.txt ├── Kajal │ └── kajal.txt ├── Nagendra │ └── nagendra.txt ├── Neeraj │ └── neeraj.txt ├── Prajjwal │ └── prajjawal.txt ├── README.md ├── Ratndeep │ ├── immediate last element +template.py │ └── ratndeep.txt ├── Robin │ └── Robin.txt ├── Shivangi │ ├── shavangi.txt │ └── shivangi.txt └── stack&queue.txt ├── string ├── Ajinkya │ └── ajinkya.txt ├── Chinmay │ └── chinamy.txt ├── Kajal │ └── kajal.txt ├── Nagendra │ └── nagendra.txt ├── Nayana │ ├── MinimumWindowSubstring.java │ └── nayana_bhoj ├── Neeraj │ └── neeraj.txt ├── Prajjwal │ └── prajjawal.txt ├── README.md ├── Ratndeep │ ├── first non-repeating character in string.py │ ├── longest palindrome is string.py │ ├── ratndeep.txt │ ├── reverse.py │ └── string_permutation.py ├── Robin │ └── Robin.txt ├── Shivangi │ ├── shavangi.txt │ └── shivangi.txt └── string.txt └── tree ├── Chinmay └── chinamy.txt ├── Nagendra └── nagendra.txt ├── Neeraj └── neeraj.txt ├── Prajjwal └── prajjawal.txt ├── Ratndeep ├── bottom view of bst.py ├── clone tree with random pointers.py ├── evaluation of expression tree.py ├── is tree bst.py ├── k distance from root.py ├── left_View of tree.py ├── make tree by expression.py ├── print min from bst.py └── ratndeep.txt ├── Robin └── Robin.txt └── tree.txt /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.cpp -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.cs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.cs -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.hs -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.java -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.js: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.js -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.kt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.kt -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.py -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.rb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.rb -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.rs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.rs -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.scala: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.scala -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/week1_programming_challenges.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week1_programming_challenges/week1_programming_challenges.pdf -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/1_fibonacci_number/Fibonacci.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/1_fibonacci_number/Fibonacci.java -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/1_fibonacci_number/Fibonacci.kt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/1_fibonacci_number/Fibonacci.kt -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/1_fibonacci_number/fibonacci.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/1_fibonacci_number/fibonacci.cpp -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/1_fibonacci_number/fibonacci.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/1_fibonacci_number/fibonacci.hs -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/1_fibonacci_number/fibonacci.js: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/1_fibonacci_number/fibonacci.js -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/1_fibonacci_number/fibonacci.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/1_fibonacci_number/fibonacci.py -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/1_fibonacci_number/fibonacci.rb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/1_fibonacci_number/fibonacci.rb -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/3_greatest_common_divisor/GCD.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/3_greatest_common_divisor/GCD.java -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/3_greatest_common_divisor/GCD.kt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/3_greatest_common_divisor/GCD.kt -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/3_greatest_common_divisor/gcd.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/3_greatest_common_divisor/gcd.cpp -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/3_greatest_common_divisor/gcd.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/3_greatest_common_divisor/gcd.hs -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/3_greatest_common_divisor/gcd.js: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/3_greatest_common_divisor/gcd.js -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/3_greatest_common_divisor/gcd.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/3_greatest_common_divisor/gcd.py -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/3_greatest_common_divisor/gcd.rb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/3_greatest_common_divisor/gcd.rb -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/4_least_common_multiple/LCM.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/4_least_common_multiple/LCM.java -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/4_least_common_multiple/LCM.kt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/4_least_common_multiple/LCM.kt -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/4_least_common_multiple/by_learners/lcm.rb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/4_least_common_multiple/by_learners/lcm.rb -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/4_least_common_multiple/lcm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/4_least_common_multiple/lcm.cpp -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/4_least_common_multiple/lcm.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/4_least_common_multiple/lcm.hs -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/4_least_common_multiple/lcm.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/4_least_common_multiple/lcm.py -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/5_fibonacci_number_again/FibonacciHuge.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/5_fibonacci_number_again/FibonacciHuge.java -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/5_fibonacci_number_again/FibonacciHuge.kt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/5_fibonacci_number_again/FibonacciHuge.kt -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/5_fibonacci_number_again/fibonacci_huge.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/5_fibonacci_number_again/fibonacci_huge.cpp -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/5_fibonacci_number_again/fibonacci_huge.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/5_fibonacci_number_again/fibonacci_huge.hs -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/5_fibonacci_number_again/fibonacci_huge.js: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/5_fibonacci_number_again/fibonacci_huge.js -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/5_fibonacci_number_again/fibonacci_huge.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/5_fibonacci_number_again/fibonacci_huge.py -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/5_fibonacci_number_again/fibonacci_huge.rb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/5_fibonacci_number_again/fibonacci_huge.rb -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/week2_algorithmic_warmup.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week2_algorithmic_warmup/week2_algorithmic_warmup.pdf -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/1_money_change/Change.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/1_money_change/Change.java -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/1_money_change/Change.kt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/1_money_change/Change.kt -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/1_money_change/by_learners/change.rb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/1_money_change/by_learners/change.rb -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/1_money_change/change.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/1_money_change/change.cpp -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/1_money_change/change.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/1_money_change/change.hs -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/1_money_change/change.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/1_money_change/change.py -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/3_car_fueling/CarFueling.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/3_car_fueling/CarFueling.java -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/3_car_fueling/car_fueling.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/3_car_fueling/car_fueling.cpp -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/3_car_fueling/car_fueling.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/3_car_fueling/car_fueling.py -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/4_maximum_advertisement_revenue/DotProduct.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/4_maximum_advertisement_revenue/DotProduct.java -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/4_maximum_advertisement_revenue/DotProduct.kt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/4_maximum_advertisement_revenue/DotProduct.kt -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/5_collecting_signatures/CoveringSegments.kt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/5_collecting_signatures/CoveringSegments.kt -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/5_collecting_signatures/covering_segments.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/5_collecting_signatures/covering_segments.hs -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/5_collecting_signatures/covering_segments.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/5_collecting_signatures/covering_segments.py -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/7_maximum_salary/LargestNumber.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/7_maximum_salary/LargestNumber.java -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/7_maximum_salary/LargestNumber.kt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/7_maximum_salary/LargestNumber.kt -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/7_maximum_salary/largest_number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/7_maximum_salary/largest_number.cpp -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/7_maximum_salary/largest_number.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/7_maximum_salary/largest_number.hs -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/7_maximum_salary/largest_number.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/7_maximum_salary/largest_number.py -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/week3_greedy_algorithms.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week3_greedy_algorithms/week3_greedy_algorithms.pdf -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/1_binary_search/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/1_binary_search/.DS_Store -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/1_binary_search/BinarySearch.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/1_binary_search/BinarySearch.java -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/1_binary_search/BinarySearch.kt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/1_binary_search/BinarySearch.kt -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/1_binary_search/binary_search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/1_binary_search/binary_search.cpp -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/1_binary_search/binary_search.js: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/1_binary_search/binary_search.js -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/1_binary_search/binary_search.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/1_binary_search/binary_search.py -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/1_binary_search/binary_search.rb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/1_binary_search/binary_search.rb -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/2_majority_element/MajorityElement.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/2_majority_element/MajorityElement.java -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/2_majority_element/MajorityElement.kt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/2_majority_element/MajorityElement.kt -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/2_majority_element/majority_element.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/2_majority_element/majority_element.cpp -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/2_majority_element/majority_element.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/2_majority_element/majority_element.py -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/3_improving_quicksort/Sorting.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/3_improving_quicksort/Sorting.java -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/3_improving_quicksort/Sorting.kt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/3_improving_quicksort/Sorting.kt -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/3_improving_quicksort/sorting.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/3_improving_quicksort/sorting.cpp -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/3_improving_quicksort/sorting.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/3_improving_quicksort/sorting.py -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/4_number_of_inversions/Inversions.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/4_number_of_inversions/Inversions.java -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/4_number_of_inversions/Inversions.kt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/4_number_of_inversions/Inversions.kt -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/4_number_of_inversions/inversions.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/4_number_of_inversions/inversions.cpp -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/4_number_of_inversions/inversions.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/4_number_of_inversions/inversions.py -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/5_organizing_a_lottery/PointsAndSegments.kt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/5_organizing_a_lottery/PointsAndSegments.kt -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/6_closest_points/Closest.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/6_closest_points/Closest.java -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/6_closest_points/Closest.kt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/6_closest_points/Closest.kt -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/6_closest_points/by_learners/closest.rb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/6_closest_points/by_learners/closest.rb -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/6_closest_points/closest.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/6_closest_points/closest.cpp -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/6_closest_points/closest.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/6_closest_points/closest.py -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/week4_divide_and_conquer.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week4_divide_and_conquer/week4_divide_and_conquer.pdf -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week5_dynamic_programming1/1_money_change_again/ChangeDP.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week5_dynamic_programming1/1_money_change_again/ChangeDP.java -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week5_dynamic_programming1/1_money_change_again/ChangeDP.kt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week5_dynamic_programming1/1_money_change_again/ChangeDP.kt -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week5_dynamic_programming1/1_money_change_again/change_dp.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week5_dynamic_programming1/1_money_change_again/change_dp.cpp -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week5_dynamic_programming1/1_money_change_again/change_dp.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week5_dynamic_programming1/1_money_change_again/change_dp.py -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week5_dynamic_programming1/3_edit_distance/EditDistance.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week5_dynamic_programming1/3_edit_distance/EditDistance.java -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week5_dynamic_programming1/3_edit_distance/EditDistance.kt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week5_dynamic_programming1/3_edit_distance/EditDistance.kt -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week5_dynamic_programming1/3_edit_distance/edit_distance.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week5_dynamic_programming1/3_edit_distance/edit_distance.cpp -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week5_dynamic_programming1/3_edit_distance/edit_distance.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week5_dynamic_programming1/3_edit_distance/edit_distance.py -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week5_dynamic_programming1/week5_dynamic_programming1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week5_dynamic_programming1/week5_dynamic_programming1.pdf -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week6_dynamic_programming2/1_maximum_amount_of_gold/Knapsack.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week6_dynamic_programming2/1_maximum_amount_of_gold/Knapsack.java -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week6_dynamic_programming2/1_maximum_amount_of_gold/Knapsack.kt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week6_dynamic_programming2/1_maximum_amount_of_gold/Knapsack.kt -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week6_dynamic_programming2/1_maximum_amount_of_gold/knapsack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week6_dynamic_programming2/1_maximum_amount_of_gold/knapsack.cpp -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week6_dynamic_programming2/1_maximum_amount_of_gold/knapsack.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week6_dynamic_programming2/1_maximum_amount_of_gold/knapsack.py -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week6_dynamic_programming2/2_partitioning_souvenirs/Partition3.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week6_dynamic_programming2/2_partitioning_souvenirs/Partition3.java -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week6_dynamic_programming2/2_partitioning_souvenirs/Partition3.kt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week6_dynamic_programming2/2_partitioning_souvenirs/Partition3.kt -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week6_dynamic_programming2/2_partitioning_souvenirs/partition3.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week6_dynamic_programming2/2_partitioning_souvenirs/partition3.cpp -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week6_dynamic_programming2/2_partitioning_souvenirs/partition3.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week6_dynamic_programming2/2_partitioning_souvenirs/partition3.py -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week6_dynamic_programming2/week6_dynamic_programming2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Algorithmic Toolbox/week6_dynamic_programming2/week6_dynamic_programming2.pdf -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/Learning Algorithms Through Programming and Puzzle Solving ( PDFDrive.com ).pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/Learning Algorithms Through Programming and Puzzle Solving ( PDFDrive.com ).pdf -------------------------------------------------------------------------------- /(Coursera) Data Structures and Algorithms Specialization/Nagendra/What to do if your solution doesn’t work_.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/(Coursera) Data Structures and Algorithms Specialization/Nagendra/What to do if your solution doesn’t work_.pdf -------------------------------------------------------------------------------- /.vscode/launch.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/.vscode/launch.json -------------------------------------------------------------------------------- /.vscode/settings.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/.vscode/settings.json -------------------------------------------------------------------------------- /.vscode/tasks.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/.vscode/tasks.json -------------------------------------------------------------------------------- /1-Github-Git-help/0.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/1-Github-Git-help/0.png -------------------------------------------------------------------------------- /1-Github-Git-help/1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/1-Github-Git-help/1.png -------------------------------------------------------------------------------- /1-Github-Git-help/2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/1-Github-Git-help/2.png -------------------------------------------------------------------------------- /1-Github-Git-help/4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/1-Github-Git-help/4.png -------------------------------------------------------------------------------- /1-Github-Git-help/5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/1-Github-Git-help/5.png -------------------------------------------------------------------------------- /1-Github-Git-help/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/1-Github-Git-help/README.md -------------------------------------------------------------------------------- /450/Ajinkya/Find Duplicate.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ajinkya/Find Duplicate.cpp -------------------------------------------------------------------------------- /450/Ajinkya/Min Jumps to reach end of array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ajinkya/Min Jumps to reach end of array.cpp -------------------------------------------------------------------------------- /450/Ajinkya/Minimize the maximum difference.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ajinkya/Minimize the maximum difference.cpp -------------------------------------------------------------------------------- /450/Ajinkya/Power using array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ajinkya/Power using array.cpp -------------------------------------------------------------------------------- /450/Ajinkya/knapsack 01.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ajinkya/knapsack 01.cpp -------------------------------------------------------------------------------- /450/Captain/Array/1ReverseTheArray.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Captain/Array/1ReverseTheArray.cpp -------------------------------------------------------------------------------- /450/Captain/Array/2Find the maximum and minimum element in an array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Captain/Array/2Find the maximum and minimum element in an array.cpp -------------------------------------------------------------------------------- /450/Captain/Array/4Given an array which consists of only 0, 1 and 2. Sort the array without using any sorting algo.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Captain/Array/4Given an array which consists of only 0, 1 and 2. Sort the array without using any sorting algo.cpp -------------------------------------------------------------------------------- /450/Captain/Array/Move all the negative elements to one side of the array .cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Captain/Array/Move all the negative elements to one side of the array .cpp -------------------------------------------------------------------------------- /450/Captain/Captain.txt: -------------------------------------------------------------------------------- 1 | Hello, I am Captain. 2 | -------------------------------------------------------------------------------- /450/Chirag/450 Questions: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Chirag/450 Questions -------------------------------------------------------------------------------- /450/FINAL450.xlsx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/FINAL450.xlsx -------------------------------------------------------------------------------- /450/Kajal/reverse a linked list: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Kajal/reverse a linked list -------------------------------------------------------------------------------- /450/Kajal/reverse a string: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Kajal/reverse a string -------------------------------------------------------------------------------- /450/Nagendra/BST/Delete Node in a BST.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/BST/Delete Node in a BST.py -------------------------------------------------------------------------------- /450/Nagendra/BST/Fina a value in a BST.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/BST/Fina a value in a BST.py -------------------------------------------------------------------------------- /450/Nagendra/BST/Minimum element in BST.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/BST/Minimum element in BST.py -------------------------------------------------------------------------------- /450/Nagendra/Dynamic/0 - 1 Knapsack Problem.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/Dynamic/0 - 1 Knapsack Problem.py -------------------------------------------------------------------------------- /450/Nagendra/Dynamic/BF Negative weight cycle.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/Dynamic/BF Negative weight cycle.py -------------------------------------------------------------------------------- /450/Nagendra/Dynamic/Longest Common Subsequence.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/Dynamic/Longest Common Subsequence.py -------------------------------------------------------------------------------- /450/Nagendra/Dynamic/matric chain mult.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/Dynamic/matric chain mult.py -------------------------------------------------------------------------------- /450/Nagendra/String/Count and Say problem.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/String/Count and Say problem.py -------------------------------------------------------------------------------- /450/Nagendra/String/Palindrome String.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/String/Palindrome String.py -------------------------------------------------------------------------------- /450/Nagendra/String/Reverse String.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/String/Reverse String.py -------------------------------------------------------------------------------- /450/Nagendra/String/next greater number .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/String/next greater number .py -------------------------------------------------------------------------------- /450/Nagendra/array/Array Subset of another array .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Array Subset of another array .py -------------------------------------------------------------------------------- /450/Nagendra/array/Best Time to Buy and Sell Stock.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Best Time to Buy and Sell Stock.py -------------------------------------------------------------------------------- /450/Nagendra/array/Chocolate Distribution problem.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Chocolate Distribution problem.py -------------------------------------------------------------------------------- /450/Nagendra/array/Common elements .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Common elements .py -------------------------------------------------------------------------------- /450/Nagendra/array/Count pairs with given sum .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Count pairs with given sum .py -------------------------------------------------------------------------------- /450/Nagendra/array/Cyclically rotate an array by one.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Cyclically rotate an array by one.py -------------------------------------------------------------------------------- /450/Nagendra/array/Factorials of large numbers .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Factorials of large numbers .py -------------------------------------------------------------------------------- /450/Nagendra/array/Find the Duplicate Number.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Find the Duplicate Number.py -------------------------------------------------------------------------------- /450/Nagendra/array/Find the maximum and minimum element in an array.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Find the maximum and minimum element in an array.py -------------------------------------------------------------------------------- /450/Nagendra/array/Find the median .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Find the median .py -------------------------------------------------------------------------------- /450/Nagendra/array/Inversion of array .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Inversion of array .py -------------------------------------------------------------------------------- /450/Nagendra/array/Kth smallest element.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Kth smallest element.py -------------------------------------------------------------------------------- /450/Nagendra/array/Largest Sum Contiguous Subarray.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Largest Sum Contiguous Subarray.py -------------------------------------------------------------------------------- /450/Nagendra/array/Max Sum Subarray of size K .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Max Sum Subarray of size K .py -------------------------------------------------------------------------------- /450/Nagendra/array/Maximum Product Subarray .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Maximum Product Subarray .py -------------------------------------------------------------------------------- /450/Nagendra/array/Merge Without Extra Space.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Merge Without Extra Space.py -------------------------------------------------------------------------------- /450/Nagendra/array/Move all negative numbers to beginning and positive to end with constant extra space.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Move all negative numbers to beginning and positive to end with constant extra space.py -------------------------------------------------------------------------------- /450/Nagendra/array/Palindromic Array .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Palindromic Array .py -------------------------------------------------------------------------------- /450/Nagendra/array/Row with max 1s.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Row with max 1s.py -------------------------------------------------------------------------------- /450/Nagendra/array/Smallest subarray with sum greater than x .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Smallest subarray with sum greater than x .py -------------------------------------------------------------------------------- /450/Nagendra/array/Sort an array of 0s, 1s and 2s.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Sort an array of 0s, 1s and 2s.py -------------------------------------------------------------------------------- /450/Nagendra/array/Subarray with 0 sum .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Subarray with 0 sum .py -------------------------------------------------------------------------------- /450/Nagendra/array/Three way partitioning .py: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /450/Nagendra/array/Triplet Sum in Array .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Triplet Sum in Array .py -------------------------------------------------------------------------------- /450/Nagendra/array/Union of two arrays.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/Union of two arrays.py -------------------------------------------------------------------------------- /450/Nagendra/array/merge intervals.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/merge intervals.py -------------------------------------------------------------------------------- /450/Nagendra/array/reverse arry.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/array/reverse arry.py -------------------------------------------------------------------------------- /450/Nagendra/greedy/Activity Selection Problem.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/greedy/Activity Selection Problem.py -------------------------------------------------------------------------------- /450/Nagendra/greedy/Chocolate Distribution Problem .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/greedy/Chocolate Distribution Problem .py -------------------------------------------------------------------------------- /450/Nagendra/greedy/Coin Piles .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/greedy/Coin Piles .py -------------------------------------------------------------------------------- /450/Nagendra/greedy/DEFKIN - Defense of a Kingdom.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/greedy/DEFKIN - Defense of a Kingdom.py -------------------------------------------------------------------------------- /450/Nagendra/greedy/Find smallest number with given number of digits and sum of digits.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/greedy/Find smallest number with given number of digits and sum of digits.py -------------------------------------------------------------------------------- /450/Nagendra/greedy/Fractional Knapsack.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/greedy/Fractional Knapsack.py -------------------------------------------------------------------------------- /450/Nagendra/greedy/Huffman Encoding .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/greedy/Huffman Encoding .py -------------------------------------------------------------------------------- /450/Nagendra/greedy/Job Sequencing Problem .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/greedy/Job Sequencing Problem .py -------------------------------------------------------------------------------- /450/Nagendra/greedy/Maximize sum after K negations .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/greedy/Maximize sum after K negations .py -------------------------------------------------------------------------------- /450/Nagendra/greedy/Maximize sum(arr[i]i) of an Array .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/greedy/Maximize sum(arr[i]i) of an Array .py -------------------------------------------------------------------------------- /450/Nagendra/greedy/Minimum Cost of ropes .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/greedy/Minimum Cost of ropes .py -------------------------------------------------------------------------------- /450/Nagendra/greedy/Minimum Platforms .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/greedy/Minimum Platforms .py -------------------------------------------------------------------------------- /450/Nagendra/greedy/Rearrange characters .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/greedy/Rearrange characters .py -------------------------------------------------------------------------------- /450/Nagendra/greedy/Shop in Candy Store .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/greedy/Shop in Candy Store .py -------------------------------------------------------------------------------- /450/Nagendra/greedy/Swap and Maximize .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/greedy/Swap and Maximize .py -------------------------------------------------------------------------------- /450/Nagendra/matrix/Search ele 2D Matrix.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/matrix/Search ele 2D Matrix.py -------------------------------------------------------------------------------- /450/Nagendra/searching & sorting/Count Squares.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/searching & sorting/Count Squares.py -------------------------------------------------------------------------------- /450/Nagendra/searching & sorting/Find the repeating and the missing.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/searching & sorting/Find the repeating and the missing.py -------------------------------------------------------------------------------- /450/Nagendra/searching & sorting/First and last occurrences of X.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/searching & sorting/First and last occurrences of X.py -------------------------------------------------------------------------------- /450/Nagendra/searching & sorting/Maximum and minimum of an array using minimum number of comparisons.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/searching & sorting/Maximum and minimum of an array using minimum number of comparisons.py -------------------------------------------------------------------------------- /450/Nagendra/searching & sorting/Search in Rotated Sorted Array.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/searching & sorting/Search in Rotated Sorted Array.py -------------------------------------------------------------------------------- /450/Nagendra/searching & sorting/Value equal to index value.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/searching & sorting/Value equal to index value.py -------------------------------------------------------------------------------- /450/Nagendra/searching & sorting/find majority element.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nagendra/searching & sorting/find majority element.py -------------------------------------------------------------------------------- /450/Nayana_Bhoj/MaximumMinimumInArray.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nayana_Bhoj/MaximumMinimumInArray.java -------------------------------------------------------------------------------- /450/Nayana_Bhoj/Nayana_Bhoj: -------------------------------------------------------------------------------- 1 | /nayana_bhoj -------------------------------------------------------------------------------- /450/Nayana_Bhoj/ReverseAnArray.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Nayana_Bhoj/ReverseAnArray.java -------------------------------------------------------------------------------- /450/Neeraj/012s.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Neeraj/012s.py -------------------------------------------------------------------------------- /450/Neeraj/Reverse a String.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Neeraj/Reverse a String.py -------------------------------------------------------------------------------- /450/Neeraj/duplicate in array of n+1 integers.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Neeraj/duplicate in array of n+1 integers.py -------------------------------------------------------------------------------- /450/Neeraj/negtive right and positive left.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Neeraj/negtive right and positive left.py -------------------------------------------------------------------------------- /450/Neeraj/nerj.txt: -------------------------------------------------------------------------------- 1 | /asd 2 | -------------------------------------------------------------------------------- /450/Neeraj/recursive reverse a string.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Neeraj/recursive reverse a string.py -------------------------------------------------------------------------------- /450/Neeraj/subarray with zero sum.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Neeraj/subarray with zero sum.py -------------------------------------------------------------------------------- /450/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/README.md -------------------------------------------------------------------------------- /450/Rahul/Array/reverseArray.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Rahul/Array/reverseArray.cpp -------------------------------------------------------------------------------- /450/Rahul/String/reverseString.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Rahul/String/reverseString.cpp -------------------------------------------------------------------------------- /450/Ratndeep/Array/Array1-reversearray-Q1.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Array/Array1-reversearray-Q1.py -------------------------------------------------------------------------------- /450/Ratndeep/Array/Array2-middleofthreeelements-Q2.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Array/Array2-middleofthreeelements-Q2.py -------------------------------------------------------------------------------- /450/Ratndeep/Array/Cyclically rotate an array by one.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Array/Cyclically rotate an array by one.py -------------------------------------------------------------------------------- /450/Ratndeep/Array/find duplication in O(n).py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Array/find duplication in O(n).py -------------------------------------------------------------------------------- /450/Ratndeep/Array/kadane.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Array/kadane.py -------------------------------------------------------------------------------- /450/Ratndeep/Array/kth smallest.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Array/kth smallest.py -------------------------------------------------------------------------------- /450/Ratndeep/Array/merge two list without extra space.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Array/merge two list without extra space.py -------------------------------------------------------------------------------- /450/Ratndeep/Array/middle of three.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Array/middle of three.py -------------------------------------------------------------------------------- /450/Ratndeep/Array/min jump to reach end.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Array/min jump to reach end.py -------------------------------------------------------------------------------- /450/Ratndeep/Array/minimize the height.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Array/minimize the height.py -------------------------------------------------------------------------------- /450/Ratndeep/Array/negativeleftpositiveright.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Array/negativeleftpositiveright.py -------------------------------------------------------------------------------- /450/Ratndeep/Array/sort012.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Array/sort012.py -------------------------------------------------------------------------------- /450/Ratndeep/Array/union&intersection.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Array/union&intersection.py -------------------------------------------------------------------------------- /450/Ratndeep/Binary Search Tree/delete node.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Binary Search Tree/delete node.py -------------------------------------------------------------------------------- /450/Ratndeep/Binary Search Tree/insert new node.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Binary Search Tree/insert new node.py -------------------------------------------------------------------------------- /450/Ratndeep/Binary Search Tree/smallest value.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Binary Search Tree/smallest value.py -------------------------------------------------------------------------------- /450/Ratndeep/Binary Tree/BT-1 Level Order Traversal.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Binary Tree/BT-1 Level Order Traversal.py -------------------------------------------------------------------------------- /450/Ratndeep/Binary Tree/Reverse level order.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Binary Tree/Reverse level order.py -------------------------------------------------------------------------------- /450/Ratndeep/Binary Tree/bottom view.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Binary Tree/bottom view.py -------------------------------------------------------------------------------- /450/Ratndeep/Binary Tree/boundary view.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Binary Tree/boundary view.py -------------------------------------------------------------------------------- /450/Ratndeep/Binary Tree/diagonal traversal.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Binary Tree/diagonal traversal.py -------------------------------------------------------------------------------- /450/Ratndeep/Binary Tree/diameter of bt.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Binary Tree/diameter of bt.py -------------------------------------------------------------------------------- /450/Ratndeep/Binary Tree/height of bt.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Binary Tree/height of bt.py -------------------------------------------------------------------------------- /450/Ratndeep/Binary Tree/inorder recursive&iterative.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Binary Tree/inorder recursive&iterative.py -------------------------------------------------------------------------------- /450/Ratndeep/Binary Tree/left view.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Binary Tree/left view.py -------------------------------------------------------------------------------- /450/Ratndeep/Binary Tree/mirrortree.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Binary Tree/mirrortree.py -------------------------------------------------------------------------------- /450/Ratndeep/Binary Tree/postorder.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Binary Tree/postorder.py -------------------------------------------------------------------------------- /450/Ratndeep/Binary Tree/preorder traversal.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Binary Tree/preorder traversal.py -------------------------------------------------------------------------------- /450/Ratndeep/Binary Tree/right view.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Binary Tree/right view.py -------------------------------------------------------------------------------- /450/Ratndeep/Binary Tree/subtree.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Binary Tree/subtree.py -------------------------------------------------------------------------------- /450/Ratndeep/Binary Tree/top view.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Binary Tree/top view.py -------------------------------------------------------------------------------- /450/Ratndeep/Binary Tree/transform to sum tree.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Binary Tree/transform to sum tree.py -------------------------------------------------------------------------------- /450/Ratndeep/Binary Tree/zigzag.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Binary Tree/zigzag.py -------------------------------------------------------------------------------- /450/Ratndeep/Optimal Only/pascal.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/Optimal Only/pascal.py -------------------------------------------------------------------------------- /450/Ratndeep/String/String1-Reverse_string-Q1.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/String/String1-Reverse_string-Q1.py -------------------------------------------------------------------------------- /450/Ratndeep/String/String2-Palindrome-Q2.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/String/String2-Palindrome-Q2.py -------------------------------------------------------------------------------- /450/Ratndeep/String/check)two_strings are same rotated.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/String/check)two_strings are same rotated.py -------------------------------------------------------------------------------- /450/Ratndeep/String/countandsay.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/String/countandsay.py -------------------------------------------------------------------------------- /450/Ratndeep/String/immutable.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/String/immutable.py -------------------------------------------------------------------------------- /450/Ratndeep/String/longestcommonsubsequence.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/String/longestcommonsubsequence.py -------------------------------------------------------------------------------- /450/Ratndeep/String/longestcommonsubsequenceoptimal.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/String/longestcommonsubsequenceoptimal.py -------------------------------------------------------------------------------- /450/Ratndeep/String/longestpalindromestring.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/String/longestpalindromestring.py -------------------------------------------------------------------------------- /450/Ratndeep/String/longestpalindromestringmem.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/String/longestpalindromestringmem.py -------------------------------------------------------------------------------- /450/Ratndeep/String/longestpalindromicsustringtabular.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/String/longestpalindromicsustringtabular.py -------------------------------------------------------------------------------- /450/Ratndeep/String/longestpanidromesubstringlinear.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/String/longestpanidromesubstringlinear.py -------------------------------------------------------------------------------- /450/Ratndeep/String/printduplicatesonly.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/String/printduplicatesonly.py -------------------------------------------------------------------------------- /450/Ratndeep/String/shuffle.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/String/shuffle.py -------------------------------------------------------------------------------- /450/Ratndeep/backtracking/nqueen.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/backtracking/nqueen.py -------------------------------------------------------------------------------- /450/Ratndeep/backtracking/rat in maze.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/backtracking/rat in maze.py -------------------------------------------------------------------------------- /450/Ratndeep/dynamic programming/0-1knapsack.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/dynamic programming/0-1knapsack.py -------------------------------------------------------------------------------- /450/Ratndeep/dynamic programming/coin change problem.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/dynamic programming/coin change problem.py -------------------------------------------------------------------------------- /450/Ratndeep/dynamic programming/levenshtein disatance.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/dynamic programming/levenshtein disatance.py -------------------------------------------------------------------------------- /450/Ratndeep/dynamic programming/longest repeating subsequence.py: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /450/Ratndeep/dynamic programming/matrix-chain-multiplication.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/dynamic programming/matrix-chain-multiplication.py -------------------------------------------------------------------------------- /450/Ratndeep/dynamic programming/nCr.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/dynamic programming/nCr.py -------------------------------------------------------------------------------- /450/Ratndeep/dynamic programming/nPr.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/dynamic programming/nPr.py -------------------------------------------------------------------------------- /450/Ratndeep/dynamic programming/nth catalan.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/dynamic programming/nth catalan.py -------------------------------------------------------------------------------- /450/Ratndeep/dynamic programming/watching cpl.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/dynamic programming/watching cpl.py -------------------------------------------------------------------------------- /450/Ratndeep/dynamic programming/word break.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/dynamic programming/word break.py -------------------------------------------------------------------------------- /450/Ratndeep/graph/DFS.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/graph/DFS.py -------------------------------------------------------------------------------- /450/Ratndeep/graph/bfs.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/graph/bfs.py -------------------------------------------------------------------------------- /450/Ratndeep/graph/detect cycle in directed graph.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/graph/detect cycle in directed graph.py -------------------------------------------------------------------------------- /450/Ratndeep/graph/detect cycle in undirected graph.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/graph/detect cycle in undirected graph.py -------------------------------------------------------------------------------- /450/Ratndeep/graph/implementation.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/graph/implementation.py -------------------------------------------------------------------------------- /450/Ratndeep/greedy/huffman encoding.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/greedy/huffman encoding.py -------------------------------------------------------------------------------- /450/Ratndeep/greedy/job sequencing.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/greedy/job sequencing.py -------------------------------------------------------------------------------- /450/Ratndeep/greedy/n meeting room.py: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /450/Ratndeep/linkedlist.py/add 1 to number representated in linkedlist.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/linkedlist.py/add 1 to number representated in linkedlist.py -------------------------------------------------------------------------------- /450/Ratndeep/linkedlist.py/add two numbers representated in linkedlist.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/linkedlist.py/add two numbers representated in linkedlist.py -------------------------------------------------------------------------------- /450/Ratndeep/linkedlist.py/detectloop.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/linkedlist.py/detectloop.py -------------------------------------------------------------------------------- /450/Ratndeep/linkedlist.py/intersection of two linkedlist.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/linkedlist.py/intersection of two linkedlist.py -------------------------------------------------------------------------------- /450/Ratndeep/linkedlist.py/make last node as head.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/linkedlist.py/make last node as head.py -------------------------------------------------------------------------------- /450/Ratndeep/linkedlist.py/remove duplicate element from unsorted linkedlist.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/linkedlist.py/remove duplicate element from unsorted linkedlist.py -------------------------------------------------------------------------------- /450/Ratndeep/linkedlist.py/remove duplicate from sorted ll.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/linkedlist.py/remove duplicate from sorted ll.py -------------------------------------------------------------------------------- /450/Ratndeep/linkedlist.py/removeloop.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/linkedlist.py/removeloop.py -------------------------------------------------------------------------------- /450/Ratndeep/linkedlist.py/reverse.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/linkedlist.py/reverse.py -------------------------------------------------------------------------------- /450/Ratndeep/linkedlist.py/reverseks.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/linkedlist.py/reverseks.py -------------------------------------------------------------------------------- /450/Ratndeep/linkedlist.py/starting node of loop.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/linkedlist.py/starting node of loop.py -------------------------------------------------------------------------------- /450/Ratndeep/matrix/row with max1's.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/matrix/row with max1's.py -------------------------------------------------------------------------------- /450/Ratndeep/matrix/searching in sortedmatrix.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/matrix/searching in sortedmatrix.py -------------------------------------------------------------------------------- /450/Ratndeep/matrix/sorting a sortedmatrix.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/matrix/sorting a sortedmatrix.py -------------------------------------------------------------------------------- /450/Ratndeep/matrix/spiral traversal.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/matrix/spiral traversal.py -------------------------------------------------------------------------------- /450/Ratndeep/recursion/climbing stairs.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/recursion/climbing stairs.py -------------------------------------------------------------------------------- /450/Ratndeep/recursion/pascal.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/recursion/pascal.py -------------------------------------------------------------------------------- /450/Ratndeep/recursion/permutation of string.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/recursion/permutation of string.py -------------------------------------------------------------------------------- /450/Ratndeep/recursion/reverse linkedlist.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/recursion/reverse linkedlist.py -------------------------------------------------------------------------------- /450/Ratndeep/recursion/reverse string.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/recursion/reverse string.py -------------------------------------------------------------------------------- /450/Ratndeep/searching&sorting/countsquares.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/searching&sorting/countsquares.py -------------------------------------------------------------------------------- /450/Ratndeep/searching&sorting/first-lastoccurance using binarysearch.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/searching&sorting/first-lastoccurance using binarysearch.py -------------------------------------------------------------------------------- /450/Ratndeep/searching&sorting/missing and repeating.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/searching&sorting/missing and repeating.py -------------------------------------------------------------------------------- /450/Ratndeep/searching&sorting/seach in rotated array.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/searching&sorting/seach in rotated array.py -------------------------------------------------------------------------------- /450/Ratndeep/searching&sorting/value_equal_to_index_value.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/searching&sorting/value_equal_to_index_value.py -------------------------------------------------------------------------------- /450/Ratndeep/stack/max size rectaingle in matrix.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/stack/max size rectaingle in matrix.py -------------------------------------------------------------------------------- /450/Ratndeep/stack/maximum rectaingle in histogram.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Ratndeep/stack/maximum rectaingle in histogram.py -------------------------------------------------------------------------------- /450/Tarun/Array/1 Reverse a array.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Tarun/Array/1 Reverse a array.py -------------------------------------------------------------------------------- /450/Tarun/Array/2 find minimum and mzximum element in array.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Tarun/Array/2 find minimum and mzximum element in array.py -------------------------------------------------------------------------------- /450/Tarun/Array/3 Find Kth smallest element in O(N).py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Tarun/Array/3 Find Kth smallest element in O(N).py -------------------------------------------------------------------------------- /450/Tarun/Array/5 Move all negative numbers to beginning and positive to end.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Tarun/Array/5 Move all negative numbers to beginning and positive to end.py -------------------------------------------------------------------------------- /450/Tarun/Array/7 Largest sum subarray.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Tarun/Array/7 Largest sum subarray.py -------------------------------------------------------------------------------- /450/Tarun/Array/9 Minimum no of the jump to rach in the end.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Tarun/Array/9 Minimum no of the jump to rach in the end.py -------------------------------------------------------------------------------- /450/Tarun/String/Count and Say.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Tarun/String/Count and Say.py -------------------------------------------------------------------------------- /450/Tarun/String/Reverse String without extra space.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Tarun/String/Reverse String without extra space.py -------------------------------------------------------------------------------- /450/Tarun/String/check if strings are rotations of each other or not.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Tarun/String/check if strings are rotations of each other or not.py -------------------------------------------------------------------------------- /450/Utkarsh/DP/editDistanceStrings.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/DP/editDistanceStrings.cpp -------------------------------------------------------------------------------- /450/Utkarsh/DP/longestCommonSubsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/DP/longestCommonSubsequence.cpp -------------------------------------------------------------------------------- /450/Utkarsh/DP/longestRepeatingSubsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/DP/longestRepeatingSubsequence.cpp -------------------------------------------------------------------------------- /450/Utkarsh/array/findDuplicate.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/array/findDuplicate.cpp -------------------------------------------------------------------------------- /450/Utkarsh/array/findMissingAndRepeating.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/array/findMissingAndRepeating.cpp -------------------------------------------------------------------------------- /450/Utkarsh/array/firstAndLastX.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/array/firstAndLastX.cpp -------------------------------------------------------------------------------- /450/Utkarsh/array/maxAreaRectangle.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/array/maxAreaRectangle.cpp -------------------------------------------------------------------------------- /450/Utkarsh/array/mergeTwoSortedArrays.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/array/mergeTwoSortedArrays.cpp -------------------------------------------------------------------------------- /450/Utkarsh/array/middleOfThree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/array/middleOfThree.cpp -------------------------------------------------------------------------------- /450/Utkarsh/array/nMeetingInARoom.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/array/nMeetingInARoom.cpp -------------------------------------------------------------------------------- /450/Utkarsh/array/negativeToLeftSide.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/array/negativeToLeftSide.cpp -------------------------------------------------------------------------------- /450/Utkarsh/array/powerFucntion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/array/powerFucntion.cpp -------------------------------------------------------------------------------- /450/Utkarsh/array/spiralTraversalMatrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/array/spiralTraversalMatrix.cpp -------------------------------------------------------------------------------- /450/Utkarsh/backtracking/nQueenChess.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/backtracking/nQueenChess.cpp -------------------------------------------------------------------------------- /450/Utkarsh/binaryTree/diameterOfBST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/binaryTree/diameterOfBST.cpp -------------------------------------------------------------------------------- /450/Utkarsh/binaryTree/heightOfBST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/binaryTree/heightOfBST.cpp -------------------------------------------------------------------------------- /450/Utkarsh/binaryTree/insertionBST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/binaryTree/insertionBST.cpp -------------------------------------------------------------------------------- /450/Utkarsh/binaryTree/levelOrderBFS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/binaryTree/levelOrderBFS.cpp -------------------------------------------------------------------------------- /450/Utkarsh/binaryTree/minimumInBST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/binaryTree/minimumInBST.cpp -------------------------------------------------------------------------------- /450/Utkarsh/binaryTree/postorderTraversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/binaryTree/postorderTraversal.cpp -------------------------------------------------------------------------------- /450/Utkarsh/binaryTree/preorderTraversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/binaryTree/preorderTraversal.cpp -------------------------------------------------------------------------------- /450/Utkarsh/binaryTree/reverseLevelorder.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/binaryTree/reverseLevelorder.cpp -------------------------------------------------------------------------------- /450/Utkarsh/greedy/permutationCoefficient.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/greedy/permutationCoefficient.cpp -------------------------------------------------------------------------------- /450/Utkarsh/linkedList/add1ToLinkedList.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/linkedList/add1ToLinkedList.cpp -------------------------------------------------------------------------------- /450/Utkarsh/linkedList/add2Nums.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/linkedList/add2Nums.cpp -------------------------------------------------------------------------------- /450/Utkarsh/linkedList/intersectionOfSortedList.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/linkedList/intersectionOfSortedList.cpp -------------------------------------------------------------------------------- /450/Utkarsh/linkedList/moveLastElementToFront.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/linkedList/moveLastElementToFront.cpp -------------------------------------------------------------------------------- /450/Utkarsh/linkedList/reverseLinkedList.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/linkedList/reverseLinkedList.cpp -------------------------------------------------------------------------------- /450/Utkarsh/searching-sorting/Search2Dmatrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/searching-sorting/Search2Dmatrix.cpp -------------------------------------------------------------------------------- /450/Utkarsh/searching-sorting/kth-smallest-element_in_unsorted_array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/searching-sorting/kth-smallest-element_in_unsorted_array.cpp -------------------------------------------------------------------------------- /450/Utkarsh/searching-sorting/printSortedMatrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/searching-sorting/printSortedMatrix.cpp -------------------------------------------------------------------------------- /450/Utkarsh/searching-sorting/sort012.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/searching-sorting/sort012.cpp -------------------------------------------------------------------------------- /450/Utkarsh/string/check_if_string_rotations_of_each_other.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/string/check_if_string_rotations_of_each_other.cpp -------------------------------------------------------------------------------- /450/Utkarsh/string/countAndSay.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/string/countAndSay.cpp -------------------------------------------------------------------------------- /450/Utkarsh/string/duplicatesInString.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/string/duplicatesInString.cpp -------------------------------------------------------------------------------- /450/Utkarsh/string/palindrome_string.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/string/palindrome_string.cpp -------------------------------------------------------------------------------- /450/Utkarsh/string/printSubsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/string/printSubsequence.cpp -------------------------------------------------------------------------------- /450/Utkarsh/string/reverse_string.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/string/reverse_string.cpp -------------------------------------------------------------------------------- /450/Utkarsh/string/validShuffle.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/450/Utkarsh/string/validShuffle.cpp -------------------------------------------------------------------------------- /450/reverse.py: -------------------------------------------------------------------------------- 1 | s=input() 2 | s.reverse() 3 | print(s) 4 | -------------------------------------------------------------------------------- /Credit Suisse 2020 Solutions/Encrypting Messages.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Credit Suisse 2020 Solutions/Encrypting Messages.py -------------------------------------------------------------------------------- /Credit Suisse 2020 Solutions/buy_sell2.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Credit Suisse 2020 Solutions/buy_sell2.py -------------------------------------------------------------------------------- /Credit Suisse 2020 Solutions/buysell.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Credit Suisse 2020 Solutions/buysell.py -------------------------------------------------------------------------------- /Credit Suisse 2020 Solutions/counting change.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Credit Suisse 2020 Solutions/counting change.py -------------------------------------------------------------------------------- /Credit Suisse 2020 Solutions/perfect matching.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Credit Suisse 2020 Solutions/perfect matching.py -------------------------------------------------------------------------------- /Credit Suisse 2020 Solutions/q&a community.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Credit Suisse 2020 Solutions/q&a community.py -------------------------------------------------------------------------------- /Credit Suisse 2020 Solutions/risk trading.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Credit Suisse 2020 Solutions/risk trading.py -------------------------------------------------------------------------------- /Interviewbit(Array)/Bribing was never easy (Recursive).py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Interviewbit(Array)/Bribing was never easy (Recursive).py -------------------------------------------------------------------------------- /Interviewbit(Array)/Bribing was never easy .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Interviewbit(Array)/Bribing was never easy .py -------------------------------------------------------------------------------- /Interviewbit(Array)/IMG/1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Interviewbit(Array)/IMG/1.png -------------------------------------------------------------------------------- /Interviewbit(Array)/IMG/2_.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Interviewbit(Array)/IMG/2_.png -------------------------------------------------------------------------------- /Interviewbit(Array)/IMG/3_.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Interviewbit(Array)/IMG/3_.png -------------------------------------------------------------------------------- /Interviewbit(Array)/Make them equal.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Interviewbit(Array)/Make them equal.py -------------------------------------------------------------------------------- /Interviewbit(Array)/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Interviewbit(Array)/README.md -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/LICENSE -------------------------------------------------------------------------------- /Placement Preparation course GFG/Nagendra/Array/1. Remove duplicate elements from sorted Array .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Placement Preparation course GFG/Nagendra/Array/1. Remove duplicate elements from sorted Array .py -------------------------------------------------------------------------------- /Placement Preparation course GFG/Nagendra/Array/2. Reverse array in groups .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Placement Preparation course GFG/Nagendra/Array/2. Reverse array in groups .py -------------------------------------------------------------------------------- /Placement Preparation course GFG/Nagendra/Array/3. Rotate Array .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Placement Preparation course GFG/Nagendra/Array/3. Rotate Array .py -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/README.md -------------------------------------------------------------------------------- /Searching & Sorting/Mit Lecture12 on sorting & searching.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Searching & Sorting/Mit Lecture12 on sorting & searching.pdf -------------------------------------------------------------------------------- /Searching & Sorting/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Searching & Sorting/README.md -------------------------------------------------------------------------------- /Searching & Sorting/Stability in sorting algorithms.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Searching & Sorting/Stability in sorting algorithms.docx -------------------------------------------------------------------------------- /Searching & Sorting/binary search.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Searching & Sorting/binary search.py -------------------------------------------------------------------------------- /Searching & Sorting/bubble sort.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Searching & Sorting/bubble sort.py -------------------------------------------------------------------------------- /Searching & Sorting/insertion sort.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Searching & Sorting/insertion sort.py -------------------------------------------------------------------------------- /Searching & Sorting/linear search.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Searching & Sorting/linear search.py -------------------------------------------------------------------------------- /Searching & Sorting/merge sort.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Searching & Sorting/merge sort.py -------------------------------------------------------------------------------- /Searching & Sorting/quick sort.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Searching & Sorting/quick sort.py -------------------------------------------------------------------------------- /Searching & Sorting/selection sort.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Searching & Sorting/selection sort.py -------------------------------------------------------------------------------- /Spoj Problems/shpath-shortestpath.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/Spoj Problems/shpath-shortestpath.py -------------------------------------------------------------------------------- /ZCO Codechef/SMART phone.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/ZCO Codechef/SMART phone.py -------------------------------------------------------------------------------- /ZCO Codechef/tournament.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/ZCO Codechef/tournament.py -------------------------------------------------------------------------------- /ZCO Codechef/variation.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/ZCO Codechef/variation.py -------------------------------------------------------------------------------- /ZCO Codechef/video game.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/ZCO Codechef/video game.py -------------------------------------------------------------------------------- /array/Ajinkya/ajinkya.txt: -------------------------------------------------------------------------------- 1 | /add your programs here 2 | -------------------------------------------------------------------------------- /array/Chinmay/chinamy.txt: -------------------------------------------------------------------------------- 1 | /chinmay -------------------------------------------------------------------------------- /array/Chinmay/test.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Chinmay/test.docx -------------------------------------------------------------------------------- /array/Kajal/kajal.txt: -------------------------------------------------------------------------------- 1 | /kajal 2 | -------------------------------------------------------------------------------- /array/Nagendra/Cyclically rotate an array by one.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Nagendra/Cyclically rotate an array by one.py -------------------------------------------------------------------------------- /array/Nagendra/Find the maximum and minimum element in an array.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Nagendra/Find the maximum and minimum element in an array.py -------------------------------------------------------------------------------- /array/Nagendra/Kth smallest element.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Nagendra/Kth smallest element.py -------------------------------------------------------------------------------- /array/Nagendra/Largest Sum Contiguous Subarray.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Nagendra/Largest Sum Contiguous Subarray.py -------------------------------------------------------------------------------- /array/Nagendra/Move all negative numbers to beginning and positive to end with constant extra space.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Nagendra/Move all negative numbers to beginning and positive to end with constant extra space.py -------------------------------------------------------------------------------- /array/Nagendra/Row with max 1s.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Nagendra/Row with max 1s.py -------------------------------------------------------------------------------- /array/Nagendra/Sort an array of 0s, 1s and 2s.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Nagendra/Sort an array of 0s, 1s and 2s.py -------------------------------------------------------------------------------- /array/Nagendra/Union of two arrays.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Nagendra/Union of two arrays.py -------------------------------------------------------------------------------- /array/Nagendra/nagendra.txt: -------------------------------------------------------------------------------- 1 | // nagendra 2 | -------------------------------------------------------------------------------- /array/Nagendra/reverse arry.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Nagendra/reverse arry.py -------------------------------------------------------------------------------- /array/Nayana_Bhoj/FirstNonRepeatingCharaterFromString.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Nayana_Bhoj/FirstNonRepeatingCharaterFromString.java -------------------------------------------------------------------------------- /array/Nayana_Bhoj/FirstRepeatingElementInArray.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Nayana_Bhoj/FirstRepeatingElementInArray.java -------------------------------------------------------------------------------- /array/Nayana_Bhoj/LeftRorateArrayBy1.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Nayana_Bhoj/LeftRorateArrayBy1.java -------------------------------------------------------------------------------- /array/Nayana_Bhoj/LeftRorateArrayByD.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Nayana_Bhoj/LeftRorateArrayByD.java -------------------------------------------------------------------------------- /array/Nayana_Bhoj/MaximumMinimumInArray.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Nayana_Bhoj/MaximumMinimumInArray.java -------------------------------------------------------------------------------- /array/Nayana_Bhoj/MoveZerosToEnd.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Nayana_Bhoj/MoveZerosToEnd.java -------------------------------------------------------------------------------- /array/Nayana_Bhoj/ProductOfArrayExceptSelf.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Nayana_Bhoj/ProductOfArrayExceptSelf.java -------------------------------------------------------------------------------- /array/Nayana_Bhoj/SmallestPositiveNumberInArray.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Nayana_Bhoj/SmallestPositiveNumberInArray.java -------------------------------------------------------------------------------- /array/Nayana_Bhoj/StocksBuySell.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Nayana_Bhoj/StocksBuySell.java -------------------------------------------------------------------------------- /array/Nayana_Bhoj/SubArraySumArray.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Nayana_Bhoj/SubArraySumArray.java -------------------------------------------------------------------------------- /array/Neeraj/CT triplets.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Neeraj/CT triplets.py -------------------------------------------------------------------------------- /array/Neeraj/Subarray with given sum.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Neeraj/Subarray with given sum.py -------------------------------------------------------------------------------- /array/Neeraj/neeraj.txt: -------------------------------------------------------------------------------- 1 | // neeraj -------------------------------------------------------------------------------- /array/Prajjwal/Max_sum_subarray.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Prajjwal/Max_sum_subarray.py -------------------------------------------------------------------------------- /array/Prajjwal/prajjawal.txt: -------------------------------------------------------------------------------- 1 | //prajjwal 2 | -------------------------------------------------------------------------------- /array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/README.md -------------------------------------------------------------------------------- /array/Ratndeep/Minimize the heights.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Ratndeep/Minimize the heights.py -------------------------------------------------------------------------------- /array/Ratndeep/best time to buy and sell.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Ratndeep/best time to buy and sell.py -------------------------------------------------------------------------------- /array/Ratndeep/convert array into zig zag fashion.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Ratndeep/convert array into zig zag fashion.py -------------------------------------------------------------------------------- /array/Ratndeep/finding missing number.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Ratndeep/finding missing number.py -------------------------------------------------------------------------------- /array/Ratndeep/kadane.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Ratndeep/kadane.py -------------------------------------------------------------------------------- /array/Ratndeep/koko eating banana.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Ratndeep/koko eating banana.py -------------------------------------------------------------------------------- /array/Ratndeep/largest number formed from array.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Ratndeep/largest number formed from array.py -------------------------------------------------------------------------------- /array/Ratndeep/next permutation.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Ratndeep/next permutation.py -------------------------------------------------------------------------------- /array/Ratndeep/one diff in adj of number.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Ratndeep/one diff in adj of number.py -------------------------------------------------------------------------------- /array/Ratndeep/ratndeep.txt: -------------------------------------------------------------------------------- 1 | // ratndeep 2 | -------------------------------------------------------------------------------- /array/Ratndeep/spirally traverse matrix.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Ratndeep/spirally traverse matrix.py -------------------------------------------------------------------------------- /array/Ratndeep/subarray with given sum.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Ratndeep/subarray with given sum.py -------------------------------------------------------------------------------- /array/Ratndeep/subsets.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Ratndeep/subsets.py -------------------------------------------------------------------------------- /array/Ratndeep/triplets_sum.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Ratndeep/triplets_sum.py -------------------------------------------------------------------------------- /array/Robin/Robin.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Robin/Robin.txt -------------------------------------------------------------------------------- /array/Robin/kadane.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Robin/kadane.cpp -------------------------------------------------------------------------------- /array/Robin/missing_number_array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Robin/missing_number_array.cpp -------------------------------------------------------------------------------- /array/Robin/rearrange_array_alternately.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Robin/rearrange_array_alternately.cpp -------------------------------------------------------------------------------- /array/Shivangi/shavangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /array/Shivangi/shivangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /array/Utkarsh/array/Search2Dmatrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Utkarsh/array/Search2Dmatrix.cpp -------------------------------------------------------------------------------- /array/Utkarsh/array/findDuplicate.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Utkarsh/array/findDuplicate.cpp -------------------------------------------------------------------------------- /array/Utkarsh/array/kth-smallest-element_in_unsorted_array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Utkarsh/array/kth-smallest-element_in_unsorted_array.cpp -------------------------------------------------------------------------------- /array/Utkarsh/array/maxAreaRectangle.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Utkarsh/array/maxAreaRectangle.cpp -------------------------------------------------------------------------------- /array/Utkarsh/array/middleOfThree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Utkarsh/array/middleOfThree.cpp -------------------------------------------------------------------------------- /array/Utkarsh/array/powerFucntion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Utkarsh/array/powerFucntion.cpp -------------------------------------------------------------------------------- /array/Utkarsh/array/printSortedMatrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Utkarsh/array/printSortedMatrix.cpp -------------------------------------------------------------------------------- /array/Utkarsh/array/sort012.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Utkarsh/array/sort012.cpp -------------------------------------------------------------------------------- /array/Utkarsh/array/spiralTraversalMatrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/array/Utkarsh/array/spiralTraversalMatrix.cpp -------------------------------------------------------------------------------- /array/Utkarsh/stunnerhash.txt: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /array/array.txt: -------------------------------------------------------------------------------- 1 | //array 2 | -------------------------------------------------------------------------------- /backtracking/Ajinkya/ajinkya.txt: -------------------------------------------------------------------------------- 1 | /add your programs here 2 | -------------------------------------------------------------------------------- /backtracking/Chinmay/chinamy.txt: -------------------------------------------------------------------------------- 1 | /chinmay -------------------------------------------------------------------------------- /backtracking/Kajal/kajal.txt: -------------------------------------------------------------------------------- 1 | /kajal 2 | -------------------------------------------------------------------------------- /backtracking/Nagendra/nagendra.txt: -------------------------------------------------------------------------------- 1 | // nagendra 2 | -------------------------------------------------------------------------------- /backtracking/Neeraj/neeraj.txt: -------------------------------------------------------------------------------- 1 | // neeraj -------------------------------------------------------------------------------- /backtracking/Prajjwal/prajjawal.txt: -------------------------------------------------------------------------------- 1 | //prajjwal 2 | -------------------------------------------------------------------------------- /backtracking/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/backtracking/README.md -------------------------------------------------------------------------------- /backtracking/Ratndeep/Knight's Tour Problem.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/backtracking/Ratndeep/Knight's Tour Problem.py -------------------------------------------------------------------------------- /backtracking/Ratndeep/nqueen problem.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/backtracking/Ratndeep/nqueen problem.py -------------------------------------------------------------------------------- /backtracking/Ratndeep/nqueen problem_col.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/backtracking/Ratndeep/nqueen problem_col.py -------------------------------------------------------------------------------- /backtracking/Ratndeep/rat in maze.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/backtracking/Ratndeep/rat in maze.py -------------------------------------------------------------------------------- /backtracking/Ratndeep/ratndeep.txt: -------------------------------------------------------------------------------- 1 | // ratndeep 2 | -------------------------------------------------------------------------------- /backtracking/Robin/Robin.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/backtracking/Robin/Robin.txt -------------------------------------------------------------------------------- /backtracking/Shivangi/shavangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /backtracking/Shivangi/shivangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /backtracking/backtracking.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/backtracking/backtracking.txt -------------------------------------------------------------------------------- /bitmagic/Ajinkya/ajinkya.txt: -------------------------------------------------------------------------------- 1 | /add your programs here 2 | -------------------------------------------------------------------------------- /bitmagic/Chinmay/chinamy.txt: -------------------------------------------------------------------------------- 1 | /chinmay -------------------------------------------------------------------------------- /bitmagic/Kajal/kajal.txt: -------------------------------------------------------------------------------- 1 | /kajal 2 | -------------------------------------------------------------------------------- /bitmagic/Nagendra/nagendra.txt: -------------------------------------------------------------------------------- 1 | // nagendra 2 | -------------------------------------------------------------------------------- /bitmagic/Neeraj/neeraj.txt: -------------------------------------------------------------------------------- 1 | // neeraj -------------------------------------------------------------------------------- /bitmagic/Prajjwal/prajjawal.txt: -------------------------------------------------------------------------------- 1 | //prajjwal 2 | -------------------------------------------------------------------------------- /bitmagic/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/bitmagic/README.md -------------------------------------------------------------------------------- /bitmagic/Ratndeep/Number Complement.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/bitmagic/Ratndeep/Number Complement.py -------------------------------------------------------------------------------- /bitmagic/Ratndeep/ratndeep.txt: -------------------------------------------------------------------------------- 1 | // ratndeep 2 | -------------------------------------------------------------------------------- /bitmagic/Robin/Robin.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/bitmagic/Robin/Robin.txt -------------------------------------------------------------------------------- /bitmagic/Shivangi/shavangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /bitmagic/Shivangi/shivangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /bitmagic/bitmagic.txt: -------------------------------------------------------------------------------- 1 | //bitmagic 2 | -------------------------------------------------------------------------------- /divide & conquer/Ajinkya/ajinkya.txt: -------------------------------------------------------------------------------- 1 | /add your programs here 2 | -------------------------------------------------------------------------------- /divide & conquer/Chinmay/chinamy.txt: -------------------------------------------------------------------------------- 1 | /chinmay -------------------------------------------------------------------------------- /divide & conquer/Kajal/kajal.txt: -------------------------------------------------------------------------------- 1 | /kajal 2 | -------------------------------------------------------------------------------- /divide & conquer/Nagendra/nagendra.txt: -------------------------------------------------------------------------------- 1 | // nagendra 2 | -------------------------------------------------------------------------------- /divide & conquer/Neeraj/neeraj.txt: -------------------------------------------------------------------------------- 1 | // neeraj -------------------------------------------------------------------------------- /divide & conquer/Prajjwal/prajjawal.txt: -------------------------------------------------------------------------------- 1 | //prajjwal 2 | -------------------------------------------------------------------------------- /divide & conquer/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/divide & conquer/README.md -------------------------------------------------------------------------------- /divide & conquer/Ratndeep/ratndeep.txt: -------------------------------------------------------------------------------- 1 | // ratndeep 2 | -------------------------------------------------------------------------------- /divide & conquer/Robin/Robin.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/divide & conquer/Robin/Robin.txt -------------------------------------------------------------------------------- /divide & conquer/Shivangi/shavangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /divide & conquer/Shivangi/shivangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /divide & conquer/divide comquer.txt: -------------------------------------------------------------------------------- 1 | divide conquer -------------------------------------------------------------------------------- /doubly Linkedlist/Kajal/kajal.txt: -------------------------------------------------------------------------------- 1 | /kajal 2 | -------------------------------------------------------------------------------- /doubly Linkedlist/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/doubly Linkedlist/README.md -------------------------------------------------------------------------------- /doubly Linkedlist/Ratndeep/first non-repeating character in a stream.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/doubly Linkedlist/Ratndeep/first non-repeating character in a stream.py -------------------------------------------------------------------------------- /doubly Linkedlist/Shivangi/shavangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /doubly Linkedlist/Shivangi/shivangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /doubly Linkedlist/pankaj/pankaj.txt: -------------------------------------------------------------------------------- 1 | //pankaj -------------------------------------------------------------------------------- /doubly Linkedlist/pratham/pratham.txt: -------------------------------------------------------------------------------- 1 | /pratham 2 | -------------------------------------------------------------------------------- /dynamic programming/Ajinkya/ajinkya.txt: -------------------------------------------------------------------------------- 1 | /add your programs here 2 | -------------------------------------------------------------------------------- /dynamic programming/Chinmay/chinamy.txt: -------------------------------------------------------------------------------- 1 | /chinmay -------------------------------------------------------------------------------- /dynamic programming/Kajal/kajal.txt: -------------------------------------------------------------------------------- 1 | /kajal 2 | -------------------------------------------------------------------------------- /dynamic programming/Nagendra/BF Negative weight cycle.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/dynamic programming/Nagendra/BF Negative weight cycle.py -------------------------------------------------------------------------------- /dynamic programming/Nagendra/matric chain mult.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/dynamic programming/Nagendra/matric chain mult.py -------------------------------------------------------------------------------- /dynamic programming/Nagendra/nagendra.txt: -------------------------------------------------------------------------------- 1 | // nagendra 2 | -------------------------------------------------------------------------------- /dynamic programming/Neeraj/neeraj.txt: -------------------------------------------------------------------------------- 1 | // neeraj -------------------------------------------------------------------------------- /dynamic programming/Prajjwal/prajjawal.txt: -------------------------------------------------------------------------------- 1 | //prajjwal 2 | -------------------------------------------------------------------------------- /dynamic programming/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/dynamic programming/README.md -------------------------------------------------------------------------------- /dynamic programming/Ratndeep/Edit Distance Between 2 Strings - The Levenshtein Distance.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/dynamic programming/Ratndeep/Edit Distance Between 2 Strings - The Levenshtein Distance.py -------------------------------------------------------------------------------- /dynamic programming/Ratndeep/cap2.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/dynamic programming/Ratndeep/cap2.py -------------------------------------------------------------------------------- /dynamic programming/Ratndeep/capgemini1.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/dynamic programming/Ratndeep/capgemini1.py -------------------------------------------------------------------------------- /dynamic programming/Ratndeep/equal sum subsets.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/dynamic programming/Ratndeep/equal sum subsets.py -------------------------------------------------------------------------------- /dynamic programming/Ratndeep/lcs.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/dynamic programming/Ratndeep/lcs.py -------------------------------------------------------------------------------- /dynamic programming/Ratndeep/ratndeep.txt: -------------------------------------------------------------------------------- 1 | // ratndeep 2 | -------------------------------------------------------------------------------- /dynamic programming/Robin/Robin.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/dynamic programming/Robin/Robin.txt -------------------------------------------------------------------------------- /dynamic programming/Shivangi/shavangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /dynamic programming/Shivangi/shivangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /dynamic programming/dp.txt: -------------------------------------------------------------------------------- 1 | dynamic prg -------------------------------------------------------------------------------- /dynamic programming/pankaj/pankaj.txt: -------------------------------------------------------------------------------- 1 | //pankaj -------------------------------------------------------------------------------- /dynamic programming/pratham/pratham.txt: -------------------------------------------------------------------------------- 1 | /pratham 2 | -------------------------------------------------------------------------------- /graph/Ajinkya/ajinkya.txt: -------------------------------------------------------------------------------- 1 | /add your programs here 2 | -------------------------------------------------------------------------------- /graph/Chinmay/chinamy.txt: -------------------------------------------------------------------------------- 1 | /chinmay -------------------------------------------------------------------------------- /graph/Kajal/kajal.txt: -------------------------------------------------------------------------------- 1 | /kajal 2 | -------------------------------------------------------------------------------- /graph/Nagendra/BFS.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/Nagendra/BFS.py -------------------------------------------------------------------------------- /graph/Nagendra/Detect cycle in an undirected graph.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/Nagendra/Detect cycle in an undirected graph.py -------------------------------------------------------------------------------- /graph/Nagendra/Detect_Cycle_in_a_Directed_Graph.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/Nagendra/Detect_Cycle_in_a_Directed_Graph.py -------------------------------------------------------------------------------- /graph/Nagendra/alien dictionary.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/Nagendra/alien dictionary.py -------------------------------------------------------------------------------- /graph/Nagendra/dfs.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/Nagendra/dfs.py -------------------------------------------------------------------------------- /graph/Nagendra/graph.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/Nagendra/graph.py -------------------------------------------------------------------------------- /graph/Nagendra/nagendra.txt: -------------------------------------------------------------------------------- 1 | // nagendra 2 | -------------------------------------------------------------------------------- /graph/Nagendra/topological sort.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/Nagendra/topological sort.py -------------------------------------------------------------------------------- /graph/Neeraj/neeraj.txt: -------------------------------------------------------------------------------- 1 | // neeraj -------------------------------------------------------------------------------- /graph/Prajjwal/prajjawal.txt: -------------------------------------------------------------------------------- 1 | //prajjwal 2 | -------------------------------------------------------------------------------- /graph/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/README.md -------------------------------------------------------------------------------- /graph/Ratndeep/Distance of nearest cell having 1.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/Ratndeep/Distance of nearest cell having 1.py -------------------------------------------------------------------------------- /graph/Ratndeep/X total shades.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/Ratndeep/X total shades.py -------------------------------------------------------------------------------- /graph/Ratndeep/alien dictionary.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/Ratndeep/alien dictionary.py -------------------------------------------------------------------------------- /graph/Ratndeep/count no. of strongly connected components.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/Ratndeep/count no. of strongly connected components.py -------------------------------------------------------------------------------- /graph/Ratndeep/cycle in directed graph.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/Ratndeep/cycle in directed graph.py -------------------------------------------------------------------------------- /graph/Ratndeep/dfs graph.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/Ratndeep/dfs graph.py -------------------------------------------------------------------------------- /graph/Ratndeep/find whether path exist.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/Ratndeep/find whether path exist.py -------------------------------------------------------------------------------- /graph/Ratndeep/flood fill algorithm.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/Ratndeep/flood fill algorithm.py -------------------------------------------------------------------------------- /graph/Ratndeep/number of islands by dfs.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/Ratndeep/number of islands by dfs.py -------------------------------------------------------------------------------- /graph/Ratndeep/ratndeep.txt: -------------------------------------------------------------------------------- 1 | // ratndeep 2 | -------------------------------------------------------------------------------- /graph/Ratndeep/rotten oranges.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/Ratndeep/rotten oranges.py -------------------------------------------------------------------------------- /graph/Ratndeep/sum of dependencies in a graph.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/Ratndeep/sum of dependencies in a graph.py -------------------------------------------------------------------------------- /graph/Ratndeep/topological sort.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/Ratndeep/topological sort.py -------------------------------------------------------------------------------- /graph/Ratndeep/unit area of largest region of 1's.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/Ratndeep/unit area of largest region of 1's.py -------------------------------------------------------------------------------- /graph/Robin/Robin.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/graph/Robin/Robin.txt -------------------------------------------------------------------------------- /graph/Shivangi/shavangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /graph/Shivangi/shivangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /graph/graph.txt: -------------------------------------------------------------------------------- 1 | //graph -------------------------------------------------------------------------------- /greedy/Ajinkya/ajinkya.txt: -------------------------------------------------------------------------------- 1 | /add your programs here 2 | -------------------------------------------------------------------------------- /greedy/Chinmay/chinamy.txt: -------------------------------------------------------------------------------- 1 | /chinmay -------------------------------------------------------------------------------- /greedy/Kajal/kajal.txt: -------------------------------------------------------------------------------- 1 | /kajal 2 | -------------------------------------------------------------------------------- /greedy/Nagendra/EZDIJKST .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/greedy/Nagendra/EZDIJKST .py -------------------------------------------------------------------------------- /greedy/Nagendra/Huffman_coding.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/greedy/Nagendra/Huffman_coding.py -------------------------------------------------------------------------------- /greedy/Nagendra/Job Sequencing Problem.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/greedy/Nagendra/Job Sequencing Problem.py -------------------------------------------------------------------------------- /greedy/Nagendra/SHPATH - The Shortest Path.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/greedy/Nagendra/SHPATH - The Shortest Path.py -------------------------------------------------------------------------------- /greedy/Nagendra/TRAFFICN - Traffic Network.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/greedy/Nagendra/TRAFFICN - Traffic Network.py -------------------------------------------------------------------------------- /greedy/Nagendra/The Escape .py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/greedy/Nagendra/The Escape .py -------------------------------------------------------------------------------- /greedy/Nagendra/mini spanning tree.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/greedy/Nagendra/mini spanning tree.py -------------------------------------------------------------------------------- /greedy/Nagendra/nagendra.txt: -------------------------------------------------------------------------------- 1 | // nagendra 2 | -------------------------------------------------------------------------------- /greedy/Neeraj/neeraj.txt: -------------------------------------------------------------------------------- 1 | // neeraj -------------------------------------------------------------------------------- /greedy/Prajjwal/prajjawal.txt: -------------------------------------------------------------------------------- 1 | //prajjwal 2 | -------------------------------------------------------------------------------- /greedy/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/greedy/README.md -------------------------------------------------------------------------------- /greedy/Ratndeep/activity selection 2.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/greedy/Ratndeep/activity selection 2.py -------------------------------------------------------------------------------- /greedy/Ratndeep/activityselection.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/greedy/Ratndeep/activityselection.py -------------------------------------------------------------------------------- /greedy/Ratndeep/coin piles.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/greedy/Ratndeep/coin piles.py -------------------------------------------------------------------------------- /greedy/Ratndeep/huffman-encoding.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/greedy/Ratndeep/huffman-encoding.py -------------------------------------------------------------------------------- /greedy/Ratndeep/job sequencing.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/greedy/Ratndeep/job sequencing.py -------------------------------------------------------------------------------- /greedy/Ratndeep/largest number possible.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/greedy/Ratndeep/largest number possible.py -------------------------------------------------------------------------------- /greedy/Ratndeep/max_toys.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/greedy/Ratndeep/max_toys.py -------------------------------------------------------------------------------- /greedy/Ratndeep/n meeting room.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/greedy/Ratndeep/n meeting room.py -------------------------------------------------------------------------------- /greedy/Ratndeep/n meeting room2.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/greedy/Ratndeep/n meeting room2.py -------------------------------------------------------------------------------- /greedy/Ratndeep/pages fault in LRU.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/greedy/Ratndeep/pages fault in LRU.py -------------------------------------------------------------------------------- /greedy/Ratndeep/ratndeep.txt: -------------------------------------------------------------------------------- 1 | // ratndeep 2 | -------------------------------------------------------------------------------- /greedy/Robin/Robin.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/greedy/Robin/Robin.txt -------------------------------------------------------------------------------- /greedy/Shivangi/shavangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /greedy/Shivangi/shivangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /greedy/greedy.txt: -------------------------------------------------------------------------------- 1 | // greedy -------------------------------------------------------------------------------- /greedy/largest number possible.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/greedy/largest number possible.py -------------------------------------------------------------------------------- /hashing/Ajinkya/ajinkya.txt: -------------------------------------------------------------------------------- 1 | /add your programs here 2 | -------------------------------------------------------------------------------- /hashing/Chinmay/chinamy.txt: -------------------------------------------------------------------------------- 1 | /chinmay -------------------------------------------------------------------------------- /hashing/Kajal/kajal.txt: -------------------------------------------------------------------------------- 1 | /kajal 2 | -------------------------------------------------------------------------------- /hashing/Nagendra/nagendra.txt: -------------------------------------------------------------------------------- 1 | // nagendra 2 | -------------------------------------------------------------------------------- /hashing/Neeraj/neeraj.txt: -------------------------------------------------------------------------------- 1 | // neeraj -------------------------------------------------------------------------------- /hashing/Prajjwal/prajjawal.txt: -------------------------------------------------------------------------------- 1 | //prajjwal 2 | -------------------------------------------------------------------------------- /hashing/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/hashing/README.md -------------------------------------------------------------------------------- /hashing/Ratndeep/ratndeep.txt: -------------------------------------------------------------------------------- 1 | // ratndeep 2 | -------------------------------------------------------------------------------- /hashing/Ratndeep/searching.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/hashing/Ratndeep/searching.py -------------------------------------------------------------------------------- /hashing/Robin/Robin.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/hashing/Robin/Robin.txt -------------------------------------------------------------------------------- /hashing/Shivangi/shavangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /hashing/Shivangi/shivangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /hashing/hashing.txt: -------------------------------------------------------------------------------- 1 | // hashing -------------------------------------------------------------------------------- /heap/Ajinkya/ajinkya.txt: -------------------------------------------------------------------------------- 1 | /add your programs here 2 | -------------------------------------------------------------------------------- /heap/Chinmay/chinamy.txt: -------------------------------------------------------------------------------- 1 | /chinmay -------------------------------------------------------------------------------- /heap/Kajal/kajal.txt: -------------------------------------------------------------------------------- 1 | /kajal 2 | -------------------------------------------------------------------------------- /heap/Nagendra/Binary heap.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/heap/Nagendra/Binary heap.py -------------------------------------------------------------------------------- /heap/Nagendra/nagendra.txt: -------------------------------------------------------------------------------- 1 | // nagendra 2 | -------------------------------------------------------------------------------- /heap/Neeraj/neeraj.txt: -------------------------------------------------------------------------------- 1 | // neeraj -------------------------------------------------------------------------------- /heap/Prajjwal/prajjawal.txt: -------------------------------------------------------------------------------- 1 | //prajjwal 2 | -------------------------------------------------------------------------------- /heap/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/heap/README.md -------------------------------------------------------------------------------- /heap/Ratndeep/is binary tree max heap.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/heap/Ratndeep/is binary tree max heap.py -------------------------------------------------------------------------------- /heap/Ratndeep/min_heap.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/heap/Ratndeep/min_heap.py -------------------------------------------------------------------------------- /heap/Ratndeep/min_heap_without_lib.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/heap/Ratndeep/min_heap_without_lib.py -------------------------------------------------------------------------------- /heap/Ratndeep/ratndeep.txt: -------------------------------------------------------------------------------- 1 | // ratndeep 2 | -------------------------------------------------------------------------------- /heap/Robin/Robin.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/heap/Robin/Robin.txt -------------------------------------------------------------------------------- /heap/Shivangi/shavangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /heap/Shivangi/shivangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /heap/heap.txt: -------------------------------------------------------------------------------- 1 | //heap -------------------------------------------------------------------------------- /img/Linkedlist.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/img/Linkedlist.png -------------------------------------------------------------------------------- /img/Stability.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/img/Stability.jpg -------------------------------------------------------------------------------- /img/traffic1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/img/traffic1.png -------------------------------------------------------------------------------- /linkedlist/Ajinkya/ajinkya.txt: -------------------------------------------------------------------------------- 1 | /add your programs here 2 | -------------------------------------------------------------------------------- /linkedlist/Chinmay/chinamy.txt: -------------------------------------------------------------------------------- 1 | /chinmay -------------------------------------------------------------------------------- /linkedlist/Kajal/kajal.txt: -------------------------------------------------------------------------------- 1 | /kajal 2 | -------------------------------------------------------------------------------- /linkedlist/Nagendra/Mail System Design.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/Nagendra/Mail System Design.py -------------------------------------------------------------------------------- /linkedlist/Nagendra/ll.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/Nagendra/ll.py -------------------------------------------------------------------------------- /linkedlist/Nagendra/loop -Reverse a linked list.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/Nagendra/loop -Reverse a linked list.py -------------------------------------------------------------------------------- /linkedlist/Nagendra/nagendra.txt: -------------------------------------------------------------------------------- 1 | // nagendra 2 | -------------------------------------------------------------------------------- /linkedlist/Neeraj/neeraj.txt: -------------------------------------------------------------------------------- 1 | // neeraj -------------------------------------------------------------------------------- /linkedlist/Prajjwal/prajjawal.txt: -------------------------------------------------------------------------------- 1 | //prajjwal 2 | -------------------------------------------------------------------------------- /linkedlist/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/README.md -------------------------------------------------------------------------------- /linkedlist/Ratndeep/Delete nodes having greater value on right.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/Ratndeep/Delete nodes having greater value on right.py -------------------------------------------------------------------------------- /linkedlist/Ratndeep/Multipy two Linkedlist.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/Ratndeep/Multipy two Linkedlist.py -------------------------------------------------------------------------------- /linkedlist/Ratndeep/Segregate even and odd nodes in a Linked List.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/Ratndeep/Segregate even and odd nodes in a Linked List.py -------------------------------------------------------------------------------- /linkedlist/Ratndeep/cloning with random pointer.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/Ratndeep/cloning with random pointer.py -------------------------------------------------------------------------------- /linkedlist/Ratndeep/find insertion point.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/Ratndeep/find insertion point.py -------------------------------------------------------------------------------- /linkedlist/Ratndeep/mail system design.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/Ratndeep/mail system design.py -------------------------------------------------------------------------------- /linkedlist/Ratndeep/merge k sorted linkeedlist.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/Ratndeep/merge k sorted linkeedlist.py -------------------------------------------------------------------------------- /linkedlist/Ratndeep/middle node.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/Ratndeep/middle node.py -------------------------------------------------------------------------------- /linkedlist/Ratndeep/nth node from end.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/Ratndeep/nth node from end.py -------------------------------------------------------------------------------- /linkedlist/Ratndeep/partition list.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/Ratndeep/partition list.py -------------------------------------------------------------------------------- /linkedlist/Ratndeep/ratndeep.txt: -------------------------------------------------------------------------------- 1 | // ratndeep 2 | -------------------------------------------------------------------------------- /linkedlist/Ratndeep/reverse.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/Ratndeep/reverse.py -------------------------------------------------------------------------------- /linkedlist/Ratndeep/reverseingroups.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/Ratndeep/reverseingroups.py -------------------------------------------------------------------------------- /linkedlist/Ratndeep/rotate.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/Ratndeep/rotate.py -------------------------------------------------------------------------------- /linkedlist/Robin/Robin.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/Robin/Robin.txt -------------------------------------------------------------------------------- /linkedlist/Shivangi/shavangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /linkedlist/Shivangi/shivangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /linkedlist/Utkarsh/linkedList/add1ToLinkedList.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/Utkarsh/linkedList/add1ToLinkedList.cpp -------------------------------------------------------------------------------- /linkedlist/Utkarsh/linkedList/intersectionOfSortedList.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/Utkarsh/linkedList/intersectionOfSortedList.cpp -------------------------------------------------------------------------------- /linkedlist/Utkarsh/linkedList/moveLastElementToFront.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/Utkarsh/linkedList/moveLastElementToFront.cpp -------------------------------------------------------------------------------- /linkedlist/Utkarsh/linkedList/reverseLinkedList.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/linkedlist/Utkarsh/linkedList/reverseLinkedList.cpp -------------------------------------------------------------------------------- /linkedlist/Utkarsh/stunnerhash.txt: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /linkedlist/linkedlist.txt: -------------------------------------------------------------------------------- 1 | //linkedlist 2 | -------------------------------------------------------------------------------- /more on arrays/Chinmay/chinamy.txt: -------------------------------------------------------------------------------- 1 | /chinmay -------------------------------------------------------------------------------- /more on arrays/Nagendra/nagendra.txt: -------------------------------------------------------------------------------- 1 | // nagendra 2 | -------------------------------------------------------------------------------- /more on arrays/Neeraj/neeraj.txt: -------------------------------------------------------------------------------- 1 | // neeraj -------------------------------------------------------------------------------- /more on arrays/Prajjwal/prajjawal.txt: -------------------------------------------------------------------------------- 1 | //prajjwal 2 | -------------------------------------------------------------------------------- /more on arrays/Ratndeep/ratndeep.txt: -------------------------------------------------------------------------------- 1 | // ratndeep 2 | -------------------------------------------------------------------------------- /more on arrays/Robin/Robin.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/more on arrays/Robin/Robin.txt -------------------------------------------------------------------------------- /more on arrays/more on arrays.txt: -------------------------------------------------------------------------------- 1 | // arrrays 2 | -------------------------------------------------------------------------------- /more on strings/Chinmay/chinamy.txt: -------------------------------------------------------------------------------- 1 | /chinmay -------------------------------------------------------------------------------- /more on strings/Nagendra/nagendra.txt: -------------------------------------------------------------------------------- 1 | // nagendra 2 | -------------------------------------------------------------------------------- /more on strings/Neeraj/neeraj.txt: -------------------------------------------------------------------------------- 1 | // neeraj -------------------------------------------------------------------------------- /more on strings/Prajjwal/prajjawal.txt: -------------------------------------------------------------------------------- 1 | //prajjwal 2 | -------------------------------------------------------------------------------- /more on strings/Ratndeep/ratndeep.txt: -------------------------------------------------------------------------------- 1 | // ratndeep 2 | -------------------------------------------------------------------------------- /more on strings/Robin/Robin.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/more on strings/Robin/Robin.txt -------------------------------------------------------------------------------- /more on strings/more on string.txt: -------------------------------------------------------------------------------- 1 | // more on string 2 | -------------------------------------------------------------------------------- /more on tree/Chinmay/chinamy.txt: -------------------------------------------------------------------------------- 1 | /chinmay -------------------------------------------------------------------------------- /more on tree/Nagendra/nagendra.txt: -------------------------------------------------------------------------------- 1 | // nagendra 2 | -------------------------------------------------------------------------------- /more on tree/Neeraj/neeraj.txt: -------------------------------------------------------------------------------- 1 | // neeraj -------------------------------------------------------------------------------- /more on tree/Prajjwal/prajjawal.txt: -------------------------------------------------------------------------------- 1 | //prajjwal 2 | -------------------------------------------------------------------------------- /more on tree/Ratndeep/ratndeep.txt: -------------------------------------------------------------------------------- 1 | // ratndeep 2 | -------------------------------------------------------------------------------- /more on tree/Robin/Robin.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/more on tree/Robin/Robin.txt -------------------------------------------------------------------------------- /more on tree/more on trees.txt: -------------------------------------------------------------------------------- 1 | // trees -------------------------------------------------------------------------------- /pepcoding/Ratndeep/Basics/all prime.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/Basics/all prime.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/Basics/count digits.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/Basics/count digits.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/Basics/fibonacci.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/Basics/fibonacci.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/Basics/grading.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/Basics/grading.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/Basics/inverse.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/Basics/inverse.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/Basics/pattern.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/Basics/pattern.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/Basics/prime factorization.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/Basics/prime factorization.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/Basics/prime.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/Basics/prime.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/Basics/pythagorean triplet.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/Basics/pythagorean triplet.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/Basics/reverse number.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/Basics/reverse number.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/Basics/rotate number.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/Basics/rotate number.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/functions and arrays/sum fo two numbers.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/functions and arrays/sum fo two numbers.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/pattern/pattern 17.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/pattern/pattern 17.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/pattern/pattern 18.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/pattern/pattern 18.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/pattern/pattern 19.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/pattern/pattern 19.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/pattern/pattern 20.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/pattern/pattern 20.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/pattern/pattern1.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/pattern/pattern1.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/pattern/pattern10.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/pattern/pattern10.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/pattern/pattern11.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/pattern/pattern11.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/pattern/pattern12.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/pattern/pattern12.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/pattern/pattern13.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/pattern/pattern13.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/pattern/pattern14.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/pattern/pattern14.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/pattern/pattern15.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/pattern/pattern15.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/pattern/pattern16.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/pattern/pattern16.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/pattern/pattern2.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/pattern/pattern2.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/pattern/pattern3.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/pattern/pattern3.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/pattern/pattern4.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/pattern/pattern4.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/pattern/pattern5.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/pattern/pattern5.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/pattern/pattern6.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/pattern/pattern6.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/pattern/pattern7.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/pattern/pattern7.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/pattern/pattern8.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/pattern/pattern8.java -------------------------------------------------------------------------------- /pepcoding/Ratndeep/pattern/pattern9.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/pepcoding/Ratndeep/pattern/pattern9.java -------------------------------------------------------------------------------- /recursion/Ajinkya/ajinkya.txt: -------------------------------------------------------------------------------- 1 | /add your programs here 2 | -------------------------------------------------------------------------------- /recursion/Chinmay/chinamy.txt: -------------------------------------------------------------------------------- 1 | /chinmay -------------------------------------------------------------------------------- /recursion/Kajal/kajal.txt: -------------------------------------------------------------------------------- 1 | /kajal 2 | -------------------------------------------------------------------------------- /recursion/Nagendra/nagendra.txt: -------------------------------------------------------------------------------- 1 | // nagendra 2 | -------------------------------------------------------------------------------- /recursion/Neeraj/neeraj.txt: -------------------------------------------------------------------------------- 1 | // neeraj -------------------------------------------------------------------------------- /recursion/Prajjwal/prajjawal.txt: -------------------------------------------------------------------------------- 1 | //prajjwal 2 | -------------------------------------------------------------------------------- /recursion/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/recursion/README.md -------------------------------------------------------------------------------- /recursion/Ratndeep/ratndeep.txt: -------------------------------------------------------------------------------- 1 | // ratndeep 2 | -------------------------------------------------------------------------------- /recursion/Robin/Robin.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/recursion/Robin/Robin.txt -------------------------------------------------------------------------------- /recursion/Shivangi/shavangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /recursion/Shivangi/shivangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /recursion/recursion.txt: -------------------------------------------------------------------------------- 1 | // recursion -------------------------------------------------------------------------------- /segment tree/Kajal/kajal.txt: -------------------------------------------------------------------------------- 1 | /kajal 2 | -------------------------------------------------------------------------------- /segment tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/segment tree/README.md -------------------------------------------------------------------------------- /segment tree/Ratndeep/sum of range & updation in logn.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/segment tree/Ratndeep/sum of range & updation in logn.py -------------------------------------------------------------------------------- /segment tree/Shivangi/shavangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /segment tree/Shivangi/shivangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /sorting/Stability in sorting algorithms.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/sorting/Stability in sorting algorithms.docx -------------------------------------------------------------------------------- /sorting/bubble sort.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/sorting/bubble sort.py -------------------------------------------------------------------------------- /sorting/insertion sort.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/sorting/insertion sort.py -------------------------------------------------------------------------------- /sorting/merge sort.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/sorting/merge sort.py -------------------------------------------------------------------------------- /sorting/quick sort.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/sorting/quick sort.py -------------------------------------------------------------------------------- /sorting/selection sort.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/sorting/selection sort.py -------------------------------------------------------------------------------- /stack & queue/Ajinkya/ajinkya.txt: -------------------------------------------------------------------------------- 1 | /add your programs here 2 | -------------------------------------------------------------------------------- /stack & queue/Chinmay/chinamy.txt: -------------------------------------------------------------------------------- 1 | /chinmay -------------------------------------------------------------------------------- /stack & queue/Kajal/kajal.txt: -------------------------------------------------------------------------------- 1 | /kajal 2 | -------------------------------------------------------------------------------- /stack & queue/Nagendra/nagendra.txt: -------------------------------------------------------------------------------- 1 | // nagendra 2 | -------------------------------------------------------------------------------- /stack & queue/Neeraj/neeraj.txt: -------------------------------------------------------------------------------- 1 | // neeraj -------------------------------------------------------------------------------- /stack & queue/Prajjwal/prajjawal.txt: -------------------------------------------------------------------------------- 1 | //prajjwal 2 | -------------------------------------------------------------------------------- /stack & queue/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/stack & queue/README.md -------------------------------------------------------------------------------- /stack & queue/Ratndeep/immediate last element +template.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/stack & queue/Ratndeep/immediate last element +template.py -------------------------------------------------------------------------------- /stack & queue/Ratndeep/ratndeep.txt: -------------------------------------------------------------------------------- 1 | // ratndeep 2 | -------------------------------------------------------------------------------- /stack & queue/Robin/Robin.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/stack & queue/Robin/Robin.txt -------------------------------------------------------------------------------- /stack & queue/Shivangi/shavangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /stack & queue/Shivangi/shivangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /stack & queue/stack&queue.txt: -------------------------------------------------------------------------------- 1 | // stack and queue -------------------------------------------------------------------------------- /string/Ajinkya/ajinkya.txt: -------------------------------------------------------------------------------- 1 | /add your programs here 2 | -------------------------------------------------------------------------------- /string/Chinmay/chinamy.txt: -------------------------------------------------------------------------------- 1 | /chinmay -------------------------------------------------------------------------------- /string/Kajal/kajal.txt: -------------------------------------------------------------------------------- 1 | /kajal 2 | -------------------------------------------------------------------------------- /string/Nagendra/nagendra.txt: -------------------------------------------------------------------------------- 1 | // nagendra 2 | -------------------------------------------------------------------------------- /string/Nayana/MinimumWindowSubstring.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/string/Nayana/MinimumWindowSubstring.java -------------------------------------------------------------------------------- /string/Nayana/nayana_bhoj: -------------------------------------------------------------------------------- 1 | //nayana_bhoj -------------------------------------------------------------------------------- /string/Neeraj/neeraj.txt: -------------------------------------------------------------------------------- 1 | // neeraj -------------------------------------------------------------------------------- /string/Prajjwal/prajjawal.txt: -------------------------------------------------------------------------------- 1 | //prajjwal 2 | -------------------------------------------------------------------------------- /string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/string/README.md -------------------------------------------------------------------------------- /string/Ratndeep/first non-repeating character in string.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/string/Ratndeep/first non-repeating character in string.py -------------------------------------------------------------------------------- /string/Ratndeep/longest palindrome is string.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/string/Ratndeep/longest palindrome is string.py -------------------------------------------------------------------------------- /string/Ratndeep/ratndeep.txt: -------------------------------------------------------------------------------- 1 | // ratndeep 2 | -------------------------------------------------------------------------------- /string/Ratndeep/reverse.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/string/Ratndeep/reverse.py -------------------------------------------------------------------------------- /string/Ratndeep/string_permutation.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/string/Ratndeep/string_permutation.py -------------------------------------------------------------------------------- /string/Robin/Robin.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/string/Robin/Robin.txt -------------------------------------------------------------------------------- /string/Shivangi/shavangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /string/Shivangi/shivangi.txt: -------------------------------------------------------------------------------- 1 | /workspace -------------------------------------------------------------------------------- /string/string.txt: -------------------------------------------------------------------------------- 1 | // string -------------------------------------------------------------------------------- /tree/Chinmay/chinamy.txt: -------------------------------------------------------------------------------- 1 | /chinmay -------------------------------------------------------------------------------- /tree/Nagendra/nagendra.txt: -------------------------------------------------------------------------------- 1 | // nagendra 2 | -------------------------------------------------------------------------------- /tree/Neeraj/neeraj.txt: -------------------------------------------------------------------------------- 1 | // neeraj -------------------------------------------------------------------------------- /tree/Prajjwal/prajjawal.txt: -------------------------------------------------------------------------------- 1 | //prajjwal 2 | -------------------------------------------------------------------------------- /tree/Ratndeep/bottom view of bst.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/tree/Ratndeep/bottom view of bst.py -------------------------------------------------------------------------------- /tree/Ratndeep/clone tree with random pointers.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/tree/Ratndeep/clone tree with random pointers.py -------------------------------------------------------------------------------- /tree/Ratndeep/evaluation of expression tree.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/tree/Ratndeep/evaluation of expression tree.py -------------------------------------------------------------------------------- /tree/Ratndeep/is tree bst.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/tree/Ratndeep/is tree bst.py -------------------------------------------------------------------------------- /tree/Ratndeep/k distance from root.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/tree/Ratndeep/k distance from root.py -------------------------------------------------------------------------------- /tree/Ratndeep/left_View of tree.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/tree/Ratndeep/left_View of tree.py -------------------------------------------------------------------------------- /tree/Ratndeep/make tree by expression.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/tree/Ratndeep/make tree by expression.py -------------------------------------------------------------------------------- /tree/Ratndeep/print min from bst.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/tree/Ratndeep/print min from bst.py -------------------------------------------------------------------------------- /tree/Ratndeep/ratndeep.txt: -------------------------------------------------------------------------------- 1 | // ratndeep 2 | -------------------------------------------------------------------------------- /tree/Robin/Robin.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Ratndeepk/Competitive-Programming/HEAD/tree/Robin/Robin.txt -------------------------------------------------------------------------------- /tree/tree.txt: -------------------------------------------------------------------------------- 1 | //tree 2 | --------------------------------------------------------------------------------