Skip to content

annshiv/100day-coding-challenge

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

My 100-days-coding-challenge

Why

Because I need some structure! .This will help me take steps to build my portfolio, friends, and confidence as I aim for the next level in my career as a developer.

Schedule / What I did

Day 1: Start -- Learnt Recursion & also solved some problems in HackerRank on Recursion part,

Day 1 Notes

Day 2: Learnt Big O notation & Time complexity.also, uploaded my solved HackerRank problem solutions.

Day 2 Notes

Day 3: learnt about "Bit wise operators"

Day 3 Notes

Day 4 learnt about "Stack"

       - Introduction of stack
       - Application of stack
       - Implementation of stact

Day 4 notes

Day 5 Learnt about stack implementaion

      - Stack using infix to postfix
      - Using stack to reverse a string

Day 5 notes

Day 6

      - Evaluation of postfix expression(single digit expression)
      - Expression 2 (Integer contains with mutible digits)

Day 6 notes

Day 7 Learnt about Queue

      - Introduction to queue
      - Application of Queue data-structure
      - HeapQ or heapQueue
      - Queue implementation using list
      - Queue implementation using collection.Deque
      - Queue implementation using queue.Queue

Day 7 notes

Day 8

      - Queue using stacks
      - Reversing a Queue
      - Reversing a Queue using recursion

Day 8 notes

Day 9

      - Reversing the first k element
      - Sorting a Queue
      - Interleave the first half of Queue with second half

Day 9 notes

Day 10

      - Introduction to Linked List
      - Implementation of singly linked list
      - Implementation of doubly linked list
      - Advandage and disadvantages of linked list

Day 10 notes

Day 11

      - Circular Linked list
      - Pros & Cons in Circular Linked list
      - Insertion in singly Linked list
      - Insertion in Doubly Linked list

Day 11 notes

Day 12

      - Circular singly linked list
      - Implementation of circular singly linked list

Day 12 notes

Day 13

      - Detect Loop in Linked List
      - Loop detection using floyd's Algorithm
      - Find Middle of linked list

Day 13 notes

Day 14

      - Detect and delete loop
      - deleting in linked list
      - reverse a linked list

Day 14 notes

Day 15

      - Segregaring Even and Odd 
      - Find Nth Node in Linked list

Day 15 notes

Day 16

      - Merge two sorted linked list
      - Pairwise swap elements
      - Palindrome

Day 16 notes

Day 17

      - Introduction to tree
      - Implementation of tree
      - Application of tree

Day 17 notes

Day 18

      - Tree Traversals
      - Size of tree
      - level order traversal

Day 18 notes

Day 19

      - Height of binary Tree
      - Left view of binary tree
      - find maximum and minimum in binary tree

Day 19 notes

Day 20

      - Print nodes at k distance from root
      - Children sum properity in Binary tree
      - Maximum width of a binary tree

Day 20 notes

Day 21

      - Lowest common ancestor in a binary tree
      - Diameter of binary tree

Day 21 notes

Day 22

      - flip binary tree
      - tree isomorphism problem

Day 22 notes

Day 23

      - Insertion in binary search tree
      - Searching in binary searcg tree

Day 23 notes

Day 24

      - Deletion in Binary search tree

Day 24 notes

Day 25

      - Floor in binary search tree
      - self balancing tree

Day 25 notes

Day 26

      - Find a binary tree or Binary search tree

Day 26 notes

Day 27

      - Binary tree(Implementation, Introduction, Applications)

Day 27 notes

Day 28

      - Monte hall 3 doors game
      - Rock, Paper, Scissor game

Day 28 notes

Day 29

      - Introduction of sorting algorithm
      - Bubble sort

Day 29 notes

Day 30

      - Introduction and implementation of Selecting sort

Day 30 notes

Day 31

      - Introduction and implementation of Insertion sort
      - Recursive Bubble sort
      - sort an array of strings using selection sort

Day 31 notes

Day 32

      - Recursive Insertion sort
      - Introduction and Implementation of Merge sort

Day 32 notes

Day 33

      - Magic Square(Mini project)

Day 33 notes

Day 34

      - Tic Tak Toe game project

Day 34 notes

Day 35

      - Second implementation for merge sort

Day 35 notes

Day 36

      - Iterative Merge sort
      - Iterative Quick sort

Day 36 notes

Day 37

      - Heap sort

Day 37 notes

Day 38

      - Snake and Ladder game

day 38 notes

Day 39

      - Shell sort

day 39 notes

Day 40

      - Lottery simulation

day 40 notes

Day 41

      - Image Enhancing
      - Image flipping

day 41 notes

Day 42

      - Black Jack Game simulation

day 42 notes

