Nayan Pahuja

Be Curious

Education

Thapar University

Work

Student

Pin Pinned

Version Control Systems - Part 1

Version Control Systems - Part 1

DAY 93 - Floyd Cycle Detection Algorithm. Finding a Cycle in a Linked List

DAY 93 - Floyd Cycle Detection Algorithm. Finding a Cycle in a Linked List

CAP Theorem - Consistency Availability and Partition Tolerance

CAP Theorem - Consistency Availability and Partition Tolerance

DAY 64 - SUBARRAYS AND OR PROBLEM

DAY 64 - SUBARRAYS AND OR PROBLEM

Want to connect with Nayan Pahuja?

Create an account to connect with Nayan Pahuja. You can also sign in below to proceed if you already have an account.

DAY 108 - Find Duplicate

DAY 108 - Find Duplicate

DAY 107 - Daily Temperatures

DAY 107 - Daily Temperatures

DAY 106 - Next Greater Element I

DAY 106 - Next Greater Element I

Version Control Systems and Git Part-2

Version Control Systems and Git Part-2

DAY 105 - 155. Min Stack

DAY 105 - 155. Min Stack

DAY 104 - Merge k Sorted Lists

DAY 104 - Merge k Sorted Lists

DAY 103 - Copy List with Random Pointer

DAY 103 - Copy List with Random Pointer

DAY 102 - 2130. Maximum Twin Sum of a Linked List

DAY 102 - 2130. Maximum Twin Sum of a Linked List

DAY 101 - 61. Rotate List

DAY 101 - 61. Rotate List

DAY 100 - 1282. Group the People Given the Group Size They Belong To

DAY 100 - 1282. Group the People Given the Group Size They Belong To

DAY 99 - 234. Palindrome Linked List

DAY 99 - 234. Palindrome Linked List

DAY 98 - Intersection of Two Linked Lists

DAY 98 - Intersection of Two Linked Lists

DAY 97 - Removing Elements from a Linked List

DAY 97 - Removing Elements from a Linked List

DAY 96 - Reverse Linked List II

DAY 96 - Reverse Linked List II

DAY 95 - Finding the middle of linked list

DAY 95 - Finding the middle of linked list

DAY 94 - Add Two Numbers

DAY 94 - Add Two Numbers

DAY 92 - Can I serve my Customers

DAY 92 - Can I serve my Customers

DAY 91 - 51. N-Queens

DAY 91 - 51. N-Queens

Interview Problems: Minimum Number of Groups

Interview Problems: Minimum Number of Groups

DAY 90 - 338. Counting Bits

DAY 90 - 338. Counting Bits

DAY 88 - 2366. Minimum Replacements to Sort the Array

DAY 88 - 2366. Minimum Replacements to Sort the Array

DAY 87 - 2483. Minimum Penalty for a Shop

DAY 87 - 2483. Minimum Penalty for a Shop

DAY 86 - 225. Implement Stack using Queues

DAY 86 - 225. Implement Stack using Queues

DAY 85 - Frog Jump

DAY 85 - Frog Jump

DAY 84 - 646. Maximum Length of Pair Chain

DAY 84 - 646. Maximum Length of Pair Chain

DAY 83 - MATRIX MEDIAN

DAY 83 - MATRIX MEDIAN

DAY 82 - Search a 2D Matrix II

DAY 82 - Search a 2D Matrix II

DAY 81 - 410. Split Array Largest Sum

DAY 81 - 410. Split Array Largest Sum

DAY 80 - 168. Excel Sheet Column Title

DAY 80 - 168. Excel Sheet Column Title

DAY 79 - Aggressive Cows Problem

DAY 79 - Aggressive Cows Problem

DAY 78 - Finding Kth Missing Positive Integer

DAY 78 - Finding Kth Missing Positive Integer

DAY 77 - Find the Smallest Divisor Given a Threshold

DAY 77 - Find the Smallest Divisor Given a Threshold

DAY 76 - Minimum Number of days to make m bouquets.

DAY 76 - Minimum Number of days to make m bouquets.

DAY 75 - 875. Koko Eating Bananas

DAY 75 - 875. Koko Eating Bananas

DAY 74 - 239. Sliding Window Maximum

DAY 74 - 239. Sliding Window Maximum

DAY 73 - 86. Partition List

DAY 73 - 86. Partition List

DAY 72- 215. Kth Largest Element in an Array

DAY 72- 215. Kth Largest Element in an Array

DAY 71 - Minimum Bit Flips to Convert Number

DAY 71 - Minimum Bit Flips to Convert Number

DAY 70 - Find the Difference

DAY 70 - Find the Difference

DAY 69 - Number of 1 Bits

DAY 69 - Number of 1 Bits

DAY 68 - Single Number I

DAY 68 - Single Number I

DAY 67 - 231. Power of Two

DAY 67 - 231. Power of Two

DAY 66 - Two Sum IV - Input is a BST

DAY 66 - Two Sum IV - Input is a BST

DAY 65 - Kth Smallest Element in a BST

DAY 65 - Kth Smallest Element in a BST

DAY 63 - Unique Binary Search Trees II

DAY 63 - Unique Binary Search Trees II

DAY 62 - Flatten a Binary Tree into a linked list

DAY 62 - Flatten a Binary Tree into a linked list

DAY 61 - Serialize and Deserialize Binary Tree

DAY 61 - Serialize and Deserialize Binary Tree

DAY 60 - All Nodes Distance K in Binary Tree

DAY 60 - All Nodes Distance K in Binary Tree

DAY 59 - Maximum Width of Binary Tree

DAY 59 - Maximum Width of Binary Tree

DAY 58 - Binary Tree Questions(II)

DAY 58 - Binary Tree Questions(II)

DAY 57 - Binary Tree Maximum Path Sum

DAY 57 - Binary Tree Maximum Path Sum

DAY 56 - Binary Tree Questions(I)

DAY 56 - Binary Tree Questions(I)

DAY 55 - Traversals in a Binary Tree Part 2

DAY 55 - Traversals in a Binary Tree Part 2

DAY 54 - Traversals in a Binary Tree

DAY 54 - Traversals in a Binary Tree

DAY 53 - Minimum Speed to Arrive on Time

DAY 53 - Minimum Speed to Arrive on Time

DAY 52 - Peak Index in a Mountain Array

DAY 52 - Peak Index in a Mountain Array

DAY 51 - Power of a Number n

DAY 51 - Power of a Number n

DAY 50 - Knight Probability in Chessboard

DAY 50 - Knight Probability in Chessboard

DAY 49 - Making a large Island