- Print Linked List elements
- Count nodes of linked list
- Node at a given index in linked list
- Inorder Traversal
- Finding middle element in a linked list
- Binary Search
- Preorder Traversal
- Linked List Length Even or Odd?
- Queue Reversal
- Insert in Middle of Linked List
- Sort and Reverse Vector
- Start Coding - Python
- Space Seperated - Python
- Concatenating Strings - Python
- Taking input and typecasting - Python
- Taking input - Python
- Comparison Operators - Python
- Welcome aboard - Python
- Iterating through Lists - Python
- Functions - Python
- Variable Arguments - Python
- Maximum Occuring Character
- Binary String
- GCD of Array
- Power of 2
- Sort a String
- Majority Element
- Missing number in array
- Generate Binary Numbers
- 1's Complement
- Pairs with given XOR
- Unique Numbers
- Find first set bit
- XOR play
- Count even substrings
- URLify a given string
- Anagram Palindrome
- Binary representation of previous number
- Find the fine
- Print K smallest elements in their original order
- Set all odd bits
- Height of Heap

Name

Siddhant Gupta

Organization

Courses Attended

Other Profile Link

Overall Coding Score: 800

Monthly Coding Score: 0

Weekly Coding Score: 0

- Reverse a linked list
- Add two numbers represented by linked lists
- Add 1 to a number represented as linked list
- Merge Sort
- Mirror Tree
- Maximum Width of Tree
- Diameter of Binary Tree
- Check for Balanced Tree
- Left View of Binary Tree
- Delete Middle of Linked List
- Merge two sorted linked lists
- Queue using two Stacks
- Stack using two queues
- Level order traversal in spiral form
- DFS of Graph
- BFS of graph
- Lowest Common Ancestor in a Binary Tree
- Determine if Two Trees are Identical
- Postorder traversal from given Inorder and Preorder traversals
- Absolute List Sorting
- Is Binary Tree Heap
- Check if Linked List is Palindrome
- Check whether BST contains Dead End
- Delete a Node in Single Linked List
- Special Stack
- Three way partitioning
- Sort a stack
- Peak element
- Merge Sort for Linked List
- Union of Two Linked Lists
- Split Singly Linked List Alternatingly
- Sum of leaf nodes in BST
- Triplet with 0 sum in BST
- Construct Tree from Inorder & Preorder
- Maximum Node Level
- Diagonal Sum In Binary Tree
- Find length of Loop
- Median of BST
- Linked List Matrix
- Reverse First K elements of Queue
- Sum of Leaf Nodes
- Check if two Nodes are Cousins
- ZigZag Tree Traversal
- Sum of Leaf Nodes at Min Level
- Tilt of Binary Tree
- Move all zeros to the front of the linked list
- Vertical Width of a Binary Tree
- Learn to Comment
- Count Odd Even
- Need Some Change
- Count the Specials
- The Pattern Matcher
- Student of the Year
- Repetitive Printing - Python
- Operators in Python
- Split the input - Python
- Comment in Python
- Logical Operators - Python
- Increment and Decrement - Python
- Bitwise Operators - Python
- If conditional statement- Python
- Check the status - Python
- Mark Even and Odd - Python
- For loop - Python
- For Loop 2- Python
- While loop in Python
- Jumping through While - Python
- Slicing in String - Python
- Repeat the Strings - Python
- String Functions - II - Python
- String Functions I - Python
- Intro to Lists - Python
- Count Even Odd - Python
- Functions in Lists - Python
- Classes and Objects - Python
- Average_Min_Max - Python
- Sorting in Lists - Python
- Intro to Dictionary - Python
- Dictionary in Python - II
- Dictionary in Python - III
- Is and In Operator
- Mother Vertex
- Linear Probing in Hashing
- Anagram
- Adding One
- Wave Array
- Pattern Searching
- Print Pattern
- Search in a Rotated Array
- Non Repeating Character
- Good Pairs
- Reverse words in a given string
- Isomorphic Strings
- Count Substrings
- Remove all duplicates from a given string
- Remove “b” and “ac” from a given string
- Spirally traversing a matrix
- Sort an array of 0s, 1s and 2s
- Segregate even and odd nodes in a Linked List
- Count distinct pairs with difference k
- Kth distance
- Facing the sun
- Add Binary Strings
- Reverse Bits
- Swap all odd and even bits
- Two Repeated Elements
- Missing element of AP
- 0 - 1 Knapsack Problem
- Pangram Checking
- Pangram Strings
- Count the Reversals
- Maximum average subarray
- Examination Papers
- Ordering of strings
- Equilibrium point
- Floor in a Sorted Array
- Flip Bits
- Prime Factors
- LCS with permutations
- Equal 0, 1 and 2
- Adding Ones
- Min sum formed by digits
- Help Nobita
- 1[0]1 Pattern Count
- Flood fill Algorithm
- Decode the string
- Gold Mine Problem
- Love For The Twins
- Check if frequencies can be equal
- Largest Fibonacci Subsequence
- K-th element of two sorted Arrays
- Array Subset of another array
- First negative integer in every window of size k
- Minimum Number in a sorted rotated array
- Find distinct elements
- Sort by Absolute Difference
- Swapping pairs make sum equal
- String Ignorance
- Count of strings that can be formed using a, b and c under given constraints
- Stickler Thief
- Transform the array
- Count the triplets
- Star elements
- Pairs with Positive Negative values
- Numbers containing 1, 2 and 3
- GeeksforGeeks New System
- Maximum AND Value
- Maximum distinct elements after removing K elements
- Ease the Array
- Print Binary Tree levels in sorted order
- Longest substring with equal number of 0s and 1s
- Print Bracket Number
- Dr. Zora's Algorithm
- Days of Our Lives
- Print adjacency list
- Union of Two Sorted Arrays

