Data Structure
Java
Python
HTML
Interview Preparation
- Interview Prep
- Tutorials
- Tracks
shubham_rana_77
STREAK
00/1576
days
Longest streak/Global longest streak
Institution
Indian Institute of Technology Kanpur (IIT Kanpur)
1087 RankInstitute Rank
Language Used
C++, C
Coding Score
218
Problem Solved
155
Contest Rating
__
5267 points
Contributor
5267 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 (2)
BASIC (44)
EASY (68)
MEDIUM (35)
HARD (6)
- SP - Palindrome Family
- SP - Stack Design
- Check If Circular Linked List
- Queue using two Stacks
- DFS of Graph
- BFS of graph
- Binary Search
- BST Keys in a Range
- Convert to Roman No
- Search a node in BST
- Josephus problem
- Kth largest element in BST
- Special Stack
- Index of an Extra Element
- Minimum element in BST
- Queue Reversal
- Delete Mid of a Stack
- Product of an Array
- Pair Sum in Vector
- First Set Bit
- Rightmost different bit
- Check K-th Bit
- Power of 2
- Equilibrium Point
- Array Leaders
- Floor in a Sorted Array
- Check if a string is Isogram or not
- Winner of an election
- Reverse Words
- Minimum indexed character
- Parenthesis Checker
- Generate Binary Numbers
- Check Equal Arrays
- Numbers containing 1, 2 and 3
- Missing in Array
- Non-Repeating Element
- Find the closest number
- Chocolate Distribution Problem
- Left most and right most index
- Common Subsequence
- Count Alphabets
- Second Largest
- Check if array contains contiguous integers
- Number of occurrence
- Count even substrings
- String's Count
- Longest Common Prefix of Strings
- Even and odd elements at even and odd positions
- Sum of f(a[i], a[j]) over all pairs in an array of n integers
- Print an array in Pendulum Arrangement
- At Least K Occurrences
- Find the closest pair from two arrays
- Total distance travelled in an array
- Palindrome String
- Print Bracket Number
- Find the Highest number
- Check if a Integer is power of 8 or not
- Lucky Number
- Reverse Bits
- Star elements
- Toggle bits in the given range
- Party of Couples
- Number Of Open Doors
- Row with Minimum 1s
- Damon Prime
- Print Pattern
- Primes sum
- Count all possible paths from top left to bottom right
- Rotate Array
- Print Linked List
- Count Leaves in Binary Tree
- Queue using Linked List
- Queue Using Array
- Replace all 0's with 5
- Circular Linked List Traversal
- Is Linked List Length Even?
- Alternates in an Array
- Number is sparse or not
- Array Search
- Binary String
- Remove common characters and concatenate
- Remove consonants from a string
- Type of array
- Change the string
- Remove characters from alphanumeric string
- Reversing the vowels
- Fake Profile
- A guy with a mental problem
- Message decoding
- One odd Occuring
- Array Subset
- Wrong Ball
- Rotating an Array
- Minimum number to form the sum even
- Count of smaller elements
- The Muskteers
- Magical String[Duplicate Problem]
- Gray Code
- Binary representation
- Set kth bit
- Find the fine
- Check if divisible by 5
- LCM And GCD
- Strong Numbers
- Reverse digits
- Absolute Difference of 1
- Print 1 to n without using loops
- Unique Numbers
- Prime Palindrome Sum
- Half N by M
- Finding Position
- nPr
- SP - Special Subsequences
- SP - Playing with Stacks
- Stack using Queue
- Implement stack using array
- Two Stacks in an Array
- Get Min from Stack
- Validate an IP Address
- Interleaved Strings
- Palindrome Linked List
- Count distinct elements in every window
- Sort a stack
- Peak element
- Find length of Loop
- Count set bits
- Gray to Binary Conversion
- Reverse array in groups
- Possible Words From Phone Digits
- Indexes of Subarray Sum
- Postfix Evaluation
- Stock span problem
- Next Greater Element
- Minimum Cost of ropes
- Zero Sum Subarrays
- Most frequent word in an array of strings
- Sort 0s, 1s and 2s
- Pythagorean Triplet
- Sort in specific order
- Next Smaller Element
- Longest Common Substring
- Transform to prime
- Permutations of a String
- Maximum Tip Calculator
- Sequence of Sequence
- Number of paths
- Recursively Remove Adjacent Duplicates