- Search an Element in an array
- Factorial
- Prime Number
- LCM And GCD
- GCD of Array
- Searching a number
- Power of 2
- Sort The Array
- Nth Fibonacci Number
- Strong Number
- Majority Element
- Sieve of Eratosthenes
- Shortest path from 1 to n
- Dice throw
- Permutations of a given string
- Missing number in array
- Maximum product of two numbers
- Number of paths
- Bit Difference
- Greater on right side
- Convert array into Zig-Zag fashion
- k largest elements
- Find position of set bit
- Ways To Tile A Floor
- Generate Binary Numbers
- Find the Odd Occurence
- Reverse array in groups
- The AND Gate
- The OR Gate
- 1's Complement
- Set Bits
- Professor and Parties
- Minimize the sum of product
- Sum of dependencies in a graph
- Check if two arrays are equal or not
- Check if string is rotated by two places
- Find first set bit
- Index of first 1 in a sorted array of 0’s and 1’s
- Does array represent Heap
- Find the element that appears once in sorted array
- Last index of One
- Transpose of Matrix
- Check whether K-th bit is set or not
- Sorted matrix
- Sum Terms Nth Row
- Count pair sum
- Alternative Sorting
- Check set bits
- Set kth bit
- Count Pairs Odd Xor
- Toggle bits given range
- Print first n Fibonacci Numbers
- Print Matrix in snake Pattern
- Anshuman's Favourite Number
- Find unique element
- Find the fine
- One's Complement
- Series X1
- Special Series Sum
- Special Odd Series Sum
- Message Spreading
- Last duplicate element in a sorted array
- Sum of f(a[i], a[j]) over all pairs in an array of n integers
- Game with nos
- Play With OR
- Why is Melody so chocolaty?
- Ishaan's Internship
- Ishaan Loves Chocolates
- Cricket Average
- The Penalty Shootout
- Difference series
- Multiply left and right array sum.
- Gray Code
- Doctors Clinic
- How Many X's?
- Height of Heap
- Print Linked List elements
- Count nodes of linked list
- Node at a given index in linked list
- Power of Four
- Delete node in Doubly Linked List
- Size of Binary Tree
- Inorder Traversal
- Bubble Sort
- Count Leaves in Binary Tree
- Selection Sort
- Height of Binary Tree
- Finding middle element in a linked list
- Circular Linked List
- Postorder Traversal
- Implement Stack using Linked List
- Implement stack using array
- Implement Queue using array
- Binary Search
- Remove duplicate elements from sorted Array
- Add two fractions
- 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
- Remainder with 7
- Find Number of Numbers
- Find triplets with zero sum
- Linked List Insertion
- Minimum element in BST
- Circular Linked List Traversal
- Linked List Length Even or Odd?
- Delete Alternate Nodes
- Identical Linked Lists
- Find the Sum of Last N nodes of the Linked List
- Maximum in Struct Array
- Queue Reversal
- Triplet Family
- Sum of Binary Tree
- Insert in Middle of Linked List
- longest substring containing '1'
- Count Non-Leaf Nodes in Tree
- Sort and Reverse Vector
- Front to Back
- Stack designer

Name

djikstra

Rank in Institute

#54

Courses Attended

Campus Ambassador

Overall Coding Score: 1069

Monthly Coding Score: 0

Weekly Coding Score: 0

