Sign in to Publish article.

Sign in

Rajan Kumar

Rajan Kumar published an article

1 day, 15 hours ago

Add two numbers without using arithmetic operators

We want to add 2 numbers without using arithmetic operator. The trick here is to use properties of XOR. 

So, let's try to understand how it works.

We'll use Half adder logic here. Points to note down are:

  • Sum of two bits can be obtained by performing XOR (^) of the two bits.
  • Carry bit can be obtained by performing …
Read full article

arrow_upward Upvote 40

comment Comment

arrow_downward downvote


Rajan Kumar

Rajan Kumar published an article

2 days, 16 hours ago

Efficient Method to Check if a Number is Multiple of 3

We are given a number and we want to check if the number is Multiple of 3 or not. The very simple first solution comes in our mind is old school way. We can check if a number is multiple of 3 or not by adding all the digits of number. If the total sum of digits is multiple of …

Read full article

arrow_upward Upvote 39

comment Comment

arrow_downward downvote


Rajan Kumar

Rajan Kumar published an article

2 days, 17 hours ago

DNA to Protein Converter using Python 3 and Django 2.1

DNA is present in every cell of human being. Informations gathered from DNA can be very usefule in crime investigations, health care and medicine industries.

Here, i have explained how can we produce protin structure from any given DNA sample. Let me give you a quick information about how does DNA sample will look like which we are going to …

Read full article

arrow_upward Upvote 38

comment Comment

arrow_downward downvote


Rajan Kumar

Rajan Kumar published an article

5 days, 4 hours ago

Step by step guide to improve competitive programming skills

Competitive programming is art of understanding and problem solving. Machine Learning or Blockchain might be the next big thing, but competitive programming problem-solving is the skill of the decade. It requires sharp analytical skill and expertise coding language too.

There are a lot of programmers out there, stuck on a stage where they are able to solve basic problems and ad-hoc problem …

Read full article

arrow_upward Upvote 37

comment Comment

arrow_downward downvote


Rajan Kumar

Rajan Kumar published an article

1 week ago

Implement a Dictionary using Trie

In this article I'll implement a dictionary using Trie Data Structure. We'll discusss implementation of a dictionary using Trie (memory optimization using hash-map).

Let's take a problem and that requires dictionary to solve, this way we'll understand the in better way.

 

Problem

There are some name of students and we have their corresponding marks. Now the problem is to …

Read full article

arrow_upward Upvote 36

comment Comment

arrow_downward downvote


Rajan Kumar

Rajan Kumar published an article

1 week, 5 days ago

Range Trees

Range Trees are order data structures. They hold a list of points or nodes. They are used to answer queries about something in a certain range of any given graph or list.

Suppose, there is an array and you want to find out the Kth smallest element in a subarray of the given array. Here you'll be using Range trees.

Read full article

arrow_upward Upvote 35

comment Comment

arrow_downward downvote


Rajan Kumar

Rajan Kumar published an article

1 month ago

How to prepare for Google Kickstart – a CodeJam competition?

Google Kickstart, formerly known as APAC is a coding contest organized by Google to hire people who are looking to persue a career in Google. 

Formelry, Google used to conduct APAC test, which was for the same purpose. Here are the major differences between APAC and KickStart:

  • There will be more test rounds in Kickstart than APAC, so if you miss …
Read full article

arrow_upward Upvote 34

comment Comment

arrow_downward downvote


Rajan Kumar

Rajan Kumar published an article

1 month, 3 weeks ago

HackersFriend Graduated from Y Combinator's Startup School

We are happy to announce that HackersFriend Graduated form Y combinator's Startup school. #SUS2019

https://www.startupschool.org/companies/HackersFriend

 

Read full article

arrow_upward Upvote 32

comment Comment

arrow_downward downvote


Rajan Kumar

Rajan Kumar published an article

3 months ago

Find maximum occurring character in a string

Problem

You are given an string S, Your task is to find out the character whose occurance is most. If there are more than 1 character which have same occurance, then print the one that comes alphabetically first. 

Example

Input

HackersFriend

Output

e

Here in this example, we can see there are two characters which are occuring 2 times …

Read full article

arrow_upward Upvote 31

comment Comment

arrow_downward downvote


Rajan Kumar

Rajan Kumar published an article

3 months, 1 week ago

What is Binary Search Tree (BST) ?

Binary Search Tree or BST, is a Binary tree based data sctructure, that keeps all of its elements in sorted order. We also call it, ordered or sorted binary trees.

It was invented by P.F. Windley, A.D. Booth, A.J.T. Colin, and T.N. Hibbard in 1960. 

    

Binary Search Tree

Specifications

  • Faster lookup for elements
  • Faster insertion of …
Read full article

arrow_upward Upvote 30

comment Comment

arrow_downward downvote



View more

HackersFriend Updates


update Aug. 15, 2019, 1:47 p.m.

Full view page of article has been changed to match style of homepage feed. open_in_new


update Aug. 14, 2019, 12:52 a.m.

Total number posts on homepage is incresed to 10 by default and text-decoration of link to post and author is changed. open_in_new


update Aug. 7, 2019, 1:51 a.m.

We changed our homepage. Now, you can see newly published articles, directly on home page. open_in_new


View more


Events


event Nov. 28, 2018, 5:30 p.m.

Python from zero to hero

place Delhi

View details



event Aug. 13, 2018, 5:30 p.m.

Python from zero to hero

place Bangalore ( HackersFriend office BTM Layout)

View details