Skip to content

Instantly share code, notes, and snippets.

View KotaHemanthUC's full-sized avatar
💭
Aspiring Open source developer who follows work of Apache, RaghuRaj!

KotaHemanthUC

💭
Aspiring Open source developer who follows work of Apache, RaghuRaj!
5 followers · 91 following
View GitHub Profile
@KotaHemanthUC
KotaHemanthUC / BulkPG.md
Created September 22, 2025 20:24 
@Override
 public void bulkInsert(List<UserEntityPermission> permissions) {
  int chunkSize = (int) Math.ceil((double) permissions.size() / THREADS);
  ExecutorService executor = Executors.newFixedThreadPool(THREADS);

  for (int i = 0; i < THREADS; i++) {
   int start = i * chunkSize;
   int end = Math.min(start + chunkSize, permissions.size());
   List<UserEntityPermission> subList = permissions.subList(start, end);
@KotaHemanthUC
KotaHemanthUC / angular-curriculum.md
Created July 5, 2025 08:26 — forked from Colt/angular-curriculum.md

#Angular Curriculum

Unit 1:

  • Intro and Setup
  • 2 Way Data Binding
  • Expressions and Filters
  • Intro to Controllers
  • Built-In Directives
  • Angular Events
@KotaHemanthUC
KotaHemanthUC / consultancy_leadership.txt
Last active February 11, 2025 22:47
Leadership Principal related questions are very important, and your responses will be evaluated towards it.
We don’t have exact questions but below will help
1. Customer Obsession
Question: How would you design a DynamoDB table to handle high customer traffic during a sale event, ensuring a great user experience?
@KotaHemanthUC
KotaHemanthUC / system_design.exp
Last active January 20, 2025 04:51
Scoring for each level by a serial mocking taking Engineer:
E3 (Junior): Basic understanding (CRUD, simple DB usage), minimal focus on scale.
E4 (Mid-Level): Can outline core components (caching, load balancing) with some trade-offs.
E5 (Senior): Solid distributed architecture, deeper reasoning on database choices and scaling.
E6+ (Staff+): Realistic system design with detailed, near-production architecture and an almost ready-to-go implementation plan.
@KotaHemanthUC
KotaHemanthUC / tries.collection
Created January 8, 2025 03:37
Q1 : Given list of words and a string of numerals, output a list of words from the dict that could be reached by the given numbers as typed on a phone dialpad.
Originally I though, hmm, words, maybe a trie. Then I realized there's no need, you can just hashmap.
The inteviewer actually seemed more junior than me, so she had me implement both? But I couldn't really think of
why the trie would be more efficient than hashmap. Either way storage is O(NK), creating the structure is O(NK) but
querying is O(1) for hashmap and O(N) for trie. She asked me why it's O(NK) storage for the trie implementation and
I said well we could either be exponential with respect to K or be lower bounded by NK, which seems better.
Did I miss something?
Test1 : ["barb, "lane", "aasa"], "2272" -> ["barb", "aasa"]
@KotaHemanthUC
KotaHemanthUC / backend_collection.txt
Last active January 23, 2025 04:39
Some companies have already moved towards testing candidates with non-LeetCode style coding interviews, and these can be
quite challenging. People often find themselves uncertain about how to approach them, struggling with problems that may seem
simple at first glance.
If you're curious, these problems might sound something like this:
A large e-commerce company wants to implement a new feature where every new customer has the ability to apply a promo code on
their website. Your goal is to create a new API using the company's existing services to support this functionality.
*