- Frequencies of Limited Range Array Elements
- Anagram
- Number of Unique Paths
- Maximum Gap
- Print Pattern
- Search in a Rotated Array
- Subarray with least average
- Maximize Toys
- Minimum number of Coins
- First Repeating Element
- 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
- Finding Position
- Amount of Water
- Single Number
- Element that appears once where every element occurs twice
- N meetings in one room
- Maximum sum increasing subsequence
- Facing the sun
- Key Pair
- Product array puzzle
- Count Smaller elements
- Subarray with given sum
- Adjacents are not allowed
- Leaders in an array
- Count number of hops
- Count pairs with given sum
- Inorder Traversal and BST
- Three Great Candidates
- Reach a given score
- Shop in Candy Store
- Largest number possible
- Count the Zeros
- 0 - 1 Knapsack Problem
- Skip the work
- Tom and Jerry
- Number of ways to find two numbers
- Cutted Segments
- Maximum average subarray
- Game of Death in a circle
- Perfect Numbers
- Raju and coins
- Largest number with given sum
- Element appearing once
- Equilibrium point
- Floor in a Sorted Array
- LCS with permutations
- Adding Ones
- Deficient Number
- Count Pairs in an Array
- Chocolate Distribution Problem
- Maximum Sum Bitonic Subsequence
- Sum of k smallest elements in BST
- Reverse Coding
- Flood fill Algorithm
- Maximum no of 1's row
- Drive the car
- Friends Pairing Problem
- Gold Mine Problem
- Minimum Operations
- Palindromic patitioning
- Meta Strings
- Increasing Sub Sequence
- Longest Palindromic Subsequence
- K-th element of two sorted Arrays
- Rod Cutting
- Element in a Series
- Transitive closure of a Graph
- Array Subset of another array
- Karatsuba Algorithm
- Paths to reach origin
- Nth catalan number
- Count all possible paths from top left to bottom right
- Largest Permutation
- Count the number of ways to tile the floor of size n x m using 1 x m size tiles
- Longest alternating subsequence
- Count of strings that can be formed using a, b and c under given constraints
- Maximum sum Problem
- Stickler Thief
- Compute (a*b)%c
- Even Fibonacci Numbers Sum
- Count the triplets
- Pairs with Positive Negative values
- Minimum rotations to unlock a circular lock
- Geek and his Tricky Series
- Find if string is K-Palindrome or not
- Pairs which are Divisible by 4
- Find winner of the Game of Nim
- Maximum difference of zeros and ones in binary string
- Arya and The Great War
- Reorganize The Array
- Check if array contains contiguous integers with duplicates allowed
- Rearrange an array such that arr[i] = i
- Ease the Array
- Amicable Pair
- Count ways to express N as the sum of 1,3 and 4
- Counts Zeros Xor Pairs
- String Modification
- Check if a number is divisible by 8
- Arya's Long String
- Ishaan and Sticks
- Akaash's Assignment
- The Inverting Factor
- The Even Array
- Minimum changes to make all substrings distinct
- Pair with given sum in a sorted array
- Reverse a linked list
- Occurence of an integer in a Linked List
- Delete N nodes after M nodes of a linked list
- Pairwise swap elements of a linked list
- Given a linked list of 0s, 1s and 2s, sort it.
- Add 1 to a number represented as linked list
- linked list of strings forms a palindrome
- Compare two linked lists
- Detect Loop in linked list
- Remove duplicates from an unsorted linked list
- Insertion Sort
- Merge Sort
- Quick Sort
- Right View of Binary Tree
- Mirror Tree
- Two Mirror Trees
- Maximum Width of Tree
- Diameter of Binary Tree
- Check for Balanced Tree
- Heap Sort
- Nth node from end of linked list
- Left View of Binary Tree
- Merge two sorted linked lists
- Sum Tree
- Transform to Sum Tree
- Intersection of two sorted Linked lists
- Find Transition Point
- Queue using two Stacks
- Remove duplicate element from sorted Linked List
- Stack using two queues
- Level order traversal in spiral form
- Reverse Level Order Traversal
- DFS of Graph
- Insert a node in a BST
- BFS of graph
- Lowest Common Ancestor in a Binary Tree
- Determine if Two Trees are Identical
- 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
- Print BST elements in given range
- Largest subarray with 0 sum
- Leaf at same level
- Distinct occurrences
- Josephus problem
- Expression Tree
- Check if Linked List is Palindrome
- Max distance between same elements
- Check whether BST contains Dead End
- Kth largest element in BST
- Max Level Sum in Binary Tree
- Special Stack
- Sort a stack
- Level order traversal
- Peak element
- Inorder Successor in BST
- Delete nodes greater than k
- Index Of an Extra Element
- Convert Ternary Expression to Binary Tree
- Union of Two Linked Lists
- Intersection of Two Linked Lists
- Split Singly Linked List Alternatingly
- Ancestors in Binary Tree
- Level of a Node in Binary Tree
- Sum of leaf nodes in BST
- Root to Leaf Paths
- Maximum path sum
- Max and min element in Binary Tree
- Perfect Binary Tree
- Reverse a string using Stack
- Full binary tree
- Symmetric Tree
- Construct Tree from Inorder & Preorder
- Merge Lists Alternatingly
- Huffman Decoding
- Huffman Decoding-1
- Vertical sum
- Count Pairs whose sum is equal to X
- Check if Tree is Isomorphic
- Predecessor and Successor
- Maximum Node Level
- Children Sum Parent
- Diagonal Sum In Binary Tree
- Find length of Loop
- Change of Key in BST
- Reverse First K elements of Queue
- Sum of Leaf Nodes
- Sum of Right Leaf Nodes
- Sum of Left Leaf Nodes
- Nodes at Odd Levels
- Closest Neighbor in BST
- Sum of the Longest Bloodline of a Tree
- Exchange the Leaf Nodes
- Kth Ancestor in a Tree
- ZigZag Tree Traversal
- Sum of Leaf Nodes at Min Level
- Tilt of Binary Tree
- Delete middle element of a stack
- Vertical Width of a Binary Tree
- Find the Frequency
- Back to Front
- Pair Sum in Vector
- Student of the Year

