---
title: "Rahul Saxena (@raahulsaxena) | Hashnode"
description: "Clarity | Focus | Discipline. Read the latest articles by Rahul Saxena on Hashnode."
url: "https://hashnode.com/@raahulsaxena"
---

@raahulsaxena

# Rahul Saxena

@raahulsaxena · India · Joined February 2022

Clarity | Focus | Discipline

[Website](https://raahulsaxena.github.io/)

### [1699\. Number of Calls Between Two Persons](https://raahulsaxena.hashnode.dev/1699-number-of-calls-between-two-persons?utm_source=hashnode&utm_medium=feed)

Asked in: Facebook, Amazon. Table: Calls +-------------+---------+ | Column Name | Type | +-------------+---------+ | from\_id | int | | to\_id | int | | duration | int | +-------------+---------+ This table does not have a ...

2 min read · [raahulsaxena.hashnode.dev](https://raahulsaxena.hashnode.dev/1699-number-of-calls-between-two-persons?utm_source=hashnode&utm_medium=feed)

[Dec 28, 2022](https://hashnode.com/posts/1699-number-of-calls-between-two-persons/63ac9664bede67fdcbca1173)

### [Slow and Fast Pointers: 234. Palindrome Linked List](https://raahulsaxena.hashnode.dev/slow-and-fast-pointers-234-palindrome-linked-list?utm_source=hashnode&utm_medium=feed)

Question: Given the head of a singly linked list, return true if it is a palindrome. Example 1: Input: head = \[1,2,2,1\] Output: true Example 2: Input: head = \[1,2\] Output: false Constraints: The number of nodes in the list is in the range \[1, 105\]. 0...

2 min read · [raahulsaxena.hashnode.dev](https://raahulsaxena.hashnode.dev/slow-and-fast-pointers-234-palindrome-linked-list?utm_source=hashnode&utm_medium=feed)

[Jun 25, 2022](https://hashnode.com/posts/slow-and-fast-pointers-234-palindrome-linked-list/62b6679892447c9aed5b660c)

### [Leetcode 75: 102. Binary Tree Level Order Traversal](https://raahulsaxena.hashnode.dev/leetcode-75-102-binary-tree-level-order-traversal?utm_source=hashnode&utm_medium=feed)

Question: Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level). Example 1: Input: root = \[3,9,20,null,null,15,7\] Output: \[\[3\],\[9,20\],\[15,7\]\] Example 2: Input: root = \[1\] O...

3 min read · [raahulsaxena.hashnode.dev](https://raahulsaxena.hashnode.dev/leetcode-75-102-binary-tree-level-order-traversal?utm_source=hashnode&utm_medium=feed)

[Jun 25, 2022](https://hashnode.com/posts/leetcode-75-102-binary-tree-level-order-traversal/62b66482b86f939ac81b454e)

### [202\. Happy Number](https://raahulsaxena.hashnode.dev/202-happy-number?utm_source=hashnode&utm_medium=feed)

Question: Write an algorithm to determine if a number n is happy. A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits. Repeat the process until th...

2 min read · [raahulsaxena.hashnode.dev](https://raahulsaxena.hashnode.dev/202-happy-number?utm_source=hashnode&utm_medium=feed)

[Jun 19, 2022](https://hashnode.com/posts/202-happy-number/62af4042d8afe74aa51fd1d1)

### [Pattern: Slow and Fast Pointers](https://raahulsaxena.hashnode.dev/pattern-slow-and-fast-pointers?utm_source=hashnode&utm_medium=feed)

It's a pointer algorithm that involves two pointers that move through the Array or LinkedList at different speeds. It's also known as Hare and Tortoise algorithm. The algorithm proves that the two pointers are bound to meet in case there is a cycle i...

1 min read · [raahulsaxena.hashnode.dev](https://raahulsaxena.hashnode.dev/pattern-slow-and-fast-pointers?utm_source=hashnode&utm_medium=feed)

[Jun 19, 2022](https://hashnode.com/posts/pattern-slow-and-fast-pointers/62af3100d8afe74aa51fd00a)
