- Tutorials
- Courses
Data Structure
Java
Python
HTML
Interview Preparation
rajnis09
STREAK
00/1431
days
Longest streak/Global longest streak
Language Used
C++, Java, C, Python
Coding Score
818
Problem Solved
389
Contest Rating
__
10636 points
Contributor
10636 points
Contributor
1 Point
Proficient
Proficient
100 Point
Scholar
Scholar
1k Point
Master
Master
10k Point
Ace
Ace
50k Point
0 submissions in current year
SCHOOL (0)
BASIC (54)
EASY (150)
MEDIUM (171)
HARD (14)
- The Enigma
- Count Linked List Nodes
- Postorder Traversal
- Implement stack using array
- Queue using Linked List
- Queue Using Array
- Doubly linked list Insertion at given position
- Replace all 0's with 5
- Preorder Traversal
- First Occurence
- Search a node in BST
- Peak element
- Linked List Insertion At End
- Minimum element in BST
- Identical Linked Lists
- Insert in Middle of Linked List
- Who has the majority?
- Strongest Neighbour
- Array insert at index
- Array insert at end
- Operations on Stack
- Operations on Queue
- Absolute Value
- Convert Celsius To Fahrenheit
- Quadratic Equation Roots
- Bit Difference
- Number is sparse or not
- Binary To Gray Code Conversion
- Print 1 To N Without Loop
- Reverse array in groups
- Array Search
- Sorted Array Search
- Left Index
- Binary Array Sorting
- Adding two matrices
- Multiply the matrices
- Check if a string is Isogram or not
- Binary String
- Most Frequent Character
- Remove common characters and concatenate
- Sum of numbers in string
- Repeating Character - First Appearance Leftmost
- Sum of Digits of a Number
- Power Using Recursion
- Fibonacci Using Recursion
- Addition Under Modulo
- Multiplication Under Modulo
- Insertion in deque
- Deque Traversal
- Deque deletion
- Keypad typing
- First n Fibonacci
- Betting game
- Minimum At Pop
- Smaller on Right
- Rotate a Linked List
- Sort a linked list of 0s, 1s and 2s
- Add Number Linked Lists
- Detect Loop in linked list
- Count BST nodes that lie in a given range
- Quick Sort
- Binary Tree from Inorder and Postorder
- Bottom View of Binary Tree
- Intersection in Y Shaped Lists
- Diameter of a Binary Tree
- Heap Sort
- Merge two sorted linked lists
- Construct Binary Tree from Parent Array
- Connect Nodes of Levels
- Delete a node from BST
- Directed Graph Cycle
- Undirected Graph Cycle
- LCA in Binary Tree
- Maximum difference between node and its ancestor
- Two Stacks in an Array
- Binary Heap Operations
- The Celebrity Problem
- Topological sort
- Vertical Tree Traversal
- Merge K sorted linked lists
- Find the number of islands
- Serialize and deserialize a binary tree
- Gas Station
- Linked List to Binary Tree
- Check if subtree
- Remove loop in Linked List
- Dijkstra Algorithm
- Minimum Spanning Tree
- Minimum Swaps to Sort
- Palindrome Linked List
- Strongly Connected
- Max sum subarray by removing at most one element
- Closest in BST
- Merge two BST 's
- Merge k Sorted Arrays
- Bridge edge in a graph
- Find triplets with zero sum
- Top View of Binary Tree
- Find Common Nodes in two BSTs
- Merge Sort for Linked List
- Binary Tree to CDLL
- Foldable Binary Tree
- Count the nodes at distance K from leaf
- Maximum path sum from any node
- Children Sum in a Binary Tree
- Convert Level Order Traversal to BST
- ZigZag Tree Traversal
- Count Number of SubTrees having given Sum
- Largest Sum Contiguous Subarray in Range
- Vertical Width of a Binary Tree
- Coin Change - Minimum number of coins
- Pairwise swap of nodes in LinkedList
- Swap Kth nodes from ends
- Mother Vertex
- Rabin Karp - Pattern Searching
- Floor in BST
- Ceil in BST
- Pair Sum in BST
- Count set bits
- Gray to Binary Conversion
- Maximum AND Value
- Tower Of Hanoi
- Smallest Positive Missing
- Power Of Numbers
- Maximum occured integer
- Possible Words From Phone Digits
- Rearrange Array Alternately
- Rearrange an array with O(1) extra space
- Maximum Index
- Stock buy and sell
- Rotate Array
- Check if array is sorted and rotated
- Kadane's Algorithm
- Majority Element
- Count Inversions
- Two Repeated Elements
- Unique BST's
- Union of 2 Sorted Arrays
- Indexes of Subarray Sum
- Count the number of possible triangles
- Triplet Sum in Array
- Number of pairs
- Merge three sorted arrays
- Closer to sort
- Possible paths between 2 vertices
- Level of Nodes
- Make Matrix Beautiful
- Boolean Matrix
- Spirally traversing a matrix
- Search in a sorted Matrix
- Determinant of a Matrix
- Distance of nearest cell having 1
- Unit Area of largest region of 1's
- Subarray with 0 sum
- Subarray range with given sum
- Subarrays with equal 1s and 0s
- Sort Elements by Decreasing Frequency
- Longest Consecutive Subsequence
- Case-specific Sorting of Strings
- Lexicographic Rank Of A String
- Postfix Evaluation
- Stock span problem
- Next Greater Element
- Infix to Postfix
- K Sized Subarray Maximum
- Kth largest element
- Kth smallest element
- Kth largest element in a stream
- K Most occurring elements
- Nearly sorted
- Rearrange characters
- Activity Selection
- Fractional Knapsack
- Job Sequencing Problem
- Minimum Platforms
- Largest number in K swaps
- Rat Maze With Multiple Jumps
- Black and White
- Combination Sum
- Unique Subsets
- M-Coloring Problem
- Detect Cycle using DSU
- Minimum Spanning Tree using Kruskal
- Ways to write n as sum
- Stickler Thief
- Ways to Reach the n'th Stair
- Egg Dropping Puzzle
- Optimal Strategy For A Game
- Minimum number of jumps
- nCr
- Sum of all substrings of a number
- Longest Increasing Subsequence
- Longest Common Subsequence
- 0 - 1 Knapsack Problem
- Range Sum Queries
- Lucky Numbers
- Range Min Max Queries
- Range Longest Correct Bracket Subsequence Queries
- Range GCD Queries
- Range LCM Queries
- Number of Unique Paths
- Equal Sum Partition
- Sort according to an Array
- Allocate Minimum Pages
- Preorder to BST
- X Total Shapes
- Zero Sum Subarrays
- Find whether path exist
- Implement Trie
- Shortest Common Supersequence
- Nth Catalan Number
- Rotten Oranges
- Steps by Knight
- Most frequent word in an array of strings
- Count only Repeated
- Camel Case
- Renaming Cities
- Longest Subarray Of Evens And Odds
- Maximize The Cut Segments
- Maximum Water Between Two Buildings
- Return two prime numbers
- Fraction Trouble
- Check if a String is Subsequence of Other
- Get the Shadow
- Sum Array
- Clone List with Next and Random
- Merge Sort on Doubly Linked List
- Huffman Decoding
- Pattern Search KMP
- Trapping Rain Water
- Max Circular Subarray Sum
- Pattern Search
- Max of min for every window size
- Find median in a stream
- Solve the Sudoku
- Minimum Cost Path
- Contiguous Elements XOR
- Articulation Point - II
- Articulation Point - I
- Continuous Series
- The Manipulator
- Continuous Series
- Reverse a linked list
- Remove duplicates from an unsorted linked list
- Inorder Traversal
- Bubble Sort
- Insertion Sort
- Check for BST
- Right View of Binary Tree
- Mirror Tree
- Maximum Width of Tree
- Delete without head pointer
- Height of Binary Tree
- Balanced Tree Check
- Kth from End of Linked List
- Left View of Binary Tree
- Find Transition Point
- Queue using two Stacks
- Remove Duplicates from a Sorted Linked List
- Stack using two queues
- Level Order in spiral form
- DFS of Graph
- Stack using Linked List
- Insert a node in a BST
- BFS of graph
- Identical Trees
- Square Root
- Lowest Common Ancestor in a BST
- Remove Duplicates Sorted Array
- Level Order Line by Line
- BST Keys in a Range
- Josephus problem
- Three way partitioning
- Level order traversal
- More than n/k Occurrences
- Counting Sort
- Find length of Loop
- Queue Reversal
- Reverse first K of a Queue
- Delete Mid of a Stack
- Learn to Comment - Java
- nextLine and next
- Sum of Big Integers
- BigInteger Multiply
- Get min at pop
- Deque Implementations
- Max and Second Max
- Hashing for pair - 1
- Hashing for pair - 2
- Fibonacci Numbers - Top Down DP
- Fibonacci Numbers - Bottom Up DP
- Coin Change - Number of ways
- Kadane's Algorithm - I
- Kadane's Algorithm - II
- Inorder traversal of a BST
- Levelorder traversal of a BST
- First Set Bit
- Rightmost different bit
- Check K-th Bit
- Factorial Of Number
- Digits In Factorial
- GP Term
- Primality Test
- Longest Consecutive 1's
- Exactly 3 Divisors
- Mean And Median of Array
- Modular Inverse
- Power of 2
- Swap odd and even bits
- Minimum adjacent difference in a circular array
- Wave Array
- Frequencies in a Limited Array
- Equilibrium Point
- Array Leaders
- Count 1's in binary array
- Floor in a Sorted Array
- Minimum Number in a sorted rotated array
- Roof Top
- Intersection of two sorted arrays
- Closet 0s 1s and 2s
- Sort by Absolute Difference
- Print adjacency list
- Sum of upper and lower triangles
- Print Matrix in snake Pattern
- Transpose of Matrix
- Rotate by 90 degree
- Interchanging the rows of a Matrix
- Reversing the columns of a Matrix
- Matrix Boundary Traversal
- Exchange matrix columns
- Separate chaining in Hashing
- Naive Pattern Search
- Linear Probing in Hashing
- Quadratic Probing in Hashing
- Count Non-Repeated Elements
- Print Non-Repeated Elements
- Anagram
- Winner of an election
- String Rotated by 2 Places
- Strings Rotations of Each Other
- Isomorphic Strings
- The Modified String
- Reverse Words
- Minimum indexed character
- Panagram Checking
- Non Repeating Character
- Removing consecutive duplicates
- Removing consecutive duplicates - 2
- Parenthesis Checker
- Generate Binary Numbers
- K largest elements
- Minimum Cost of ropes
- N meetings in one room
- Largest number with given sum
- Count Digits in a Number
- Digital Root
- Power Set Using Recursion
- Union-Find
- Number of Connected Components
- Count number of hops
- Rotate Deque By K
- First Repeating Element
- Union of Arrays with Duplicates
- Reach a given score
- Check Equal Arrays
- Nth number made of prime digits
- Numbers containing 1, 2 and 3
- Positive Negative Pair
- Search Query for Strings
- Intersection of Arrays with Distinct
- Count the Zeros
- Print Pattern
- Minimum Difference in an Array
- A Boolean Matrix Problem
- Toggle The Middle
- Nearest Perfect Square
- The Conversion To One
- K Sum
- XOR Pair
- Closest friends!
- Pairing the brackets
- Maximum Integer Value
- Doubly Linked List Conversion
- Average of String
- Rolling Hash
- Level them All!
- Strange Median!
- Alternate Leaf Nodes Sum
- Kth Maximum element of Max-Heap
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy