- Count nodes of linked list
- Power of Four
- Size of Binary Tree
- Inorder Traversal
- Bubble Sort
- Count Leaves in Binary Tree
- Height of Binary Tree
- Finding middle element in a linked list
- Check If Circular Linked List
- Postorder Traversal
- Implement stack using array
- Square root
- Doubly linked list Insertion at given position
- Binary Search
- Remove duplicate elements from sorted Array
- Replace all 0's with 5
- Count zeros in a sorted matrix
- Preorder Traversal
- C++ STL | Set 1 (vector)
- C++ STL | Set 4 (stack)
- C++ STL | Set 5 (queue)
- C++ STL | Set 6 (set)
- Search a node in BST
- C++ STL | Set 7 (unordered map)
- C++ STL | Set 8 (unordered set)
- Find Number of Numbers
- Linked List Insertion
- Minimum element in BST
- Find the Sum of Last N nodes of the Linked List
- Modular Node
- Find n/k th node in Linked list
- Triplet Family
- Insert in Middle of Linked List
- logical Operators
- Sort and Reverse Vector
- Front to Back
- Set Operations
- Start Coding - Python
- Sum Array Puzzle
- Space Seperated - Python
- Concatenating Strings - Python
- Taking input and typecasting - Python
- Taking input - Python
- Comparison Operators - Python
- Who has the majority?
- Strongest Neighbour
- Array insert at index
- Array insert at end
- Reversing an Array
- Absolute Value
- Convert Celsius To Fahrenheit
- Check whether K-th bit is set or not
- Quadratic Equation Roots
- Count total set bits
- Bit Difference
- Number is sparse or not
- Binary To Gray Code equivalent
- Gray to Binary equivalent
- Power of 2
- Tower Of Hanoi
- Reverse array in groups
- Rotate Array
- Search an Element in an array
- Searching an element in a sorted array
- Majority Element
- Left Index
- Adding two matrices
- Sum of upper and lower triangles
- Multiply the matrices
- Sum of Digits of a Number
- Power Using Recursion
- Fibonacci Using Recursion
- Addition Under Modulo
- Multiplication Under Modulo
- Search an Element in an array
- GCD of Array
- Repetitive Addition Of Digits
- Power of 2
- Pythagorean Triplet
- Nth Fibonacci Number
- Strong Number
- Doubling the value
- Majority Element
- Shortest path from 1 to n
- Rotate Array
- Permutations of a given string
- Missing number in array
- Swap two nibbles in a byte
- Number of paths
- Count total set bits
- Bit Difference
- Immediate Smaller Element
- Binary Array Sorting
- k largest elements
- Student record
- Sum of all prime numbers between 1 and N.
- Maximum money
- Middle of Three
- Smallest number
- Factorial Number
- Find the Odd Occurence
- Rotating an Array
- Sum of Products
- The Lazy Caterer's Problem
- Set Bits
- Repeated sum of digits
- Longest Consecutive 1's
- Different ways to Spell a Number
- Minimize the sum of product
- Missing number
- Find first and last occurrence of x
- Sum of dependencies in a graph
- Sort in specific order
- Check if two arrays are equal or not
- Find first set bit
- Find the element that appears once in sorted array
- Last index of One
- Print an array in Pendulum Arrangement
- Transpose of Matrix
- First element to occur k times
- Extract Maximum
- Uncommon characters
- Sum of numbers in string
- Find the smallest and second smallest element in an array
- Sorted matrix
- Pair array product sum
- Count pair sum
- Swap and Maximize
- Check if a string is Isogram or not
- Alternative Sorting
- Rightmost different bit
- Check set bits
- Quick Left Rotation
- Twice counter
- Print first n Fibonacci Numbers
- Remove repeated digits in a given number
- Check perfect square
- Total number of Strings
- Find the Highest number
- Closest Number
- Anshuman's Favourite Number
- Remove common characters and concatenate
- ZERO Number
- Sum of upper and lower triangles
- Left Rotate Matrix K times
- G.F Series
- Find the fine
- Find the closest number
- Series X1
- Squares Difference
- Check if the number is balanced
- C++ Corresponding position in the two strings that hold exactly the same characters.
- Message Spreading
- Last duplicate element in a sorted array
- Perfect Square String
- Sum of f(a[i], a[j]) over all pairs in an array of n integers
- Ishaan's Internship
- Ishaan Loves Chocolates
- Factor OR Multiple
- Jay's Apples
- Program for length of the longest word in a sentence
- Difference series
- Multiply left and right array sum.
- Doctors Clinic
- How Many X's?
- Prime String
- C++ 2-D Arrays | Set-2