- Coin Change
- Kadane's Algorithm
- Find Missing And Repeating
- 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)
- Egg Dropping Puzzle
- Edit Distance
- nCr
- Path in Matrix
- Trapping Rain Water
- Sum of bit differences
- Subset Sum Problem
- Number of Coins
- Minimum Platforms
- Find Prime numbers in a range
- Stock buy and sell
- Largest Number formed from an Array
- Longest Palindrome in a String
- Modular Exponentiation for large numbers
- 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
- Special Keyboard
- Number of ways
- Minimum Cost of ropes
- Form a palindrome
- Preorder to Postorder
- Convert an array to reduced form
- Handshakes
- Is Binary Number Multiple of 3
- Maximum Profit
- Special Matrix
- Minimize the heights
- Unique BST's
- Combination Sum - Part 2
- Kth smallest element
- Longest Common Substring
- Recursively remove all adjacent duplicates
- Replace O's with X's
- Find whether path exist
- Largest prime factor
- Check Mirror in N-ary tree
- Unit Area of largest region of 1's
- Rearrange characters
- First non-repeating character in a stream
- Count subsequences of type a^i b^j c^k
- K
^{th}largest element in a stream - Floyd Warshall
- Nearly Sorted Algorithm
- Longest Bitonic subsequence
- Perfect Sum Problem
- Job Sequencing Problem
- Page Faults in LRU
- Row with minimum number of 1's
- Matrix Chain Multiplication
- Maximum Tip Calculator
- Lazy Pasha
- Container with most water
- 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
- Tree from Postorder and Inorder
- Bottom View of Binary Tree
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Add all greater values to every node in a BST
- Construct Binary Tree from Parent Array
- Connect Nodes at Same Level
- Clone a linked list with next and random pointer
- Diagonal Traversal of Binary Tree
- Boundary Traversal of binary tree
- Detect cycle in a directed graph
- Detect cycle in an undirected graph
- Topological sort
- Find the number of islands
- Get minimum element from stack
- Serialize and Deserialize a Binary Tree
- Make Binary Tree From Linked List
- Check if subtree
- Extreme nodes in alternate order
- Clone a Binary Tree
- Max length chain
- Interleaved Strings
- Rat in a Maze Problem
- Bipartite Graph
- Find the Closest Element in BST
- Delete keys in a Linked list
- Top View of Binary Tree
- k-th smallest element in BST
- Populate Inorder Successor for all nodes
- Leaves to DLL
- Count Number of SubTrees having given Sum
- Unique BST's
- Count ways to N'th Stair(Order does not matter)