Solutions to all the questions I solved during the Competitive programming course with Coding Ninjas.
This Repository Contains all my codes which I wrote during the competitive programming course with Coding Ninjas (PS: For some of the questions you may like to check out the commit history to know how did I proceed step by step for that question)
Copying and pasting the code from this repo to the CN's console won't help you in the long run.
Merge sort is better than selection sort
In bubble sort we compare the first two elements then the next two elements.. and so on, multiple times. So the time complexity of bubble sort is O(n^2).
Time complexity of insertion sort is O(n^2) because it inserts the elements of the array into the sorted part of the array iteratively.
Selection sort is also of the order of n^2 because the smallest element is selected from.the unsorted array and swapped with the leftmost element and that element becomes the part of the sorted array.
For binary search, the time complexity is O(log(n)), because .---->watch theoretical analysis - recursive algorithm in time and space complexity analysis lecture.
Time complexity of merge sort is O(n*log(n)). Because here we divide our array into.two parts and sort them separately and then merge them.
Time and space complexity analysis is very important lecture. kadane's algorithm video lecture is very important too. it has been asked in many popular companies.
Set is implemented in c++ using a balanced binary search tree. it takes log(n) time to find an element in a set or in binary search tree.
Map also uses a binary search tree in the backend. it also takes log(n) time for insertion, deletion, and finding as well, in this way it is different from an unordered map. unordered map is implemented using hashtable. In an unordered map, finding, inserting, and deletion takes O(1) time in average case and O(n) in worst case. worst case bohot kam aata hai. mostly average case hi use hota hai, to in general time complexity for an unordered map is considered to be of the order of 1.
Jab indexes and elements ko compare karne ka man kare aur aisa lag raha ho ki tumhara solution order of n square time lega then merge sort k baare mei sochna.
For flipping the ith bit we use xor operator (^). (edited)
Tries are the datastructures which are generally used for XOR operations.
The factor that we use to iterate in a fenwick tree is
x&(-x). where x is the index of the current node.
The time complexity of Sieve Of Eratosthenes is Nlog(log(N))
The time complexity of Euclid's algorithm for finding the GCD of two numbers is
log2(max(a, b)), where a and b are the numbers whose GCD is to be find out.
Diophantine Equations-> ax+by=c , this equation will have integral solution only when the gcd(a, b) divides c.
Multiplicative Modulo Inverse ->
(A.B)+(m.Q)=1-> Now according to extended euclid algorithm, this equation will have integral solution only when gcd(A, m) divides 1, i.e.
gcd(A, m)==1. Which in turn means that A and m should be Coprime. Hence we can say that,
(A.B)+(m.Q)=gcd(A, m). Its code can be found here.
If a number
Nis written in the form
a, b, c, ..... , kare non negative integers and
p1, p2, p3....pnare prime numbers, then the number
Nwill have exactly
(a+1)*(b+1)*(c+1)*...*(k+1)number of divisors.
Euler's Totient Function:
1<=m and n and m are coprime that isgcd(m, n)==1.
Φ(a.b)=Φ(a)*Φ(b), on the condition that a and b are coprime, i.e.
ncan be expressed in the form of its prime factors, i.e.
n=p1^a*p2^b*p3^c.....pt^k. So according to the property of Euler totient function, we can write
Φ(n)=Φ(p1^a)Φ(p2^b)Φ(p3^c)....Φ(pt^k). Now lets talk about Φ(p^a). Here, according to the definition of Euler's Totient function, Φ(p^a) is the number of
m and p^aare coprime and m belongs to [1, m). Now, since p is a prime, so
p, 2p, 3p, 4p..... up to p^(a-1)are those numbers which are not coprime with p^a. so we can write:
Φ(p^a)=p^a-(total elements not coprime to p^a). i.e.
Φ(p^a)=p^a(1-(1/p)). Finally we can write that,
Φ(n)=Φ(p1^a)Φ(p2^b)Φ(p3^c)....Φ(pt^k), which implies
Φ(n)=p1^a(1-(1/p1))*p2^b(1-(1/p2))*p3^c(1-(1/p3)).....pt^k(1-(1/pt)). and Finally we have
Φ(n)=n*(1-(1/p1))*(1-(1/p2))*(1-(1/p3))*....(1-(1/pt)), where t is the number of distinct prime factors.
LCM(a, n)=(a*n)/GCD(a, n)
Fermat's Little Theorem:
a^p≡aon the condition of %p, now dividing by a on both sides, we get
a^(p-1)≡1on the condition of %p. hence
Nth root of unity,
Wn=pow(e, (2*pi)/n). and also
If you have got an optimized solution to a problem or, lets say, the existing solution is failing on some test cases and you got a working solution, then there is really a high chance of getting you pull request being accepted. Note: If you have got an optimised solution, but the existing solution is also working, then: 1. Make another file in the corresponding folder' 2. Name it
--Optimized.cpp. for example, if the problem name is
Angry Children, then name of the file which will contain the optimized code should be
angry_children-parikshit_singh-Optimized.cpp3. Generate a pull request and wait.