Name

Nikhil Sojan

Rank in Institute

#1

Overall Coding Score: 2176

Monthly Coding Score: 0

Weekly Coding Score: 0

- Count Leaves in Binary Tree
- Height of Binary Tree
- Finding middle element in a linked list
- Implement Stack using Linked List
- Implement Queue using Linked List
- Binary Search
- Implement strstr
- Implement Atoi
- Minimum distance between two numbers
- Power of 2
- Pythagorean Triplet
- Majority Element
- Permutations of a given string
- Missing number in array
- Number of paths
- Count total set bits
- Number is sparse or not
- Bit Difference
- Convert array into Zig-Zag fashion
- Reverse array in groups
- Longest Consecutive 1's
- Check if two arrays are equal or not
- Check if string is rotated by two places
- Find first set bit
- Find first repeated character
- Find the element that appears once in sorted array
- Last index of One
- Transpose of Matrix
- First element to occur k times
- Check whether K-th bit is set or not
- Uncommon characters
- Max Sum Subarray of size K
- Rightmost different bit
- Set kth bit
- Toggle bits given range
- Print first n Fibonacci Numbers
- Remove common characters and concatenate
- Good or Bad string
- Repeated Character
- Check if strings are rotations of each other or not
- Height of Heap

- Reverse a linked list
- Occurence of an integer in a Linked List
- Delete N nodes after M nodes of 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
- Rearrange a linked list
- Compare two linked lists
- Merge 2 sorted linked list in reverse order
- Detect Loop in linked list
- Remove duplicates from an unsorted linked list
- Sorted insert for circular linked list
- Split a Circular Linked List into two halves
- Reverse a Doubly Linked List
- Insertion Sort
- Merge Sort
- Quick Sort
- Right View of Binary Tree
- K distance from root
- 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
- Delete Middle of Linked List
- Merge two sorted linked lists
- Sum Tree
- Decimal Equivalent of Binary Linked List
- 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
- Root to leaf path sum
- Print all nodes that don't have sibling
- Absolute List Sorting
- Lowest Common Ancestor in a BST
- Implement two stacks in an array
- Binary Heap Operations
- Max sum path in two arrays
- Run Length Encoding
- 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
- Minimum Depth of a Binary Tree
- Odd even level difference
- Binary Tree to BST
- K-Palindrome
- Max sum in the configuration
- Remove every k'th node
- Is Binary Tree Heap
- Multiply two linked lists
- Distinct occurrences
- Sorted subsequence of size 3
- Josephus problem
- Expression Tree
- Check if Linked List is Palindrome
- Longest Consecutive Subsequence
- Delete a Node in Single Linked List
- Kth largest element in BST
- Find duplicates in an array
- Count distinct elements in every window
- Max Level Sum in Binary Tree
- Special Stack
- Root to leaf paths sum
- Three way partitioning
- Sort a stack
- Longest consecutive sequence in Binary tree
- Print Common Nodes in BST
- Level order traversal
- Peak element
- Inorder Successor in BST
- Index Of an Extra Element
- Merge Sort for Linked List
- Convert Ternary Expression to Binary Tree
- Union of Two Linked Lists
- Intersection of Two Linked Lists
- Insert in a Sorted List
- Ancestors in Binary Tree
- Level of a Node in Binary Tree
- Sum of leaf nodes in BST
- Root to Leaf Paths
- Maximum path sum
- Counting Sort
- Counting elements in two arrays
- Reverse a string using Stack
- Full binary tree
- Symmetric Tree
- Construct Tree from Inorder & Preorder
- Vertical sum
- Count Pairs whose sum is equal to X
- Check if Tree is Isomorphic
- Predecessor and Successor
- Maximum Node Level
- Children Sum Parent
- Find length of Loop
- Median of BST
- Normal BST to Balanced BST
- Reverse First K elements of Queue
- Remove Half Nodes
- Sum of Leaf Nodes
- Check if two Nodes are Cousins
- ZigZag Tree Traversal
- Sum of Leaf Nodes at Min Level
- Vertical Width of a Binary Tree
- Rotate doubly Linked List
- C++ Multi-level inheritance
- Java Collections | Set 7 (LinkedList)
- C++ Template
- The Size of
- Taking input
- Learn to Comment
- Learning to be precise
- While loop- printTable
- Learning Macros
- The New Line - Java
- Learn to Comment - Java
- Bitwise Operators - Java
- Xoring and Clearing - Java
- Magic in CPP
- Swap the objects
- Structs and Objects
- Two Dimensional World
- Learning Structs
- Delete Array
- Pair in Java
- Maximum Area Rectangle
- Sum of Big Integers
- BigInteger Multiply
- Find the Frequency
- Back to Front
- Pair Sum in Vector
- ArrayList Operation
- Stack Operations
- Queue Operations
- Deque Implementations
- Min Heap implementation
- Frequency Game
- Multiset Operations
- Multimap Operations
- Dictionary Usage 2 - Java
- Print adjacency list
- Subarray with 0 sum
- Reverse words in a given string
- Minimum indexed character
- Pangram Checking
- Minimum indexed character
- Frequencies of Limited Range Array Elements
- Anagram
- Number of Unique Paths
- Wave Array
- Pattern Searching
- Print Pattern
- Rotation
- Search in a Rotated Array
- Squares in N*N Chessboard
- Magic Number
- Maximize Toys
- Non Repeating Character
- Minimum number of Coins
- Sum of Middle Elements of two sorted arrays
- First Repeating Element
- 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
- Pairs with difference k
- Two numbers with sum closest to zero
- Finding Number
- Maximum value in a bitonic array
- Next greater number set digits
- Finding Position
- Amount of Water
- 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
- Count distinct pairs with difference k
- Column name from a given column number
- N meetings in one room
- Remove Duplicates
- Maximum sum increasing subsequence
- Array to BST
- Facing the sun
- Max Sum without Adjacents
- Key Pair
- Maximum Difference
- Length Unsorted Subarray
- Reverse Bits
- Reach the Nth point
- Subarray with given sum
- Leaders in an array
- Swap all odd and even bits
- Count number of hops
- Equal to product
- Count pairs with given sum
- Inorder Traversal and BST
- Two Repeated Elements
- Three Great Candidates
- Reach a given score
- Minimum element in a sorted and rotated array
- Search in a matrix
- Largest power of prime
- Chinky and diamonds
- Largest number possible
- Missing element of AP
- Count the Zeros
- 0 - 1 Knapsack Problem
- Skip the work
- Tom and Jerry
- Extract the Number from the String
- Cutted Segments
- Game of Death in a circle
- Perfect Numbers
- Change Bits
- Largest number with given sum
- Equilibrium point
- Floor in a Sorted Array
- Buildings receiving sunlight
- Maximize Dot Product
- Finding the numbers
- Count Increasing Subsequences
- Collecting Trees
- Min sum formed by digits
- Chocolate Distribution Problem
- Binary Tree K level sum
- Maximum Sum Bitonic Subsequence
- 1[0]1 Pattern Count
- Knapsack with Duplicate Items
- Reverse Coding
- Flood fill Algorithm
- Roman Number to Integer
- Maximum no of 1's row
- Friends Pairing Problem
- Decode the string
- Gold Mine Problem
- Smallest subarray with sum greater than x
- Minimum Operations
- Find all pairs with a given sum
- Check if frequencies can be equal
- Largest zigzag sequence
- Increasing Sub Sequence
- Longest Palindromic Subsequence
- K-th element of two sorted Arrays
- Evaluation of Postfix Expression
- Common elements
- Rod Cutting
- Fill array with 1's
- Element with left side smaller and right side greater
- Array Subset of another array
- First negative integer in every window of size k
- Sum of product of all pairs
- Paths to reach origin
- Subarray with 0 sum
- Nth catalan number
- Group Anagrams Together
- Number of divisors in a given range
- Sum equals to Sum
- Carry counter
- Count the elements
- Second most repeated string in a sequence
- Count all possible paths from top left to bottom right
- Shortest Common Supersequence
- Sort by Absolute Difference
- Primes sum
- Swapping pairs make sum equal
- Toppers Of Class
- String Ignorance
- Jumping Caterpillars
- Count of strings that can be formed using a, b and c under given constraints
- Sum of average of all subsets
- Maximum sum Problem
- String comparison
- Minimum indexed character
- Minimum Cost To Make Two Strings Identical
- Stickler Thief
- Remaining String
- Even and odd elements at even and odd positions
- Compute (a*b)%c
- Maximum number of zeroes
- Transform the array
- Roll the characters of a String
- Chocolate Station
- Common Subsequence
- Count the triplets
- Star elements
- Sum of two large numbers
- Find the minimum time
- Pairs with Positive Negative values
- Numbers containing 1, 2 and 3
- Non-Repeating Element
- Pairs which are Divisible by 4
- Find winner of the Game of Nim
- Arya and The Great War
- Mystic Falls School
- Nearest multiple of 10
- 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
- Count ways to express N as the sum of 1,3 and 4
- Counts Zeros Xor Pairs
- Swap every two bits in bytes
- Find the closest pair from two arrays
- Print Bracket Number
- Minimum changes to make all substrings distinct
- Minimal moves to form a string
- Save Ironman
- K-th missing element
- Print adjacency list
- Pair with given sum in a sorted array

