Forem: Daniel

Algorithms Day 2- Naive String Search

Daniel — Thu, 23 Apr 2020 06:16:14 +0000

This algorithm works if you wanna search a smaller string inside a longer string. And they'll return the no of occurrences of that small string.

Naive Search - Pseudocode

Create a function that accepts a long string and a shorter string
Loop over the longer string. Inside that, we should loop over the smaller string.
If the string characters don't match we should break out from the inner loop
If the string matches we need to continue the loop for the rest of the smaller string
If the match was found we should increment the no of matches
Finally, we need to return the count.
The code is mentioned below

Thanks for reading. Hope you'll find it useful

Algorithms Day 1- Linear and Binary Search

Daniel — Fri, 17 Apr 2020 13:32:34 +0000

So Along with the 100daysofcode challenge, I started to practice algorithms and data structures. So this is my first post about it

Linear Search

Linear Search is one of the common practices that we use almost every time to search inside an array.
Just loop through the Array and find the match simple. That's a linear search.

Linear Search - Pseudocode

Create a function that accepts an array and a value to be searched.
Loop through the array and check the condition if the current element of the iteration is equal to the value to be checked. If found return the index. Else return - 1
The code is mentioned below

Binary Search

It's faster compared with the linear search method. Rather than comparing and eliminating one by one we can eliminate half of the array elements in a single time
But it only works on sorted arrays. It takes two inputs a sorted array and the value to be searched.

Binary Search - Pseudocode

Create a function that accepts a sorted array and the value to be searched.
Create start pointer and ending pointer. When the start pointer is less than the ending pointer. Create a pointer between the two.
If the value in the middle is smaller in comparison move the start pointer over the middle pointer.
If it's smaller move the ending pointer down to the middle pointer
Return the index.
The code is mentioned below

I believe that's it. Thanks for reading will keep you guys posted

Big O for Array Methods

Daniel — Sun, 12 Apr 2020 19:44:31 +0000

Push and Pop

Adding or removing data to the array using these two operations is always constant.

So this has a BigO of 1 "O()".

Shift and Unshift

Shifting and Unshifting always will take its own time. As the array has to reindex itself after doing this. So the complexity increases with the no of items

So this has a BigO of N "O(N)".

Concat

Its a simple operation of merging two arrays into one but as we know that indexing takes its own time. So this is also the same as shift.

So this has a BigO of N "O(N)".

Slice

Slice returns the copy of an array from starting index to the ending index as the number of elements grows this'll also grow based on the size of the array

So this has a BigO of N "O(N)".

Splice

With splice we can insert, remove or modify the elements in an array using index. But at the end we are left with indexing. So even this operation grows with the number of elements

So this has a BigO of N "O(N)".

The set and get methods from lodash

Daniel — Thu, 19 Mar 2020 08:18:27 +0000

What is lodash?

Lodash simplifies our work by providing lots of methods to handle arrays and objects.

_.get()

The get method gets the value from the path that’s been provided as an argument. The first argument is the object, the second is the path of the object and the third is the optional argument discussed which returns the default value

So, What if the path doesn’t exist or the path returns ‘undefined’. No worries Lodash allows us to pass an optional third argument which is the default value. In those situations, the default value is returned.

_.set()

The set method as the name suggests sets the value to the path of the object. There are three arguments. The first is the object itself, second is the path and the third one is the value.

So, What if the path doesn’t exist. The set() automatically creates a path for us. Here the ‘c’ path doesn’t exist but its automatically created.

#Day5 and #Day6 of "100daysofcode" Challenge

Daniel — Wed, 18 Mar 2020 01:46:23 +0000

Hi, I hope everyone's doing great.

Another small update on the "100daysofcode" challenge.

This is about Day 5 and 6.

Finally completed the whole structure for files and folders. Started writing queries with all validations. I got a strong knowledge of statics and methods on mongoose Also, with express-validators (which is a lifesaver).

I will update the code and the explanations with my next post.

Also, I've decided to add these two things on my challenge

1 - I should at least network with one developer per day. As I don't have that many contacts.

2 - I found out code wars to be interesting. If I feel bored I should at least complete one problem and post the solution with an explanation on social networks.

#Day3 and #Day4 of "100daysofcode" Challenge

Daniel — Sun, 15 Mar 2020 19:06:30 +0000

Hi, I hope everyone's doing great.

Just a small update on my "100daysofcode" Challenge.

This is regarding Day 3 and 4. In my previous post, I stated that I have decided to work on Instagram clone and React native.

I had some trouble doing that. The main issue was I was struck with tutorial hell without even realizing it.

For some of you who were not aware of tutorial hell, Its a mistake that all junior developers make when learning to code. They'll simply start from scratch for learning each language or frameworks without even realizing it. This happened with me on react native as I completed two tutorials but still haven't understood some of the core concepts.

So, As far as react is concerned I'm just going to build the Instagram clone and going to learn those concepts along the way.

Also, On the backend side of things (MongoDB). Things are going smoothly just now completed the DB modeling.

So, yeah Don't get obsessed with tutorials just build it.

#Day1 of my "100daysofcode" challenge

Daniel — Thu, 12 Mar 2020 18:42:41 +0000

Day 1 of my "100daysofcode" challenge.

Hi, I hope everyone is doing great.

Just a quick update on my first day. Everything went great, the day was very productive, But I ended up spending a lot of time setting up things for programming.

I Spent 2 hours on learning and 1.5 hours on the actual programming. I decided to clone Instagram as a side project so that I could improve my skills in React.

These are the topics that I've completed learning today (Sounds basic)

On React Native

Flexbox
Use State hook
Basic overview of components and how to use them

On MongoDB

Setting up schema
Relational data and population with Mongoose
How to use methods and statics in Mongoose

I think this is probably the best decision that I've ever made with my career. Because after starting this challenge I find a lot of time to code and learn. I usually find excuses to skip something.

Starting my "100 days of code" challenge

Daniel — Wed, 11 Mar 2020 16:18:17 +0000

Hi, Hope everyone's doing great

I'm just starting my "100 days of coding" challenge.

These are the ground rules that I made to myself just to avoid confusion

Learning new stuff or working at the office will not be included in the challenge
The coding only should include my side projects or anything that I'm working on for my portfolio.
I should also spend at least 30 mins a day to post my daily records on social networks and LinkedIn
These are the technologies that I'm focussing on React, Node, Mongo, Algorithms and data structures.
At the end of this challenge, I should be having at least 6 to 7 projects in hand and have my portfolio ready.

Today I thought of making a refresher on React native.

Let's see how it goes and I'll keep you guys posted