Jaskamal Kainth
Software Engineer, Samsung
Mathematics and Computer Science, BITS Pilani
about
Professional Profile
Software Engineer with 7+ years of experience specializing in Data Structures, Algorithms, Elasticsearch/OpenSearch, AI/ML (NLP), Generative AI, Spring, RESTful Web Services, HTTP/SIP protocol, and AWS Cloud Services. Currently focused on e-commerce search systems, multilingual search optimization, advanced information retrieval methods, and cloud-native scalable architectures.
My technical expertise is built upon a solid foundation of a dual degree in Mathematics and Computer Science from BITS Pilani, Pilani campus.
Passionate about knowledge sharing and technical mentorship, I've conducted over 300 hours of DSA training and live coding problem-solving sessions for Samsung employees, helping build stronger engineering teams.
I remain committed to continuous learning and making meaningful contributions to advance technology solutions.
During college, I used to actively participate in algorithmic problem-solving on various competitive programming platforms, including ACM-ICPC.
My ACM International Collegiate Programming Contest profile:
Blog
Academic Work
Energy-Efficient Scheduling Algorithms
Benchmarking scheduling algorithms like HEFT, Deadline slack, NDES, GDES using C++ to conclude the best algorithm for which the energy consumption is minimum for a real-time parallel application on a heterogeneous distributed embedded system.
View ThesisNumerical solutions for PDEs in Option pricing
Applying the B-Spline collocation method and Radial basis function method to solve the Black Scholes equation used in Option pricing.
View ThesisAlgorithmic Problems and Solutions
Bloom Filters
Understanding Bloom Filters: a space-efficient probabilistic data structure with implementation and mathematical analysis of false positive rates.
Fast Fourier Transformation
How to multiply two polynomials in O(nlogn) time using FFT and its applications for large number multiplication.
7 Solutions to 1 Problem
Multiple approaches to solve: Find the number of triplets which satisfies the property A[i] < B[j] < C[k].
C++ Notes
Comprehensive notes on C++ programming language concepts and techniques.
ReadSegment Tree Problems
A curated list of 20 Segment tree problems with difficulty ranging from Easy to Hard.
ReadString Algorithm Problems
A collection of String related problems involving various Algorithms like Z-Algorithm, Trie, Suffix Array, Aho-corasick, and Hashing.
ReadDisjoint Set Union Problems
A comprehensive list of problems using Disjoint Set Union data structure.
ReadGraph Theory Notes
Detailed notes on the Graph Theory concepts and related problem-solving techniques.
ReadExperiments & Interactive Demos
Pixelate Your Image
Upload any image and transform it into pixel art with random character overlays.
DemoANN HNSW Simulation
Visualization of Hierarchical Navigable Small World algorithm for approximate nearest neighbor search.
DemoRandom Bounce Pattern with Dots
An interactive visualization demonstrating particle simulation with bouncing dots.
Demo