- Given a linked list, reverse alternate nodes and append at the end
- Reverse a Linked List in groups of given size.
- Check for BST
- Tree from Postorder and Inorder
- Bottom View of Binary Tree
- Intersection Point in Y Shapped Linked Lists
- Construct Binary Tree from Parent Array
- Connect Nodes at Same Level
- Flattening a Linked List
- Diagonal Traversal of Binary Tree
- Detect cycle in a directed graph
- Detect cycle in an undirected graph
- Maximum difference between node and its ancestor
- Vertical Traversal of Binary Tree
- Merge K sorted linked lists
- Find the number of islands
- Serialize and Deserialize a Binary Tree
- Make Binary Tree From Linked List
- Check if subtree
- Remove loop in Linked List
- Minimum Spanning Tree
- LRU Cache
- Count of distinct substrings
- Strongly Connected Components (Kosaraju's Algo)
- Bipartite Graph
- Delete keys in a Linked list
- Merge k Sorted Arrays
- Smallest range in K lists
- Binary Tree to CDLL
- Find a pair with given target in BST
- Count More than n/k Occurences
- Populate Inorder Successor for all nodes
- Foldable Binary Tree
- Leftmost and rightmost nodes of binary tree
- Node at distance
- Pairs violating BST property
- Maximum path sum from any node
- Leaves to DLL
- Cat and Hat - Python
- Zero Converter - Python
- Swap Kth nodes from ends
- Add two numbers represented by Linked List
- Maximum sum of Non-adjacent nodes
- Kadane's Algorithm
- Subarrays with equal 1s and 0s
- Largest number in K swaps
- Kadane's Algorithm
- Find Missing And Repeating
- Maximum Index
- Parenthesis Checker
- Longest Common Subsequence
- Maximum Rectangular Area in a Histogram
- Trapping Rain Water
- Subset Sum Problem
- Number following a pattern
- Stock buy and sell
- Modular Exponentiation for large numbers
- Rearrange Array Alternately
- Rearrange an array with O(1) extra space
- Relative Sorting
- Black and White
- Maximum of all subarrays of size k
- Sorting Elements of an Array by Frequency
- Special Keyboard
- Preorder to Postorder
- Length of the longest substring
- Stock span problem
- Is Binary Number Multiple of 3
- Preorder Traversal and BST
- Number of pairs
- Largest number in K swaps
- Next larger element
- X Total Shapes
- Snake and Ladder Problem
- Shortest Source to Destination Path
- Print leaf nodes from preorder traversal of BST
- Find whether path exist
- Unit Area of largest region of 1's
- Rearrange characters
- K
^{th}largest element in a stream - Water Overflow
- Smallest distinct window
- Infix to Postfix
- Smallest Positive missing number
- Rotten Oranges
- Fill the Tank
- Subarrays with equal 1s and 0s
- Game of Powers
- Number Equivalence
- A Game of Doubles
- Closer to sort
- Possible paths between 2 vertices
- K Most occurring elements
- Nearly sorted
- Check if array is sorted and rotated clockwise
- Maximum Product of Increasing Subsequence of Size 3

Published Count(13)

- Mean and Median
- Game of Powers
- A Game of Doubles
- Minimum number to make median X
- A difference of values and indexes
- Possible paths between 2 vertices
- Extended Euclidean Algorithm
- Check if array is sorted and rotated clockwise
- Maximum Product of Increasing Subsequence of Size 3
- Range Sum Queries
- Range Min Max Queries
- Range GCD Queries
- Range LCM Queries

Published Count(15)

- Is and In Operator
- sep and end in Print()
- Modules
- Swap Kth nodes from ends
- Add two numbers represented by Linked List
- Maximum sum of Non-adjacent nodes
- Mother Vertex
- Maximum Product of Increasing Subsequence of Size 3
- Check if array is sorted and rotated
- Possible paths between 2 vertices
- Possible paths between 2 vertices
- Range Sum Queries
- Range Min Max Queries
- Range GCD Queries
- Range LCM Queries