Day 43

      - Introduction to searching algorithms
      - Implementation for linear search
      - Implementation for Binary search

day 43 notes

Day 44

      - Bank account manager (The goal is to create a class called Account which will be an abstract class
      for three other classes called CheckingAccount, SavingsAccount and BusinessAccount. Then 
      you should manage credits and debits from these accounts through an ATM style program)

day 44 notes

Day 45

      - Jump search Implementation

day 45 notes

Day 46

      - Natural language processing(Autour stylometry)

day 46 notes

Day 47

      - Six degree of sepration

day 47 notes

Day 48

      - Area calculation

day 48 notes

Day 49

      - Introduction to turtle
      - Circle mania(Turtle)

day 49 notes

Day 50

      - English Thesaurus(mini project)

day 50 output video

Day 51

      - Interpolation search

day 51 notes

Day 52

      - FLAMES

day 52 notes

Day 53

      - Image Compression

day 53 notes

Day 54

      - Browser automation in whatsapp using python

day 54 notes

Day 55

      - Tkinter calculator

day 55 notes

Day 56

      - Exponential Search

Day 56 notes

Day 57

      - Pandas introduction
      - Read files using PANDAS

Day 57 notes

Day 58

      - Numpy Introduction
      - Array creation using Numpy
      - Array Indexing
      - Basic Operations

Day 59

      - Find day with date

day 59 notes

Day 60

      - web-map shows volcanoes in India and world population

day 60 output

Day 61

      - Types of error 
      - Error Handling

day 61 notes

Day 62

      - Count sort

day 62 notes

Day 63

      - India flag using turtle

day 63 notes

Day 64

      - Bogo sort
      - Pancake sort

day 64 notes

Day 65

      - Page Rank ( Find most visited page(node) )

day 65 output

Day 66

      - Page Rank ( Find most visited page(node) - point distribution method)

day 66 notes

Day 67

      - Introduction to matrix
      - Rotate the matrix

day 67 notes

Day 68

      - Inplace rotate square matrix by 90 degrees

day 68 notes

Day 69

      - Inplace rotate square matrix by 90 degrees without using any extra space

day 69 notes

Day 70

      - Sort the given matrix
      - Check if all rows of a matrix are circular rotations of each other

day 70 notes

Day 71

      - Multiplication of matrix

day 71 notes

Day 72

      - Print Lower triangular and Upper triangular matrix of an array

day 72 notes

Day 73

      - Strassen's matrix multiplication

day 73 notes

Day 74

      - Program to Print Matrix in Z form
      - Print matrix in zag-zag fashion

day 74 notes

Day 75

      - Introduction to SQL

day 75 notes

Day 76

      - SQL operator
      - SQL expression
      - SQL create, use, drop operations

day 76 notes

Day 77

      - SQL Create table
      - SQL Drop table
      - INSERT query
      - SELECT query

day 77 notes

Day 78

      - SQL where clause
      - SQL conjuctive operator

day 78 notes

Day 79

      - UPDATE query
      - DELETE query

day 79 notes

Day 80

      - LIKE clause
      - ORDER by

day 80 notes

Day 81

      - GROUP by
      - Distinct keyword
      - SORTING 

day 81 notes

Day 82

      - SQL - Constraints

day 82 notes

Day 83

      - SQL - Joins
      - NULL values

day 83 notes

Day 84

      - SQL - Alias system
      - Union

day 84 notes

Day 85

      - UNION ALL clause

day 85 notes

Day 86

      - SQL INDEXES

day 86 notes

Day 87

      - SQL ALTER TABLE

day 87 notes

Day 88

      - SQL TRUNCATE TABLE command
      - SQL USING VIEWS

day 88 notes

Day 89

      - the WITH CHECK OPTION
      - UPDATING VIEW

day 89 notes

Day 90

      - INSERTING rows into a VIEW
      - DELETING rows into a VIEW
      - DROPPING VIEW
      - HAVING clause

day 90 notes

Day 91

      - SQL - TRANSACTION
      - TRANSACTION CONTROL

day 91 notes

Day 92

      - TRANSACTION CONTROL COMMANDS

day 92 notes

Day 93

      - SUDOKU solver

day 93 output

Day 94

      - Facebook Login Automation

day 94 output

Day 95

      - Largest Rectangular Area in a Histogram

day 95 notes

Day 96

      - Find the number of islands

day 96 notes

Day 97

      - Print matrix in spiral form
      - Print matrix in anti spiral form

day 97 notes

Day 98

      - SQL subqueries

day 98 notes

Day 99

      - Sum of non-diagonal parts 
      - Count rows / columns with sum equal to diagonal sum 

day 99 notes

Day 100

      - SQL injections

<===========Finally 100 days completed successfully=============>

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published