Tag: #100DaysofCode
-
Day 23
It is day 23 today. I messed up a bit with the numbering because I accidentally forgot to publish the day 19 draft. So, today I did a problem called Largest Mountain and I almost solved it on my own. Almost! one interesting thing I got to learn today was that we don’t necessarily need…
-
Day 19
I finally reached one of the most important topics in modern programming, OOPS OOP is a really sought after thing and every interviewer will be impressed if a candidate shows strong understanding of object oriented programming concepts. I saw and implemented classes constructors encapsulation inheritance polymorphism using various examples and cases. I found OOP interesting,…
-
Day 22
Today I continued with the streak by moving on to the Triplets problem and seeing various approaches that could’ve been taken but weren’t, in favor of a more efficient one. Got stuck for a lot of time and I guess I could’ve done better. But, no problem, practice makes perfect!
-
Day 21
Wohoo 21 Days!!! So, yesterday I started the DSA course on udemy. I started with revisiting Vectors and basic functions in vectors. Then, I also saw vector of a vector, i.e., 2D vector. Then, saw the PairSum problem and FizzBuzz problem. It was pretty fun! Also, yesterday was even more fun because I submitted my…
-
Day 20
Yesterday, I finished linked-lists and their various operations, like insertion, deletion, etc. Also, I have purchased a course on DSA by Prateek Narang on Udemy to improve my existing knowledge and problem-solving, so I’ll continue with its curriculum henceforth.
-
Day 18
Yesterday, I did a few more problems on recursion and started with vectors (although I’m still facing a lot of issues understanding how to approach certain problems… but I’m sure I’ll get there soon enough with practice) => remove duplicates => shift all x to end of string => find all possible substrings of a…
-
Day 17
Today, I did a few more problems using recursion. > Check if array is sorted or not > Print Natural Numbers given N (ascending and descending) > Find occurrence of a Number in an Array (both, first as well as last) (Edit) > Reverse a string > Replacing all occurrences of ‘pi’ in a string…
-
Day 15 (Continued)
Today, I learnt the concept behind the Sieve of Eratosthenes and tried a few applications of it like finding all the prime numbers between 1 and N Then, I saw the inclusion-exclusion Principle and the Euclid Algorithm to find the GCD of two numbers A and B.
-
Day 7 (CONTINUED)
I had been sick during the last week as a result of which I spent most of my time resting and bingeing. So, after successfully wasting one week… I’m back on track from today onwards. I got myself introduced to 2D arrays today and performed basic input/output operations and Searching for a particular element. I…
-
Day 4
Today was a rather hectic day. Yet, I managed to squeeze in at least 45-50 mins for this. I learned about Subarrays and Subsequences and solved a few problems on them. Actually I’m really proud of myself right now because I solved an array problem that was asked in a Google Kickstart Competition, all by…
GALA CODES 