Vigneshwaran B
Software Engineer (SDE Intern at Klenty Soft Inc)
Software Engineer with 8+ months of experience. Recently added multiple LeetCode strategies including Zero-Filled Subarrays, Best Time to Buy/Sell Stock, Maximum Product Subarray, Longest Common Prefix, Count Elements with Maximum Frequency, and Permutations (iterative via next-permutation). Demonstrates strong algorithmic breadth and consistent practice.
$About
Software Engineer with 8+ months of experience. Recently added multiple LeetCode strategies including Zero-Filled Subarrays, Best Time to Buy/Sell Stock, Maximum Product Subarray, Longest Common Prefix, Count Elements with Maximum Frequency, and Permutations (iterative via next-permutation). Demonstrates strong algorithmic breadth and consistent practice.
$Skills
▶Technical
Advanced in MERN stack, strong with React, Node.js, TypeScript, Electron, Docker, Kubernetes, REST APIs, design patterns.
▶Tools
Proficient with Git, Docker, Kubernetes, Postman, Kibana, ElasticSearch, Ngrok, Nginx, Figma.
▶Soft Skills
Excellent communication, teamwork, documentation, and time management.
$Experience
Software Development Engineer Intern
Klenty Soft Inc
Completed 29 tasks
- Wrote scripts using Bluebird and MongoDB streams to extract credit charge data from the database, grouped, and exported as CSV.
- Developed and shipped 20+ front-end and full-stack features
- Fixed 5+ production issues
- Contributed to high-scale systems using microservice architecture
- Implemented design patterns and adhered to SOLID principles
Process Threads
Internship Trainee
Karomi Technology Pvt Ltd
- Developed and enhanced the Translation JSON Converter Tool...
- Automated translation handling for multiple languages...
- Built functionalities for managing translations and languages...
- Implemented JSON upload features...
- Technologies Used: ElectronJS, ReactJS.
- Integrations Used: Google Translate API.
$Projects
WATT (WhatsApp Automated Texting Tool)
Desktop tool that automates WhatsApp messages using Puppeteer and ElectronJS.
- ▸Simulated human typing with randomized delays...
- ▸Implemented JSON-based message templates...
- ▸Frontend optimization using useMemo, useCallback...
Leetcode-Repo
Collaborative TypeScript repo using Strategy Pattern.
- ▸Scalable structure for strategies...
- ▸Solutions for common algorithmic problems...
- ▸Focus on code modularity and collaboration.
NextJS Dashboard App
Dashboard App exploring SEO, SSR, CSR with Pages Router.
Redux Social Media App
Redux toolkit-based app with mock services and custom hooks.
$Education
BE Computer Science
Jeppiaar Engineering College
Graduated, strong academic foundation, continuous self-learning.
$Problem Solving
Intermediate to Advanced (strong in arrays, strings, binary search, sliding window, hash map, subarray problems; consistently improving with 26 problems solved)
Last updated: 2025-09-26
Active Kernels
Recent Solutions
Maximum Sum Subarray (Kadane's Algorithm)
Dynamic Programming (Kadane's Algorithm)
Finds the maximum sum of a contiguous subarray using Kadane's algorithm. Handles edge cases including empty arrays, single elements, all negative numbers, and large number scenarios (1000000, -1000000, 1000000). Time complexity O(n), space complexity O(1). Recently implemented with comprehensive edge case testing.
Count Hills and Valleys
Two Pointers, Skipping Duplicates, Local Extrema Detection
Counts the number of hills and valleys in an array by skipping consecutive duplicates and checking for local maxima and minima. Handles edge cases where all elements are the same or there are plateaus. Efficient for single-pass detection.
Search in Rotated Sorted Array
Binary Search with Rotation Handling
Searches for a target in a rotated sorted array using binary search. Handles both sorted and unsorted halves by comparing nums[left] with nums[mid]. Correctly manages edge cases and avoids infinite loops. Returns target index or -1 if not found. Time complexity O(log n), space complexity O(1).
Zero-Filled Subarrays (LeetCode 2348)
Sliding Window with Streak Counting
Counts the total number of zero-filled subarrays by maintaining a streak counter. For each consecutive zero, adds the current streak length to the total count. Efficiently handles edge cases and returns the total count of all possible zero-filled subarrays. Time complexity O(n), space complexity O(1).
Best Time to Buy and Sell Stock (LeetCode 121)
One-Pass Tracking Min Price and Max Profit
Scans prices once, tracking the minimum price so far and the maximum profit achievable at each step. Time complexity O(n), space O(1).
Find N Unique Integers Sum up to Zero (LeetCode 1304)
Constructive Symmetric Pairs
Builds an array of length n using ±i symmetric pairs and optionally 0 for odd n, ensuring the total sum is zero. Time complexity O(n), space O(n).
Maximum Product Subarray (LeetCode 152)
Dynamic Tracking of Max/Min Products with Swap on Negatives
Maintains current max and min products to handle negatives; swaps on negative values and updates the global maximum. Time complexity O(n), space O(1).
Longest Common Prefix (LeetCode 14)
Iteratively Shrink Candidate Prefix
Sorts by length and iteratively shrinks the candidate prefix until all strings start with it. Time complexity O(S) where S is total characters.
Areas for Improvement
$Goals & Growth
Dream
Become a solo-founder of a SaaS product and build Arka Soft Inc as a globally respected tech company.
Short Term
- ▸Secure a full-time software engineering role
- ▸Build a strong foundation and become indispensable to the company
- ▸Help prevent company-level risks through technical and strategic solutions
Long Term
- ▸Establish Arka Soft Inc
- ▸Become CTO, CEO, and Tech Architect
- ▸Gain expertise as a DevOps Engineer, Cloud Engineer, Tester, and Ethical Hacker
Inspiration
Talk is cheap. Show me the code.
— Linus Torvalds
The more you buy, the more you save.
— Jensen Huang
Growth History
2025-07-20
Strong progress in full-stack development, recognized for contributions, improving code quality and delivery.
2025-09-23
Algorithmic momentum: +6 problems across sliding window, two pointers, hash map, and permutations. Strengthening edge case handling and iterative problem generation.
2025-09-26
Daily progress maintained; solved Consecutive Odds and reinforced single-pass array scanning and edge-case checks.
Areas for Improvement
$Contact
Let's connect and build something amazing together.