Name

Harsha Vardhan

Rank in Institute

#1

Courses Attended

Campus Ambassador

Overall Coding Score: 1373

Monthly Coding Score: 175

Weekly Coding Score: 8

- Reverse a linked list
- Occurence of an integer in a Linked List
- Rotate a Linked List
- Pairwise swap elements of a linked list
- Given a linked list of 0s, 1s and 2s, sort it.
- Add two numbers represented by linked lists
- Detect Loop in linked list
- Remove duplicates from an unsorted linked list
- Insertion Sort
- Right View of Binary Tree
- K distance from root
- Mirror Tree
- Maximum Width of Tree
- Diameter of Binary Tree
- Check for Balanced Tree
- Nth node from end of linked list
- Left View of Binary Tree
- Delete Middle of Linked List
- Merge two sorted linked lists
- Sum Tree
- Decimal Equivalent of Binary Linked List
- Find Transition Point
- Queue using two Stacks
- Remove duplicate element from sorted Linked List
- Stack using two queues
- Level order traversal in spiral form
- DFS of Graph
- Insert a node in a BST
- BFS of graph
- Determine if Two Trees are Identical
- Root to leaf path sum
- Lowest Common Ancestor in a BST
- Implement two stacks in an array
- Largest subarray of 0's and 1's
- Level order traversal Line by Line
- Minimum Depth of a Binary Tree
- Odd even level difference
- Distinct occurrences
- Josephus problem
- Check if Linked List is Palindrome
- Max distance between same elements
- Delete a Node in Single Linked List
- Count distinct elements in every window
- Special Stack
- Sort a stack
- Level order traversal
- Peak element
- Index Of an Extra Element
- Ancestors in Binary Tree
- Level of a Node in Binary Tree
- Root to Leaf Paths
- Maximum path sum
- Check if Tree is Isomorphic
- Maximum Node Level
- Children Sum Parent
- Diagonal Sum In Binary Tree
- Find length of Loop
- Height of Spiral Tree
- Sum of Leaf Nodes
- Closest Neighbor in BST
- Delete middle element of a stack
- The New Line
- The Size of
- Taking input
- Learn to Comment
- GetLine and Ignore
- Learning to be precise
- Bitwise Operators
- Even Odd
- For Loop- primeCheck
- While loop- printTable
- Learning Macros
- Step by Step Condition
- Start Coding - Java
- The New Line - Java
- Taking input - Java
- Learn to Comment - Java
- nextLine and next
- Precise Fomat - Java
- logical Operators - Java
- Bitwise Operators - Java
- Even Odd - Java
- For Loop- primeCheck - Java
- While loop- printTable - Java
- Step by Step Condition - Java
- Count Odd Even
- Need Some Change
- Count the Specials
- Matrix Interchange
- Predict the Column
- Xoring and Clearing
- Consonants and Vowels check
- Count Odd Even - Java
- The Pattern Matcher - Java
- Need Some Change - Java
- Almost Equal -Java
- Count the Specials - Java
- Matrix Interchange - Java
- Consonants and Vowels check - Java
- Predict the Column - Java
- Xoring and Clearing - Java
- Magic in CPP
- Swap the objects
- Structs and Objects
- Two Dimensional World
- Learning Structs
- Delete Array
- Maximum Area Rectangle
- Sum of Big Integers
- BigInteger Multiply
- BigInteger mod
- Find the Frequency
- Back to Front
- Pair Sum in Vector
- ArrayList Operation
- Stack Operations
- Queue Operations
- Multiset Operations
- Multimap Operations
- 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
- Is and In Operator
- sep and end in Print()
- Max and Second Max
- Fibonacci Numbers - Top Down DP
- Fibonacci Numbers - Bottom Up DP
- Coin Change - Number of ways
- Coin Change - Minimum number of coins
- Kadane's Algorithm - I
- Kadane's Algorithm - II
- Pairwise swap of nodes in LinkeList
- Mother Vertex
- Find first set bit
- Rightmost different bit
- Factorial Of Number
- Digits In Factorial
- GP Term
- Primality Test
- Longest Consecutive 1's
- Exactly 3 Divisors
- Mean And Median of Array
- Modular Multiplicative Inverse
- Swap all odd and even bits
- Maximum AND Value
- Minimum adjacent difference in a circular array
- Power Of Numbers
- Maximum occured integer
- String Permutations
- Wave Array
- Frequencies of Limited Range Array Elements
- Equilibrium point
- Leaders in an array
- Count 1's in binary array
- Floor in a Sorted Array
- Minimum Number in a sorted rotated array
- Two Repeated Elements
- Roof Top
- Print adjacency list
- Search in a row-column sorted Matrix
- Interchanging the rows of a Matrix
- Reversing the columns of a Matrix
- Boundary traversal of matrix
- Exchange matrix columns
- Separate chaining in Hashing
- Subarray with 0 sum
- Removing consecutive duplicates
- Removing consecutive duplicates - 2
- Count Total Digits in a Number
- Digital Root
- Ways to write n as sum
- Stickler Thief
- Count number of hops
- Sum of all substrings of a number
- Anagram
- Number of Unique Paths
- Wave Array
- Print Pattern
- Rotation
- Search in a Rotated Array
- Rectangles in N*N Board
- Squares in N*N Chessboard
- Maximize Toys
- Trailing zeroes in factorial
- Non Repeating Character
- Sum of Middle Elements of two sorted arrays
- Good Pairs
- First Repeating Element
- Count Occurences of Anagrams
- Reverse words in a given string
- Count Substrings
- Move all zeroes to end of array
- Remove all duplicates from a given string
- Activity Selection
- Spirally traversing a matrix
- Sort an array of 0s, 1s and 2s
- Two numbers with sum closest to zero
- Finding Number
- Maximum value in a bitonic array
- Finding Position
- Single Number
- Segregate even and odd nodes in a Linked List
- Element that appears once where every element occurs twice
- Longest Distinct characters in string
- N meetings in one room
- Remove Duplicates
- Kth distance
- Addition of submatrix
- Maximum sum increasing subsequence
- Triangular Number
- Key Pair
- Maximum Difference
- Reverse Bits
- Reach the Nth point
- Subarray with given sum
- Count numbers
- Leaders in an array
- Swap all odd and even bits
- Count number of hops
- Equal to product
- Cutting Rectangles
- Segregate 0s and 1s
- Three Great Candidates
- Dearrangement of balls
- Reach a given score
- Largest power of prime
- Chinky and diamonds
- Shop in Candy Store
- Count the Zeros
- 0 - 1 Knapsack Problem
- Skip the work
- Number of ways to find two numbers
- Maximize The Cut Segments
- Game of Death in a circle
- Perfect Numbers
- The Nth Fibonnaci
- Equilibrium point
- Buildings receiving sunlight
- Flip Bits
- Finding the numbers
- Game of cells
- Circle and Lattice Points
- Chocolate Distribution Problem
- 1[0]1 Pattern Count
- Reverse Coding
- Flood fill Algorithm
- Maximum no of 1's row
- Sum of all substrings of a number
- Minimum Operations
- Find all pairs with a given sum
- Largest Fibonacci Subsequence
- K-th element of two sorted Arrays
- Maximum difference Indexes
- Common elements
- Recursive sequence
- Element with left side smaller and right side greater
- First negative integer in every window of size k
- Paths to reach origin
- Subarray with 0 sum
- Get Minimum Squares
- Count all possible paths from top left to bottom right
- Shortest Common Supersequence
- Assign Mice Holes
- Minimum Number in a sorted rotated array
- Bitonic Generator Sort
- Nth item through sum
- Maximum sum Problem
- Minimum indexed character
- Stickler Thief
- Find the most frequent digit
- Compute (a*b)%c
- Count the triplets
- Sub-arrays with equal number of occurences
- Numbers containing 1, 2 and 3
- Next Happy Number
- Find winner of the Game of Nim
- Arya and The Great War
- Find out the Team
- Form a number divisible by 3 using array digits
- Check if array contains contiguous integers with duplicates allowed
- Maximum height of the staircase
- Winner of an election
- Ease the Array
- Amicable Pair
- Print this pattern!
- Counts Zeros Xor Pairs
- Check if a number is divisible by 8
- Mysterious Series
- Common Divisor
- The Inverting Factor
- Print Bracket Number
- The Optimal Selection
- Minimum changes to make all substrings distinct
- Smallest greater elements in whole array
- Save Ironman
- Fitting The Array
- K-th missing element
- Print adjacency list
- Pair with given sum in a sorted array

