• home
  • about
  • Blog
  • Experiments
  • Projects
  • contact

Jaskamal Kainth

Chief Software Engineer, Samsung

Mathematics and Computer Science, BITS Pilani

about

Software Engineer with 6+ years of experience in Data Structures, Algorithms, Elasticsearch, AI/ML (NLP), GenAI, Spring, RESTful Web Services, HTTP/SIP protocol, and AWS Cloud Services.

My strong engineering background is complemented by a dual degree in Mathematics and Computer Science from BITS Pilani, Pilani campus.

In addition to my technical expertise, I am passionate about sharing my knowledge and experience with others. With a focus on enhancing software competency, I have conducted over 200 hours of DSA training and live coding problem-solving sessions for Samsung employees.

I am dedicated to continuously improving my skills and contributing to the growth of the technology industry.

I love solving algorithmic problems on online platforms and I took part in many programming contests, like ACM-ICPC.

Here are my handles of some programming websites.

  • Codeforces
  • Codechef
  • Spoj
  • HackerRank
  • Hackerearth

My ICPCID for ACM International Collegiate Programming Contest - ICPCID

Blog

Algorithmic Problems and Solutions

  • A list of 20 Segment tree problems with difficulty starting from Easy to Hard. Link
  • A List of String related problems involving various Algorithms like Z-Algorithm, Trie, Suffix Array, Aho-corasick, Hashing. Link
  • A list of Disjoint Set Union problems. Link
  • Notes on the Graph Theory concepts and problems. Link
  • 7 Solutions to 1 Problem - Find the number of triplets which satisfies the property A[i] < B[j] < C[k].
    • Problem link.
    • My Presentation slides.
  • Fast fourier transformation to multiply two polynomials in O(nlogn) time. FFT can be used to multiply 2 large numbers in nlogn time as well. More about FFT and its applications in the following links.
    • Codeforces Blog.
    • Slides.
  • C++ Notes Blog Link

Music

  • Music is my only drug. Link

Others

  • Notes on the Elasticsearch concepts. Link
Experiments

Experiments with OpenAi Chatgpt

  • Random bounce pattern with dots
Projects
  • Energy-Efficient Scheduling Algorithms: (May 2018)

    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.

  • Numerical solutions for PDEs in Option pricing: (Dec 2017)

    Applying the B-Spline collocation method and Radial basis function method to solve the Black Scholes equation used in Option pricing.

contact
Gmail
Github
Twitter
Facebook
Instagram
Linkedin
Stay curious. Stay Alive!