- Given a linked list, reverse alternate nodes and append at the end
- Reverse a Linked List in groups of given size.
- Delete nodes having greater value on right
- Quick Sort on Linked List
- 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
- Flattening a Linked List
- Diagonal Traversal of Binary Tree
- Boundary Traversal of binary tree
- Delete a node from BST
- Detect cycle in a directed graph
- Detect cycle in an undirected graph
- Min distance between two given nodes of a Binary Tree
- Maximum difference between node and its ancestor
- The Celebrity Problem
- Topological sort
- Print a Binary Tree in Vertical Order
- Merge K sorted linked lists
- Find the number of islands
- Get minimum element from stack
- Serialize and Deserialize a Binary Tree
- Circular tour
- Wildcard Pattern Matching
- Make Binary Tree From Linked List
- Check if subtree
- Kth element in Matrix
- Remove loop in Linked List
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Max length chain
- Minimum Spanning Tree
- Largest BST
- Interleaved Strings
- Sum of permutations
- LRU Cache
- Box Stacking
- Multiply two strings
- Minimum Swaps to Sort
- Strongly Connected Components (Kosaraju's Algo)
- Rat in a Maze Problem
- Bipartite Graph
- Max sum subarray by removing at most one element
- Number of root to leaf paths
- Find the Closest Element in BST
- Pots of Gold Game
- Delete keys in a Linked list
- Merge two BST 's
- Merge k Sorted Arrays
- Print Nodes having K leaves
- Duplicate subtree in Binary Tree
- Top View of Binary Tree
- k-th smallest element in BST
- Polynomial Addition
- Euler Circuit in a Directed Graph
- Euler circuit and Path
- Binary Tree to CDLL
- Find a pair with given target in BST
- Occurences of 2 as a digit
- Populate Inorder Successor for all nodes
- Construct expression tree
- K-Sum Paths
- Foldable Binary Tree
- Leftmost and rightmost nodes of binary tree
- Construct tree from Inorder and LevelOrder
- Node at distance
- Mirror of a given node
- Pairs violating BST property
- Maximum path sum from any node
- Leaves to DLL
- Largest Independent Set Problem
- Right Sibling in Binary Tree
- Construct Tree from Preorder Traversal
- Construct a Full Binary Tree
- Convert Level Order Traversal to BST
- Count Number of SubTrees having given Sum
- Path Count in Directed Graph
- C++ Generic sort
- Operations on PriorityQueue
- Swap Kth nodes from ends
- Add two numbers represented by Linked List
- Maximum sum of Non-adjacent nodes
- Smallest Positive missing number
- Unique BST's
- Unit Area of largest region of 1's
- Sorting Elements of an Array by Frequency
- Longest consecutive subsequence
- Case-specific Sorting of Strings
- Kth largest element in a stream
- Count ways to N'th Stair(Order does not matter)
- Coin Change
- Kadane's Algorithm
- Find Missing And Repeating
- Sum Of Prime
- Excel Sheet | Part - 1
- Maximum Sub Array
- Print Diagonally
- Overlapping Intervals
- Maximum Index
- Equal Sum
- Next Permutation
- 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
- Count of n digit numbers whose sum of digits equals to given sum
- Edit Distance
- nCr
- Longest Span with same Sum in two Binary arrays
- Min Coin
- Consecutive 1's not allowed
- Count of Subarrays
- Longest Even Length Substring
- Path in Matrix
- Trapping Rain Water
- String formation from substring
- Case-specific Sorting of Strings
- Sum of bit differences
- Subset Sum Problem
- Maximize The Array
- Factorials of large numbers
- Number of Coins
- Minimum Platforms
- Number following a pattern
- Find Prime numbers in a range
- Stock buy and sell
- Largest Number formed from an Array
- Number of paths in a matrix with k coins
- Jumping Numbers
- Longest Palindrome in a String
- Modular Exponentiation for large numbers
- Rearrange Array Alternately
- Concatenation of Zig-Zag String in ānā Rows
- Relative Sorting
- Maximum of all subarrays of size k
- Row with max 1s
- Boolean Matrix Problem
- Sorting Elements of an Array by Frequency
- Design a tiny URL or URL shortener
- Nuts and Bolts Problem
- Rotate a 2D array without using extra space
- Special Keyboard
- Number of ways
- Dyck Path
- Minimum Cost of ropes
- Sum of Query II
- Form a palindrome
- Inversion of array
- Preorder to Postorder
- Maximum length Bitonic Subarray
- Length of the longest substring
- Smallest number on left
- Longest consecutive subsequence
- Maximum Sum Path in Two Arrays
- Stock span problem
- Convert an array to reduced form
- M-Coloring Problem
- Minimum steps to get desired array
- Subsequence matching
- Number to words
- Palindromic Array
- Betting game
- Is Binary Number Multiple of 3
- Possible groups
- Preorder Traversal and BST
- Card Rotation
- Search Pattern
- Longest Arithmetic Progression
- Jumbled Strings
- Palindromic Strings
- Max possible amount
- Bleak Numbers
- Circle of strings
- Largest number in K swaps
- Special Matrix
- Minimize the heights
- Next larger element
- Composite and Prime
- Taking 1 out of 3 consecutives
- X Total Shapes
- Total Decoding Messages
- Unique BST's
- Distinct Transformations
- Subsets
- Matchsticks game
- Combination Sum
- Combination Sum - Part 2
- Word Break
- Kth smallest element
- Transform String
- 3 Divisors
- Sum of Subarrays
- Maximum calorie
- Prime Factors and their Powers
- Longest Common Substring
- Count Palindrome Sub-Strings of a String
- Check if a string is repetition of its substring of k-length
- Rotate and delete
- Negative weight cycle
- Hamiltonian Path
- Snake and Ladder Problem
- Recursively remove all adjacent duplicates
- Shortest Source to Destination Path
- Number of Palindromic paths in a Matrix
- Trie | (Insert and Search)
- Replace O's with X's
- Knight Walk
- Find all four sum numbers
- Word Boggle
- Print leaf nodes from preorder traversal of BST
- Distance of nearest cell having 1
- Is Sudoku Valid
- Find whether path exist
- Check Mirror in N-ary tree
- 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
- Kth Smallest Factor
- Count subsequences of type a^i b^j c^k
- Stepping Numbers
- K
^{th}largest element in a stream - Water Overflow
- Zero Sum Subarrays
- Smallest window in a string containing all the characters of another string
- Smallest distinct window
- Floyd Warshall
- Huffman Encoding
- Nearly Sorted Algorithm
- Infix to Postfix
- Geek collects the balls
- Largest Sum Subarray of Size at least K
- Smallest Positive missing number
- Longest Bitonic subsequence
- Mobile numeric keypad
- Minimum Time
- Perfect Sum Problem
- Array Pair Sum Divisibility Problem
- Job Sequencing Problem
- Top k numbers in a stream
- Page Faults in LRU
- Rotten Oranges
- Prime factorization and geek number
- Longest Common Prefix in an Array
- Minimum cost to fill given weight in a bag
- Count even length
- Steps by Knight
- In First But Second
- Mail System Design
- Row with minimum number of 1's
- Numbers with alternative 1's
- Count of sum of consecutives
- Matrix Chain Multiplication
- Maximum bitonic subarray sum
- Maximum Tip Calculator
- Alternate Vowel and Consonant String
- Print N-bit binary numbers having more 1ās than 0ās
- Biconnected Graph
- Last two digits of Fibonacci
- Pizza Mania
- Lazy Pasha
- Longest subarray with sum divisible by K
- Subarrays with equal 1s and 0s
- Make Matrix Beautiful
- Longest Sub-Array with Sum K
- The Tiny Miny
- Letters Collection
- Marks of PCM
- Container with most water
- Save Gotham!
- The Painter's Partition Problem
- Minimum swaps and K together
- Maximize the sum of selected numbers from an array to make it empty
- Large Factorials
- Lucky alive person in a circle
- Castle RUN
- Smaller on Left
- Optimal Strategy For A Game

- QuickSort on Doubly Linked List
- Reorder List
- Binary Tree to DLL
- AVL Tree Insertion
- Longest Palindromic Substring in Linear Time
- Alien Dictionary
- AVL Tree Deletion
- Nodes at given distance in binary tree
- Fixing Two nodes of a BST
- Number of Turns in Binary Tree
- Solve the Sudoku
- Minimum Points To Reach Destination
- Minimum sum partition
- Maximum of minimum for every window size
- Head to Tail ordering
- Merge Without Extra Space
- Next Smallest Palindrome
- Find sum of different corresponding bits for all pairs
- Return two prime numbers
- Allocate minimum number of pages
- A Simple Fraction
- Ugly Numbers
- Path of greater than equal to k length
- Create your own Calculator
- Boolean Parenthesization
- Word Break - Part 2
- Minimum Cost Path
- N-Queen Problem
- Solve the Sudoku
- Strongly connected component (Tarjans's Algo)
- Find median in a stream
- Travelling Salesman Problem
- Max Circular Subarray Sum
- Distinct palindromic substrings
- Similar expressions
- Convert to Strictly increasing array
- Phone directory
- Numbers with one absolute difference
- Count the subarrays having product less than k
- Closest Palindrome
- Doctor Strange
- Minimum number to make median X