- Reverse a Linked List in groups of given size.
- Delete nodes having greater value on right
- Count BST nodes that lie in a given range
- Check for BST
- Bottom View of Binary Tree
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Connect Nodes at Same Level
- Flattening a Linked List
- Diagonal Traversal of Binary Tree
- Boundary Traversal of binary tree
- Detect cycle in an undirected graph
- The Celebrity Problem
- Topological sort
- Vertical Traversal of Binary Tree
- Find the number of islands
- Get minimum element from stack
- Circular tour
- Check if subtree
- Kth element in Matrix
- Clone a Binary Tree
- Remove loop in Linked List
- Max length chain
- Minimum Swaps to Sort
- Top View of Binary Tree
- Count More than n/k Occurences
- Occurences of 2 as a digit
- Construct Tree from Preorder Traversal
- C++ Friend function
- C++ Generic sort
- Operations on PriorityQueue
- Pair Sum in BST
- Smallest Positive missing number
- Rearrange Array Alternately
- Rearrange an array with O(1) extra space
- Maximum Index
- Trapping Rain Water
- Kadane's Algorithm
- Merge three sorted arrays
- Level of Nodes
- Make Matrix Beautiful
- Boolean Matrix Problem
- Unit Area of largest region of 1's
- Subarrays with equal 1s and 0s
- Sorting Elements of an Array by Frequency
- Longest consecutive subsequence
- Case-specific Sorting of Strings
- Lexicographic Rank Of A String
- Parenthesis Checker
- Stock span problem
- Next larger element
- Count ways to reach the n'th stair
- Count ways to N'th Stair(Order does not matter)
- Egg Dropping Puzzle
- nCr
- Longest Increasing Subsequence
- Longest Common Subsequence
- Coin Change
- Kadane's Algorithm
- Find Missing And Repeating
- Sum Of Prime
- Excel Sheet | Part - 1
- Maximum Sub Array
- Print Diagonally
- Maximum Index
- Longest Increasing Subsequence
- Parenthesis Checker
- Longest Common Subsequence
- Minimum number of jumps
- Count ways to reach the n'th stair
- Count ways to N'th Stair(Order does not matter)
- Edit Distance
- nCr
- Consecutive 1's not allowed
- Count of Subarrays
- Path in Matrix
- Trapping Rain Water
- Sum of bit differences
- Subset Sum Problem
- Factorials of large numbers
- Number of Coins
- Minimum Platforms
- Stock buy and sell
- Largest Number formed from an Array
- Longest Palindrome in a String
- Modular Exponentiation for large numbers
- Rearrange Array Alternately
- Rearrange an array with O(1) extra space
- Relative Sorting
- Maximum of all subarrays of size k
- Largest square formed in a matrix
- Row with max 1s
- Boolean Matrix Problem
- Sorting Elements of an Array by Frequency
- Nuts and Bolts Problem
- Rotate a 2D array without using extra space
- Number of ways
- Minimum Cost of ropes
- Inversion of array
- Length of the longest substring
- Longest consecutive subsequence
- Convert an array to reduced form
- Palindromic Array
- Is Binary Number Multiple of 3
- Bleak Numbers
- Minimize the heights
- Next larger element
- X Total Shapes
- Matchsticks game
- Kth smallest element
- Longest Common Substring
- Recursively remove all adjacent duplicates
- Shortest Source to Destination Path
- Replace O's with X's
- Find whether path exist
- Unit Area of largest region of 1's
- Rearrange characters
- Express as sum of power of natural numbers
- First non-repeating character in a stream
- Count subsequences of type a^i b^j c^k
- Zero Sum Subarrays
- Minimum number of steps to reach a given number.
- Nearly Sorted Algorithm
- Smallest Positive missing number
- In First But Second
- Row with minimum number of 1's
- Numbers with alternative 1's
- Print N-bit binary numbers having more 1’s than 0’s
- Subarrays with equal 1s and 0s
- Container with most water
- Large Factorials
- Count only Repeated