Loading the journal
Srujan's problems
86 logged from Srujan's dsa-problems journal. Search or filter by difficulty.
86 of 86
- 01Two Sum
LeetCode · Hash Table+9Easy - 01Contains DuplicateNeetCode 150 · Hash Table / Set+9Easy
- 02Sparse ArraysHackerRank · Hash Table, Frequency CounterEasy
- 03Max Element in ArraySmart Interviews · Linear Traversal / Simple ScanEasy
- 03The Missing NumberCustom · Summation/XOR LogicEasy
- 03Odd and Even SumCustom · Conditional SummationEasy
- 04Find Duplicate Number in ArraySmart Interviews · Cycle Detection (Floyd's Tortoise and Hare)Medium
- 04Number Distribution (Frequency Count)Smart Interviews · Frequency Counting / HashingEasy
- 05Triangle ValidatorSmart Interviews · Geometry / Inequality RuleEasy
- 05Arithmetic OperatorsSmart Interviews · Conditional Logic / SwitchEasy
- 05Arithmetic Progression CheckSmart Interviews · Sequence Check / DifferenceEasy
- 05FactorialSmart Interviews · Iteration / RecursionEasy
- 05Natural Numbers SumSmart Interviews · Arithmetic Series FormulaEasy
- 06Matrix Row and Column SumsSmart Interviews · Streaming Input / 1D Array SimulationEasy
- 06Lower Triangle SumSmart Interviews · Index-based Traversal / ConditionalsEasy
- 06Submatrix SumCustom/Smart Interviews · Range Query / 2D Prefix Sum (Optimized)Medium
- 07Filled and Hollow RectangleCustom · Basic Nested LoopsEasy
- 07Half Diamond PatternCustom · Symmetry CombinationEasy
- 07Triangle and Pyramid PatternsCustom · Row-Index Dependent PrintingEasy
- 08Odd Even IndexSmart Interviews · Index-based Conditional TraversalEasy
- 08Digit String CheckSmart Interviews · Character Type CheckEasy
- 08Letter Coverage (Pangram Check)Smart Interviews · Boolean Array / Frequency HashingEasy
- 08Vowels and ConsonantsSmart Interviews · Character Set CheckEasy
- 09Compress String (Run-Length Encoding)Smart Interviews · Run-Length Encoding / Two PointersMedium
- 09Reverse Words in a StringLeetCode · Word Traversal / Stack / Two Pointers+9Medium
- 09Valid Palindrome (Alpha-Numeric Filter)LeetCode · Two Pointers / Filtering+9Easy
- 10Roman to IntegerLeetCode · Conditional Traversal / Hash Map Lookup+9Easy
- 10First Unique Character in a StringLeetCode · Two-Pass Hashing / Frequency Count+9Easy
- 10Integer to RomanLeetCode · Greedy Lookup / Paired Hash Map+9Medium
- 10Valid ParenthesesLeetCode · Stack / Hash Map Lookup+9Easy
- 11Rotation of Matrix (90 Degrees Clockwise)Smart Interviews · In-Place Transpose & ReverseMedium
- 11Diagonal Traversal of MatrixSmart Interviews · Index GroupingMedium
- 11Spiral Traversal of MatrixSmart Interviews · Boundary PointersMedium
- 12Ternary Array CostSmart Interviews · Local Cost Minimization / GreedyMedium
- 12Alternate SeatingSmart Interviews · Greedy Allocation / Boundary CheckMedium
- 12Jump GameLeetCode · Greedy Array Traversal+9Medium
- 12Merge IntervalsLeetCode · Interval Management / Sorting+9Medium
- 13Count Digits and Reverse NumberTakeUForward · Digit Traversal (Modulo/Division)Easy
- 13Greatest Common Divisor (GCD/HCF)TakeUForward · Euclidean AlgorithmEasy
- 13Check Palindrome and Armstrong NumberTakeUForward · Digit Reversal and Power SummationEasy
- 14Subsets (Backtracking)LeetCode · Backtracking / DFS+9Medium
- 14Permutations (Backtracking)LeetCode · Backtracking / State Management+9Medium
- 14Power of TwoLeetCode · Bit-Manipulation (Masking)+7Easy
- 14Single NumberLeetCode · Bit-Manipulation (XOR)+9Easy
- 15Sum of Digits (Recursive)HackerRank · Tail Recursion / ModuloEasy
- 15N-th Fibonacci NumberLeetCode · Overlapping Subproblems / Memoization+9Medium
- 15Print N to 1 and 1 to NTakeUForward · State Preservation / Pre vs. Post RecursionEasy
- 16Binary Search (Iterative & Recursive)LeetCode · Logarithmic Search+9Easy
- 17Bubble SortCustom · Quadratic Sorting / SwappingEasy
- 19Quick Sort (Implementation)Custom · PartitioningMedium
- 20Sort Colors (Dutch National Flag)LeetCode · Three-Way Partitioning / Two Pointers+9Medium
- 21Heap Sort (Implementation)Custom · Priority Queue / Heapify+7Medium
- 22Counting Sort (Implementation)Custom · Non-Comparison Sorting / Frequency MappingMedium
- 23Search in Rotated Sorted ArrayLeetCode · Modified Binary Search+9Medium
- 24Kth Largest Element (Quickselect)LeetCode · Quickselect / Partitioning+9Medium
- 25Sort List (Merge Sort on Linked Lists)LeetCode · Divide and Conquer / Slow & Fast Pointers+6Medium
- 26Max Element in ArrayPractice · Linear ScanEasy
- 27Number DistributionPractice · Bucketing / BinningEasy
- 28The Missing NumberPractice · Sum Formula / XOREasy
- 29Duplicate Number in ArrayPractice · HashSet TrackingMedium
- 30Max Element in ArraySmart Interviews (Hive) · Linear ScanEasy
- 31Number DistributionSmart Interviews (Hive) · Counting + ConditionalsEasy
- 32Odd and Even SumSmart Interviews (Hive) · Linear Scan + ModuloEasy
- 33Fizz BuzzLeetCode (412) · Simulation + Modulo+9Easy
- 34Richest Customer WealthLeetCode (1672) · Row Sum + Running Max+2Easy
- 35Number of Steps to Reduce a Number to ZeroLeetCode (1342) · Simulation / Bit Counting+3Easy
- 36Remove Duplicates from Sorted ArrayLeetCode (26) · Two Pointers (Read/Write)+9Easy
- 37Minimum Queen Moves to Reach TargetLeetCode (4061) · Case Analysis (Geometry)Easy
- 38Transform Array Using Pair OperationsLeetCode (4062) · Invariant (Sum Preserved)Medium
- 39Longest Subarray Divisible by K with At Most One Negation ILeetCode (4063) · Enumerate Subarrays + Modular SetMedium
- 40Remove ElementLeetCode (27) · Two Pointers (Read/Write)+8Easy
- 41Merge Strings AlternatelyLeetCode (1768) · Two Pointers (Zip)+8Easy
- 42Maximum Nesting Depth of the ParenthesesLeetCode (1614) · Counter as Implicit Stack+4Easy
- 43Two SumLeetCode (1) · Hash Map Complement Lookup+9Easy
- 44Contains DuplicateLeetCode (217) · Hash Set Membership+9Easy
- 45Valid ParenthesesLeetCode (20) · Stack Matching+9Easy
- 46Valid AnagramLeetCode (242) · Frequency Counting+9Easy
- 47Group AnagramsLeetCode (49) · Canonical Key Grouping+9Medium
- 48Valid PalindromeLeetCode (125) · Two Pointers Inward+9Easy
- 49Binary SearchLeetCode (704) · Halving the Search Space+9Easy
- 50Reverse Linked ListLeetCode (206) · Pointer Reversal+9Easy
- 51Maximum SubarrayLeetCode (53) · Kadane's Algorithm+9Medium
- 52Product of Array Except SelfLeetCode (238) · Prefix & Suffix Passes+9Medium
- 53Longest Substring Without Repeating CharactersLeetCode (3) · Sliding Window + Set+9Medium
- 54Best Time to Buy and Sell StockLeetCode (121) · Track the Minimum+9Easy
- 55Kids With the Greatest Number of CandiesLeetCode (1431) · Precompute Max + Scan+3Easy