Sorry for not posting anything yesterday - wasn't able to do anything just revised older concepts .
15 Aug 2k25,
Happy Independence Day Everyone .....
Today majorly focused on DSA didn't do dev
- Solved 4 problems : -Checking if LL is Palindrome : Did solve using both optimal (reversing other half n then comparing simultaneously) and brute (using stacks) -Segregating odd and even numbered nodes -Remove nth node from back : for the optimal approach of this ques that is using 2 pointers fast and slow it me be multiple dry runs to handle the edge cases -Delete middle node of ll
- also did solve sort ll through brute force optimal approach uses merge sort will revise it first and then use it .
Learnings i took back :
- need to handle test cases
- think deeper to find out optimal approach
Tmr is sat will try to do dev and catch up there .
Good Night
Top comments (0)